Approximate zeros and condition numbers

DOI10.1006/JCOM.1999.0503MaRDI QIDQ1974565zbMATH OpenOpenAlexWikidataFDO

Authors Felipe Cucker

Publication date 7 May 2000

Published in Journal of Complexity (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1006/jcom.1999.0503

zbMATH Keywords

approximate zeroscomplexity boundscondition numbersroundoff errorsystems of polynomial equations

Mathematics Subject Classification ID

Real polynomials: location of zeros (26C10) Zeros of polynomials, rational functions, and other analytic functions of one complex variable (e.g., zeros of functions with bounded Dirichlet integral) (30C15) Numerical computation of solutions to systems of equations (65H10) Complexity and performance of numerical algorithms (65Y20)

Review text

The paper is an addendum to the paper \textit{F. Cucker} and \textit{S. Smale} [Lect. Notes Comput. Sci. 1461, 115-126 (1998; Zbl 0929.65027)]. Here, the author proves the same result for a different condition number.

Recommendations

• Approximate Zeros of Quadratically Convergent Algorithms
• scientific article; zbMATH DE number 1113610
• A condition number theorem for underdetermined polynomial systems

Cites work

• scientific article; zbMATH DE number 3648910 (Why is no real title available?)
• scientific article; zbMATH DE number 3992817 (Why is no real title available?)
• On a theory of computation and complexity over the real numbers: 𝑁𝑃- completeness, recursive functions and universal machines

Cited in

(9)

• Probabilistic condition number estimates for real polynomial systems. I: A broader family of distributions
• Grid methods in computational real algebraic (and semialgebraic) geometry
• On the complexity of the Plantinga-Vegter algorithm
• Computing the homology of semialgebraic sets. I: Lax formulas
• Smoothed analysis for the condition number of structured real polynomial systems
• Condition number based complexity estimate for solving polynomial systems
• Computing the homology of real projective sets
• On the computation of the homology of semialgebraic sets
• A numerical algorithm for zero counting. I: Complexity and accuracy

This page was built for publication: Approximate zeros and condition numbers

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