Condition number analysis for sparse polynomial systems

DOI10.1007/978-3-642-60539-0_6MaRDI QIDQ4336091zbMATH OpenOpenAlexFDO

Authors 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 condition numbersparse polynomial system

Mathematics Subject Classification ID

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

Recommendations

• High probability analysis of the condition number of sparse polynomial systems
• Complexity of sparse polynomial solving: homotopy on toric varieties and the condition metric
• A Polyhedral Method for Solving Sparse Polynomial Systems
• Probabilistic condition number estimates for real polynomial systems. I: A broader family of distributions

Cited in

(18)

• Some lower bounds for the complexity of continuation methods
• Condition number bounds for problems with integer coefficients
• Finding a cluster of zeros of univariate polynomials
• Bernstein's second theorem and Viro's method for sparse polynomial systems in chemistry
• Finding zeros of analytic functions: -theory for secant type methods
• Numerical analysis of a bisection-exclusion method to find zeros of univariate analytic functions
• On simple double zeros and badly conditioned zeros of analytic functions of 𝑛 variables
• A condition number theorem for underdetermined polynomial systems
• Obituary: Jean-Pierre Dedieu, 1949-2012
• Solving a sparse system using linear algebra
• Multihomogeneous Newton methods
• Newton's method for overdetermined systems of equations
• Kronecker's and Newton's approaches to solving: a first comparison
• On the geometry of Graeffe iteration
• High probability analysis of the condition number of sparse polynomial systems
• Numerical instability of algebraic rootfinders
• Global residues for sparse polynomial systems
• General local convergence theory for a class of iterative processes and its applications to Newton's method

This page was built for publication: Condition number analysis for sparse polynomial systems

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4336091)