Newton's method for overdetermined systems of equations

DOI10.1090/S0025-5718-99-01115-1zbMATH Open0949.65061OpenAlexW2019363796MaRDI QIDQ4955863FDOQ4955863

Jean-Pierre Dedieu, Michael Shub

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-01115-1

zbMATH Keywords

convergencecontinuation methodHilbert spacesNewton's methodoverdetermined systemsparameter-dependent systemscomplexity upper bound estimates

Mathematics Subject Classification ID

Iterative procedures involving nonlinear operators (47J25) Numerical solutions to equations with nonlinear operators (65J15) Numerical algorithms for specific classes of architectures (65Y10)

Cites Work

• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Optimization Techniques on Riemannian Manifolds
• COMPLEXITY AND REAL COMPUTATION: A MANIFESTO
• Complexity of Bezout’s Theorem IV: Probability of Success; Extensions
• Multihomogeneous Newton methods
• Complexity of Bezout's theorem. V: Polynomial time
• Complexity of Bezout's theorem. III: Condition number and packing
• On the efficiency of algorithms of analysis
• On the Efficiency of Newton's Method in Approximating All Zeros of a System of Complex Polynomials
• Condition Number Analysis for Sparse Polynomial Systems
• Circle fitting by linear and nonlinear least squares
• On generalized Newton algorithms: Quadratic convergence, path-following and error analysis

Cited In (41)

• Convergence analysis of the Gauss-Newton-type method for Lipschitz-like mappings
• Well posedness of ODE's and continuity equations with nonsmooth vector fields, and applications
• Convergence of the Gauss–Newton method for a special class of systems of equations under a majorant condition
• Some lower bounds for the complexity of continuation methods
• Local convergence analysis of the Gauss-Newton method under a majorant condition
• Extending the applicability of the Gauss-Newton method under average Lipschitz-type conditions
• Extended Newton methods for conic inequalities: approximate solutions and the extended Smale \(\alpha\)-theory
• Nearest multivariate system with given root multiplicities
• Certifying solutions to overdetermined and singular polynomial systems over \(\mathbb{Q}\)
• Improved local convergence analysis of inexact Newton-like methods under the majorant condition
• Local convergence analysis of inexact Gauss-Newton like methods under majorant condition
• Determining dimension of the solution component that contains a computed zero of a polynomial system
• A heuristic method for certifying isolated zeros of polynomial systems
• On semilocal convergence analysis for two-step Newton method under generalized Lipschitz conditions in Banach spaces
• On the mathematical foundations of learning
• Convergence behavior of Gauss-Newton's method and extensions of the Smale point estimate theory
• Local convergence of the Gauss-Newton method for injective-overdetermined systems of equations under a majorant condition
• On the solution of systems of equations with constant rank derivatives
• Convergence criterion of Newton's method for singular systems with constant rank derivatives
• Kronecker's and Newton's approaches to solving: a first comparison
• Newton's method for analytic systems of equations with constant rank derivatives
• An efficient line search trust-region for systems of nonlinear equations
• A new nonmonotone line-search trust-region approach for nonlinear systems
• Overdetermined Weierstrass iteration and the nearest consistent system
• Probabilistic condition number estimates for real polynomial systems. I: A broader family of distributions
• Regularization and Matrix Computation in Numerical Polynomial Algebra
• Newton's method with deflation for isolated singularities of polynomial systems
• Minimization methods for approximating tensors and their comparison
• Kantorovich's type theorems for systems of equations with constant rank derivatives
• Title not available (Why is that?)
• On simple double zeros and badly conditioned zeros of analytic functions of 𝑛 variables
• An Algorithm for the Intersection Problem of Planar Parametric Curves
• Local convergence analysis of inexact Gauss-Newton method for singular systems of equations under majorant and center-majorant condition
• Computing multiple roots of inexact polynomials
• Numerical Evidence for a Conjecture in Real Algebraic Geometry
• Convergence properties of a restricted Newton-type method for generalized equations with metrically regular mappings
• Gauss-Newton methods with approximate projections for solving constrained nonlinear least squares problems
• Extended Newton-type method and its convergence analysis for nonsmooth generalized equations
• Certification for polynomial systems via square subsystems
• On the convergence of extended Newton-type method for solving variational inclusions
• The numerical factorization of polynomials

This page was built for publication: Newton's method for overdetermined systems of equations

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