Abstract
This is a survey talk about some recent symbolic-numeric techniques to solve ill-conditioned multivariate polynomial systems. In particular, we will concentrate on systems that are over-constrained or have roots with multiplicities, and are given with inexact coefficients. First I give some theoretical background on polynomial systems with inexact coefficients, ill-posed and ill-conditioned problems, and on the objectives when trying to solve these systems. Next, I will describe a family of iterative techniques which, for a given inexact system of polynomials and given root structure, computes the nearest system which has roots with the given structure. Finally, I present a global method to solve multivariate polynomial systems which are near root multiplicities and thus have clusters of roots. The method computes a new system which is “square-free”, i.e. it has exactly one root in each cluster near the arithmetic mean of the cluster. This method is global in the sense that it works simultaneously for all clusters.
The results presented in the talk are joint work with Itnuit Janovitz-Freireich, Bernard Mourrain, Scott Pope, Lajos Rónyai, Olivier Ruatta, and Mark Sciabica.
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
References
S. E. Hutton, Exact Sums-of-Squares Certificates in Numeric Algebraic Geometry, PhD thesis, North Carolina State University (2011)
Janovitz-Freireich, I., Rónyai, L., Szántó, Á.: Approximate radical of ideals with clusters of roots. In: ISSAC 2006, pp. 146–153. ACM, New York (2006)
Janovitz-Freireich, I., Rónyai, L., Szántó, Á.: Approximate radical for clusters: a global approach using Gaussian elimination or SVD. Math. Comput. Sci. 1, 393–425 (2007)
Janovitz-Freireich, I., Szántó, Á., Mourrain, B., Rónyai, L.: Moment matrices, trace matrices and the radical of ideals. In: ISSAC 2008, pp. 125–132. ACM, New York (2008)
Janovitz-Freireich, I., Szántó, Á., Mourrain, B., Rónyai, L.: On the Computation of Matrices of Traces and Radicals of Ideals. Submitted to Journal of Symbolic Computation (2009); arXiv:0901.2778
Karmarkar, N.K., Lakshman, Y.N.: On approximate GCDs of univariate polynomials. Journal of Symbolic Computation 26, 653–666 (1998)
Mourrain, B.: Isolated points, duality and residues, J. Pure Appl. Algebra 117/118, 469–493 (1997); Algorithms for algebra, Eindhoven (1996)
Pope, S., Szanto, A.: Nearest multivariate system with given root multiplicities. Journal of Symbolic Computation, 606–625 (2009)
Ruatta, O.: Dualité algébrique, structures et applications, PhD thesis, Université de la Méditérranée (2002)
Ruatta, O., Sciabica, M., Szanto, A.: Over-constrained Weierstrass iteration and the nearest consistent system (2009) (accepted for publication)
Zeng, Z.: Computing multiple roots of inexact polynomials. Mathematics of Computation 74, 869–903 (2005)
Zhi, L., Wu, W.: Nearest singular polynomials, J. Symbolic Comput. 26, 667–675 (1998); Symbolic numeric algebra for polynomials
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2011 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Szanto, A. (2011). Symbolic-Numeric Solution of Ill-Conditioned Polynomial Systems (Survey Talk Overview) (Invited Talk). In: Gerdt, V.P., Koepf, W., Mayr, E.W., Vorozhtsov, E.V. (eds) Computer Algebra in Scientific Computing. CASC 2011. Lecture Notes in Computer Science, vol 6885. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-23568-9_27
Download citation
DOI: https://doi.org/10.1007/978-3-642-23568-9_27
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-23567-2
Online ISBN: 978-3-642-23568-9
eBook Packages: Computer ScienceComputer Science (R0)