Multihomogeneous Newton methods

DOI10.1090/S0025-5718-99-01114-XzbMath0951.65049MaRDI QIDQ4955862

Michael Shub, Jean-Pierre Dedieu

Publication date: 22 May 2000

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

zbMATH Keywords

convergence; zeros; evaluation map; generalized eigenvalue problems; multihomogeneous analytic functions; multihomogeneous Newton method

Mathematics Subject Classification ID

65F15: Numerical computation of eigenvalues and eigenvectors of matrices

65H10: Numerical computation of solutions to systems of equations

30C15: Zeros of polynomials, rational functions, and other analytic functions of one complex variable (e.g., zeros of functions with bounded Dirichlet integral)

65Y20: Complexity and performance of numerical algorithms

Related Items

Newton's method for overdetermined systems of equations, Perturbation theory for homogeneous polynomial eigenvalue problems, Symplectic methods for the approximation of the exponential map and the Newton iteration on Riemannian submanifolds

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• On generalized Newton algorithms: Quadratic convergence, path-following and error analysis
• Complexity of Bezout's theorem. V: Polynomial time
• Condition operators, condition numbers, and condition number theorem for the generalized eigenvalue problem
• Complexity of Bezout's theorem. III: Condition number and packing
• A modification of the Neumann-Poincaré method for multiply connected regions
• Complexity of Bezout's Theorem I: Geometric Aspects
• Condition Number Analysis for Sparse Polynomial Systems
• COMPLEXITY AND REAL COMPUTATION: A MANIFESTO
• Complexity of Bezout’s Theorem IV: Probability of Success; Extensions