Condition Number Analysis for Sparse Polynomial Systems

DOI10.1007/978-3-642-60539-0_6zbMath0869.65036OpenAlexW86507280MaRDI QIDQ4336091

Jean-Pierre Dedieu

Publication date: 11 August 1997

Published in: Foundations of Computational Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-60539-0_6

zbMATH Keywords

sparse polynomial systemsparse condition number

Mathematics Subject Classification ID

Numerical computation of solutions to systems of equations (65H10) Zeros of polynomials, rational functions, and other analytic functions of one complex variable (e.g., zeros of functions with bounded Dirichlet integral) (30C15) General theory of numerical methods in complex analysis (potential theory, etc.) (65E05) Other generalizations of function theory of one complex variable (32A30)

Related Items

Obituary: Jean-Pierre Dedieu, 1949-2012, Finding zeros of analytic functions: \(\alpha\)-theory for secant type methods, Kronecker's and Newton's approaches to solving: a first comparison, On the geometry of Graeffe iteration, General local convergence theory for a class of iterative processes and its applications to Newton's method, Multihomogeneous Newton methods, Newton's method for overdetermined systems of equations, Some lower bounds for the complexity of continuation methods, Numerical analysis of a bisection-exclusion method to find zeros of univariate analytic functions, Condition number bounds for problems with integer coefficients, Finding a cluster of zeros of univariate polynomials, On simple double zeros and badly conditioned zeros of analytic functions of 𝑛 variables