Advertisement

Resultants and Neighborhoods of a Polynomial

  • Valentina Marotta
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 2630)

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.

Keywords

Common Factor Homogeneous Polynomial Interval Arithmetic Generic Polynomial Multivariate Polynomial 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    Alefeld, G., Claudio, D. (1998): The basic properties of interval arithmetic, its software realization and some applications. Computer and Structures, 67, 3–8zbMATHCrossRefMathSciNetGoogle Scholar
  2. 2.
    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 YorkGoogle Scholar
  3. 3.
    Geddes, K.O., Monogan, M.B., Heal, K.M., Labahn, G., Vorkoetter, S.M., McCarron, S. (2000): Maple 6, Programming Guide. Waterloo Maple Inc., CanadaGoogle Scholar
  4. 4.
    Hitz, M.A., Kaltofen, E. (1998): Efficient algorithms for computing the nearest polynomial with constrained root. In: Proceed. ISSAC’98 (Ed. O. Gloor), 236–243Google Scholar
  5. 5.
    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–212Google Scholar
  6. 6.
    Karmarkar, N., Lakshman, Y.N. (1996): Approximate polynomial greatest common divisors and nearest singular polynomials. In: Proceed. ISSAC’96, 35–39Google Scholar
  7. 7.
    Laidacker, M.A. (1969): Another theorem relating Sylvester’s matrix and the greatest common divisors. Mathematics Magazine 42, 126–128zbMATHMathSciNetCrossRefGoogle Scholar
  8. 8.
    Jia, R. (1996): Perturbation of polynomial ideals. Advances in Applied Mathematics 17, 308–336zbMATHCrossRefMathSciNetGoogle Scholar
  9. 9.
    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–430Google Scholar
  10. 10.
    Stetter, H.J. (1999): Nearest polynomial with a given zero, and similar problems. SIGSAM Bull. 33 n. 4, 2–4zbMATHCrossRefGoogle Scholar
  11. 11.
    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. USAGoogle Scholar
  12. 12.
    Wolfram, S. (1999): The Mathematica Book. 4th ed., Wolfram Media, Cambridge University PressGoogle Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2003

Authors and Affiliations

  • Valentina Marotta
    • 1
  1. 1.Department of Mathematics and Computer ScienceCataniaItaly

Personalised recommendations