Skip to main content
SpringerLink
Log in
Book cover

Symbolic Algebraic Methods and Verification Methods pp 21–33Cite as

Symbolic-Numeric Algorithms for Polynomials: some recent results

  • Conference paper

  • 258 Accesses

Abstract

One of the most powerful recent ideas for the solution of systems of multivariate polynomials, namely the conversion of such systems to eigenproblems for commuting families of sparse matrices, will be shown by example.

This is a preview of subscription content, log in via an institution.

Chapter
USD   29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD   39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD   54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Learn about institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  • Corless, R.M. (1996). Gröbner bases and matrix eigenproblems. Sigsam Bulletin: Communications in Computer Algebra, 30(4):26–32.

    MathSciNet  Google Scholar 

  • Corless, R.M., Gianni, P. M., and Trager, B. M. (1997). A reordered Schur factorization method for zero-dimensional polynomial systems with multiple roots. In Proceedings of the ACM-SIGSAM International Symposium on Symbolic and Algebraic Computation, Association for Computing Machinery, New York pp. 133–140.

    Google Scholar 

  • Corless, R.M., Kaltofen, E., and Watt, S. M. (2000). Symbolic-Numeric Algorithms for Polynomials. Springer-Verlag, to appear.

    Google Scholar 

  • Cox, D., Little, J., and O’Shea, D. (1992). Ideals, Varieties, and Algorithms. Springer-Verlag, New York.

    MATH  Google Scholar 

  • Emiris, I.Z. and Mourrain, B. (1999). Matrices in elimination theory. J. Symb. Comp., 28(1 & 2):3–44.

    Article  MathSciNet  MATH  Google Scholar 

  • von zur Gathen, J. and Gerhardt, J. (1999). Modern Computer Algebra. Cambridge University Press.

    Google Scholar 

  • Gohberg, I., Lancaster, P., and Rodman, L. (1986). Invariant Subspaces of Matrices with Applications. Canadian Mathematical Society, Toronto.

    Google Scholar 

  • Horn, R. and Johnson, C. (1985). Matrix Analysis. Cambridge University Press.

    Google Scholar 

  • Jüger, C. and Ratz, D. (1995). A combined method for enclosing all solutions of nonlinear systems of polynomial equations. Reliable Computing, 1:41–64.

    Article  Google Scholar 

  • Li, T.Y., Sauer, T., and Yorke, J.A. (1989). The cheater’s homotopy. SIAM J. Num. Anal., 26(5):1241–1251.

    Article  MathSciNet  MATH  Google Scholar 

  • Möller, H.M. and Stetter, H.J. (1995). Multivariate polynomial equations with multiple zeros solved by matrix eigenproblems. Numer. Math., 70(3):311–330.

    Article  MathSciNet  MATH  Google Scholar 

  • Mourrain, B. (1998). Computing isolated polynomial roots by matrix methods. J. Symb. Comp., 26(6):715–738.

    Article  MathSciNet  MATH  Google Scholar 

  • Mourrain, B. (1999). An introduction to linear algebra methods for solving polynomial equations. In Lipitakis, E.A., editor, HERCMA, pp. 179–200.

    Google Scholar 

  • Stetter, H.J. (1993). Multivariate polynomial equations as matrix eigenproblems. In Contributions to Numerical Mathematics, volume 2 of Series in Applicable Analysis, pp. 355–371. World Scientific.

    Article  MathSciNet  Google Scholar 

  • Stetter, H.J. (1996). Matrix eigenproblems are at the heart of polynomial system solving. Sigsam Bulletin: Communications in Computer Algebra, 30(4):22–25.

    MATH  Google Scholar 

  • Weispfenning, V. (1992). Comprehensive Gröbner bases. J. Symb. Comp., 14:1–29.

    Article  MathSciNet  MATH  Google Scholar 

  • Wilkinson, J.H. (1984). The Perfidious Polynomial, In: MAA Studies, volume 24, pp. 1–28. Mathematical Association of America.

    MathSciNet  MATH  Google Scholar 

Download references

Authors
  1. Robert M. Corless
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Institut fûr Angewandte Mathematik, Universitüt Karlsruhe, Deutschland

    Götz Alefeld

  2. Mathematisch-Physikalische Fakultüt, Universitüt Karlovy, Prag, Tschechien, Czech Republic

    Jiří Rohn

  3. Technische Informatik III, Technische Universitüt Hamburg, Deutschland

    Siegfried Rump

  4. Department of Mathematical Science, Ehime University, Matsuyama, Japan

    Tetsuro Yamamoto

Rights and permissions

Reprints and permissions

Copyright information

© 2001 Springer-Verlag Wien

About this paper

Cite this paper

Corless, R.M. (2001). Symbolic-Numeric Algorithms for Polynomials: some recent results. In: Alefeld, G., Rohn, J., Rump, S., Yamamoto, T. (eds) Symbolic Algebraic Methods and Verification Methods. Springer, Vienna. https://doi.org/10.1007/978-3-7091-6280-4_4

Download citation

  • DOI: https://doi.org/10.1007/978-3-7091-6280-4_4

  • Publisher Name: Springer, Vienna

  • Print ISBN: 978-3-211-83593-7

  • Online ISBN: 978-3-7091-6280-4

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation