Abstract
Is a sparse polynomial system more easy to solve than a non sparse one? In this paper we introduce a new invariant, the sparse condition number, and we study sparse polynomial system analysis in terms of this invariant.
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.
Bibliography
B. Beauzamy, How the roots of a polynomial vary with its coefficients: a local quantitative result. Preprint, B. Beauzamy, Institut de Calcul Mathématique, 37 rue Tournefort, 75005 Paris, Prance.
B. Beauzamy, J. Dégot: Differential Identities, Transactions of the American Mathematical Society, Volume 347, Number 7, July 1995, pp 2607–2619.
. R. Bhatia, L. Eisner, G. Krause, Bounds for the variation of the roots of a polynomial and the eigenvalues of a matrix. Lin. Alg. and its Apppl. 142 (1990)195–209.
L. Blum, F. Cucker, M. Shub, S. Smale, Complexity and Real Computation. To appear.
J.P. Dedieu, Approximate Solutions of Numerical Problems, Condition Number Analysis and Condition Number Theorems. To appear in: Proceedings of the Summer Seminar on “Mathematics of Numerical Analysis: Real Number Algorithms”, Park City, UT, July 17 - August 11, 1995, Lectures in Applied Mathematics.
J.P. Dedieu. Estimations for the separation number of a polynomial system. To appear in: Journal of Symbolic Computation.
J.P. Dedieu, Condition Operators, Condition Numbers and Condition Number Theorem for the Generalized Eigenvalue Problem. To appear in: Linear Alg. and its Appl.
. C. Eckart, G. Young, A principal axis transformation for non-Hermitian matrices. Bull. Am. Math. Soc. 45(1939)118–121.
. T. Kojima, On the limits of the roots of an algebraic equation. Tohoku Math. J. 11(1917)119–127.
E. Kostlan, On the distribution of the roots of random polynomials. In: M. Hirsch, J. Marsden, M. Shub Eds., From Topology to Computation: Proceedings of the Smalefeast, (1993) 419–431, Springer-Verlag.
M. Marden, Geometry of Polynomials, AMS, 1966.
A. Ostrowski, Solutions of Equations in Euclidean and Banach Spaces. Academic Press, New-York, 1976.
.J. Renegar, On the efficiency of Newton’s Method in Approximating all Zeros of a System of Complex Polynomials. Math. Op. Research, 12(1987)121–148.
. M. Shub, S. Smale, Complexity of Bézout’s Theorem 1: Geometric Aspects. Journal of the Amer. Math. Soc. 6(19 93)459–501.
. M. Shub, S. Smale, Complexity of Bézout’s Theorem 5: polynomial time. Theoretical Computer Science, 133(1994)141–164.
M. Shub, S. Smale, Complexity of Bézout’s Theorem 4: Probability of success; Extensions. 1996. To appear in SIAM Journal of Num. Analysis.
. S. Smale, The fondamental Theorem of Algebra and Complexity Theory. Bulletin of the Amer. Math. Soc, 4(1981)1–36.
. S. Smale, Newton’s method estimates with data at one point. In: The merging of disciplines: New directions in pure and applied mathematics. R. Ewing, K. Cross, C. Martin Eds. Springer Verlag, 1986.
. Wang Xinghua, Han Danfu, On dominating sequence method in the point estimate and Smale theorem. Sci. China (Ser. A) 33(1990)135–144.
J. Wilkinson, Rounding Errors in Algebraic Processes. Her Majesty’s Stationery Office, London, 1963.
. H. Wozniakowski, Numerical Stability for Solving Nonlinear Equations, Num. Math., 27(1977)373–390.
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 1997 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Dedieu, JP. (1997). Condition Number Analysis for Sparse Polynomial Systems. In: Cucker, F., Shub, M. (eds) Foundations of Computational Mathematics. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-60539-0_6
Download citation
DOI: https://doi.org/10.1007/978-3-642-60539-0_6
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-61647-4
Online ISBN: 978-3-642-60539-0
eBook Packages: Springer Book Archive