On the solution of systems of equations with constant rank derivatives
From MaRDI portal
Publication:542442
DOI10.1007/s11075-010-9426-5zbMath1218.65044OpenAlexW1986551235MaRDI QIDQ542442
Ioannis K. Argyros, Saïd Hilout
Publication date: 10 June 2011
Published in: Numerical Algorithms (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s11075-010-9426-5
Related Items (3)
Inexact Gauss-Newton like methods for injective-overdetermined systems of equations under a majorant condition ⋮ Extending the applicability of the Gauss-Newton method under average Lipschitz-type conditions ⋮ Local convergence analysis of inexact Gauss-Newton method for singular systems of equations under majorant and center-majorant condition
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A new semilocal convergence theorem for Newton's method
- Convergence criterion of Newton's method for singular systems with constant rank derivatives
- Kantorovich's type theorems for systems of equations with constant rank derivatives
- Convergence behavior of Gauss-Newton's method and extensions of the Smale point estimate theory
- On a class of Newton-like methods for solving nonlinear equations
- A Kantorovich-type convergence analysis for the Gauss-Newton-method
- Newton's method for analytic systems of equations with constant rank derivatives
- Convergence and uniqueness properties of Gauss-Newton's method
- On an application of Newton's method to nonlinear operators with \(\omega\)-conditioned second derivative
- Generalized inverses. Theory and applications.
- On the Newton-Kantorovich hypothesis for solving equations
- A unifying local-semilocal convergence analysis and applications for two-point Newton-like methods in Banach space
- Computational theory of iterative methods.
- A Newton-Raphson method for the solution of systems of equations
- On an iterative algorithm of order 1.839… for solving nonlinear operator equations∗)
- The fundamental theorem of algebra and complexity theory
- Convergence and Complexity of Newton Iteration for Operator Equations
- COMPLEXITY AND REAL COMPUTATION: A MANIFESTO
- Newton's method under weak Kantorovich conditions
- Generalized differentiability conditions for Newton's method
- Complexity of Bezout’s Theorem IV: Probability of Success; Extensions
- Newton's method for overdetermined systems of equations
- Perturbation theory for pseudo-inverses
- The Newton method for operators with Hölder continuous first derivative
This page was built for publication: On the solution of systems of equations with constant rank derivatives
