Error in homotopy methods for random roots

DOI10.5206/MT.V5I4.24335MaRDI QIDQ7231814zbMATH OpenFDO

Authors Robert M. Corless, Michelle Hatzel

Publication date 22 April 2026

Published in Maple Transactions (Search for Journal in Brave)

Copyright license Creative Commons Attribution 4.0 International

Full work available at URL https://doi.org/10.5206/MT.V5I4.24335

zbMATH Keywords

Euler's methodhomotopy start systemLagrange basisNewton's methodnumerical analysisnumerical homotopy continuationpsuedozerosroot neighbourhoodsunivariate polynomials

Mathematics Subject Classification ID

Global methods, including homotopy approaches to the numerical solution of nonlinear equations (65H20)

Cites work

• A Constructive Proof of the Brouwer Fixed-Point Theorem and Computational Results
• A graduate introduction to numerical methods. From the viewpoint of backward error analysis
• A homotopy for solving general polynomial systems that respects m- homogeneous structures
• Barycentric Lagrange Interpolation
• GENERALIZATIONS OF NEWTON'S METHOD
• How many zeros of a random polynomial are real?
• scientific article; zbMATH DE number 3740680 (Why is no real title available?)
• scientific article; zbMATH DE number 47206 (Why is no real title available?)
• scientific article; zbMATH DE number 1069614 (Why is no real title available?)
• scientific article; zbMATH DE number 953044 (Why is no real title available?)
• Introduction to Numerical Continuation Methods
• Numerical condition of polynomials in different forms
• On condition numbers and the distance to the nearest ill-posed problem
• On the numerical condition of polynomials in Bernstein form
• Pseudospectra and delay differential equations
• Pseudospectra of matrix polynomials that are expressed in alternative bases
• Pseudozeros of polynomials and pseudospectra of companion matrices
• Root Neighborhoods of a Polynomial
• Root neighborhoods, generalized lemniscates, and robust stability of dynamic systems
• Simplicial and Continuation Methods for Approximating Fixed Points and Solutions to Systems of Equations
• Structured pseudospectra for polynomial eigenvalue problems, with applications
• The Approximation of Fixed Points of a Continuous Mapping
• The Cheater’s Homotopy: An Efficient Procedure for Solving Systems of Polynomial Equations
• The evaluation of the zeros of ill-conditioned polynomials. I, II
• The Numerical Solution of Systems of Polynomials Arising in Engineering and Science
• The numerical stability of barycentric Lagrange interpolation
• The Runge example for interpolation and Wilkinson's examples for rootfinding

This page was built for publication: Error in homotopy methods for random roots

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