Condition Number Analysis for Sparse Polynomial Systems
DOI10.1007/978-3-642-60539-0_6zbMATH Open0869.65036OpenAlexW86507280MaRDI QIDQ4336091FDOQ4336091
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
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
General theory of numerical methods in complex analysis (potential theory, etc.) (65E05) 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) Other generalizations of function theory of one complex variable (32A30)
Cited In (17)
- Condition number bounds for problems with integer coefficients
- Multihomogeneous Newton methods
- Newton's method for overdetermined systems of equations
- General local convergence theory for a class of iterative processes and its applications to Newton's method
- Some lower bounds for the complexity of continuation methods
- On the geometry of Graeffe iteration
- Finding zeros of analytic functions: \(\alpha\)-theory for secant type methods
- High probability analysis of the condition number of sparse polynomial systems
- Obituary: Jean-Pierre Dedieu, 1949-2012
- Kronecker's and Newton's approaches to solving: a first comparison
- Numerical analysis of a bisection-exclusion method to find zeros of univariate analytic functions
- A condition number theorem for underdetermined polynomial systems
- Bernstein's second theorem and Viro's method for sparse polynomial systems in chemistry
- Global residues for sparse polynomial systems
- On simple double zeros and badly conditioned zeros of analytic functions of 𝑛 variables
- Solving a sparse system using linear algebra
- Finding a cluster of zeros of univariate polynomials
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)
