On simple double zeros and badly conditioned zeros of analytic functions of 𝑛 variables

DOI10.1090/S0025-5718-00-01194-7zbMath0965.65071OpenAlexW2033536176MaRDI QIDQ4517525

Michael Shub, Jean-Pierre Dedieu

Publication date: 22 November 2000

Published in: Mathematics of Computation (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1090/s0025-5718-00-01194-7

zbMATH Keywords

analytic functionscondition numberssystems of equationsmultiple zeros

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)

Related Items (12)

Inflation of poorly conditioned zeros of systems of analytic functions ⋮ Improved two-step Newton's method for computing simple multiple zeros of polynomial systems ⋮ A certified iterative method for isolated singular roots ⋮ Isolating clusters of zeros of analytic systems using arbitrary-degree inflation ⋮ Computing Galois groups of Fano problems ⋮ Two-step Newton's method for deflation-one singular zeros of analytic systems ⋮ Numerical approximation of multiple isolated roots of analytical systems ⋮ On the probability distribution of singular varieties of given corank ⋮ Kronecker's and Newton's approaches to solving: a first comparison ⋮ On isolation of simple multiple zeros and clusters of zeros of polynomial systems ⋮ On the probability distribution of condition numbers of complete intersection varieties and the average radius of convergence of Newton's method in the underdetermined case ⋮ Finding a cluster of zeros of univariate polynomials

Cites Work

• Unnamed Item
• Unnamed Item
• On the worst-case arithmetic complexity of approximating zeros of polynomials
• Residue currents and Bezout identities
• Complexity of Bezout's theorem. V: Polynomial time
• Complexity of Bezout's theorem. III: Condition number and packing
• The singularities \(S_ 1^ q\)
• Complexity of Bezout's Theorem I: Geometric Aspects
• Condition Number Analysis for Sparse Polynomial Systems
• Solving a Polynomial Equation: Some History and Recent Progress
• COMPLEXITY AND REAL COMPUTATION: A MANIFESTO
• Complexity of Bezout’s Theorem IV: Probability of Success; Extensions
• Newton's method for overdetermined systems of equations

This page was built for publication: On simple double zeros and badly conditioned zeros of analytic functions of 𝑛 variables