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.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Alefeld, G., Claudio, D. (1998): The basic properties of interval arithmetic, its software realization and some applications. Computer and Structures, 67, 3–8
Emiris, I. Z. (1998): Symbolic-numeric algebra for polynomials. In: Encyclopedia of Computer Science and Technology, A. Kent and J.G. Williams, editors, vol. 39, 261–281, Marcel Dekker, New York
Geddes, K.O., Monogan, M.B., Heal, K.M., Labahn, G., Vorkoetter, S.M., McCarron, S. (2000): Maple 6, Programming Guide. Waterloo Maple Inc., Canada
Hitz, M.A., Kaltofen, E. (1998): Efficient algorithms for computing the nearest polynomial with constrained root. In: Proceed. ISSAC’98 (Ed. O. Gloor), 236–243
Hitz, M.A., Kaltofen, E. (1999): Efficient algorithms for computing the nearest polynomial with a real root and related problems. In: Proceed. ISSAC’99 (Ed. S. Dooley), 205–212
Karmarkar, N., Lakshman, Y.N. (1996): Approximate polynomial greatest common divisors and nearest singular polynomials. In: Proceed. ISSAC’96, 35–39
Laidacker, M.A. (1969): Another theorem relating Sylvester’s matrix and the greatest common divisors. Mathematics Magazine 42, 126–128
Jia, R. (1996): Perturbation of polynomial ideals. Advances in Applied Mathematics 17, 308–336
Stetter, H.J. (1999): Polynomial with coefficients of limited accuracy. In: Computer Algebra in Scientific Computing (Eds. V.G. Ganzha, E.W. Mayr, E.V. Vorozhtsov), Springer, 409–430
Stetter, H.J. (1999): Nearest polynomial with a given zero, and similar problems. SIGSAM Bull. 33 n. 4, 2–4
Stetter, H.J. (2000): Numerical polynomial algebra: concepts and algorithms. In: ATCM 2000, Proceed. 5th Asian Technology Conf. in Math. (Eds.: W.-Ch. Yang, S.-Ch. Chu, J.-Ch. Chuan), 22–36, ATCM Inc. USA
Wolfram, S. (1999): The Mathematica Book. 4th ed., Wolfram Media, Cambridge University Press
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2003 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Marotta, V. (2003). Resultants and Neighborhoods of a Polynomial. In: Winkler, F., Langer, U. (eds) Symbolic and Numerical Scientific Computation. SNSC 2001. Lecture Notes in Computer Science, vol 2630. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-45084-X_10
Download citation
DOI: https://doi.org/10.1007/3-540-45084-X_10
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-40554-2
Online ISBN: 978-3-540-45084-9
eBook Packages: Springer Book Archive