Multihomogeneous Newton methods
DOI10.1090/S0025-5718-99-01114-XzbMATH Open0951.65049OpenAlexW1983592997MaRDI QIDQ4955862FDOQ4955862
Authors: Michael Shub, Jean-Pierre Dedieu
Publication date: 22 May 2000
Published in: Mathematics of Computation (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1090/s0025-5718-99-01114-x
Recommendations
- A generalized multivariable Newton method
- A multidimensional interval Newton method
- scientific article; zbMATH DE number 7370583
- Newton-type multilevel optimization method
- Newton iteration with multiquadrics for the solution of nonlinear PDEs
- Newton-Padé approximations for multivariate functions
- scientific article
- Approximate Newton methods for nonsmooth equations
- scientific article; zbMATH DE number 4037012
- On a new multiparametric family of Newton-like methods
convergencezerosevaluation mapgeneralized eigenvalue problemsmultihomogeneous analytic functionsmultihomogeneous Newton method
Complexity and performance of numerical algorithms (65Y20) Numerical computation of eigenvalues and eigenvectors of matrices (65F15) 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)
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- COMPLEXITY AND REAL COMPUTATION: A MANIFESTO
- Title not available (Why is that?)
- Complexity of Bezout’s Theorem IV: Probability of Success; Extensions
- Complexity of Bezout's theorem. V: Polynomial time
- Complexity of Bezout's theorem. III: Condition number and packing
- Complexity of Bezout's Theorem I: Geometric Aspects
- Condition operators, condition numbers, and condition number theorem for the generalized eigenvalue problem
- Condition Number Analysis for Sparse Polynomial Systems
- Title not available (Why is that?)
- On generalized Newton algorithms: Quadratic convergence, path-following and error analysis
- A modification of the Neumann-Poincaré method for multiply connected regions
Cited In (9)
- Symplectic methods for the approximation of the exponential map and the Newton iteration on Riemannian submanifolds
- Newton's method for overdetermined systems of equations
- Extended Newton methods for conic inequalities: approximate solutions and the extended Smale \(\alpha\)-theory
- On semilocal convergence analysis for two-step Newton method under generalized Lipschitz conditions in Banach spaces
- Perturbation theory for homogeneous polynomial eigenvalue problems
- A primal-dual formulation for certifiable computations in Schubert calculus
- Complexity of path-following methods for the eigenvalue problem
- Kantorovich's theorem on Newton's method under majorant condition in Riemannian manifolds
- Rigid continuation paths II. structured polynomial systems
This page was built for publication: Multihomogeneous Newton methods
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4955862)