Resultants and neighborhoods of a polynomial

Authors:
Valentina Marotta
Affiliations:
Department of Mathematics and Computer Science, Catania, Italy
Venue:
SNSC'01 Proceedings of the 2nd international conference on Symbolic and numerical scientific computation
Year:
2001

Citing 6
Cited 1

Approximate polynomial greatest common divisors and nearest singular polynomials

ISSAC '96 Proceedings of the 1996 international symposium on Symbolic and algebraic computation
Regular Article: Perturbation of Polynomial Ideals

Advances in Applied Mathematics
Efficient algorithms for computing the nearest polynomial with constrained roots

ISSAC '98 Proceedings of the 1998 international symposium on Symbolic and algebraic computation
Efficient algorithms for computing the nearest polynomial with a real root and related problems

ISSAC '99 Proceedings of the 1999 international symposium on Symbolic and algebraic computation
The Mathematica book (4th edition)

The Mathematica book (4th edition)
The nearest polynomial with a given zero, and similar problems

ACM SIGSAM Bulletin

Distance bounds of ε-points on hypersurfaces

Theoretical Computer Science

Quantified Score

Hi-index	0.00

Visualization

Abstract

In this paper the concept of neighborhood of a polynomial is analyzed. This concept is spreading into Scientific Computation where data are often uncertain, thus they have a limited accuracy. In this context we give a new approach based on the idea of using resultant in order to know the common factors between an empirical polynomial and a generic polynomial in its neighborhood. Moreover given a polynomial, the Square Free property for the polynomials in its neighborhood is investigated.