Fixed points, zeros and Newton's method

DOI10.1007/3-540-37660-7zbMath1095.65047OpenAlexW614309271MaRDI QIDQ816392

Jean-Pierre Dedieu

Publication date: 13 March 2006

Published in: Mathématiques \& Applications (Berlin) (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/3-540-37660-7

zbMATH Keywords

fixed pointsBanach spacesNewton's methodtextbookHilbert spacessystems of nonlinear equationsEuclidean spacesgeneralised inversealpha-theoryunderdetermined systemsmethod of Newton-Gauss

Mathematics Subject Classification ID

Numerical computation of solutions to systems of equations (65H10) Iterative procedures involving nonlinear operators (47J25) Fixed-point theorems (47H10) Numerical solutions to equations with nonlinear operators (65J15) Fixed points and periodic points of dynamical systems; fixed-point index theory; local dynamics (37C25) Discrete approximations in optimal control (49M25) Implicit function theorems; global Newton methods on manifolds (58C15) Introductory exposition (textbooks, tutorial papers, etc.) pertaining to numerical analysis (65-01)

Related Items (22)

Newton's method for solving generalized equations: Kantorovich's and Smale's approaches ⋮ A quadratically convergent algorithm for structured low-rank approximation ⋮ Functional norms, condition numbers and numerical algorithms in algebraic geometry ⋮ On the zeta Mahler measure function of the Jacobian determinant, condition numbers and the height of the generic discriminant ⋮ A new accurate and efficient iterative numerical method for solving the scalar and vector nonlinear equations: approach based on geometric considerations ⋮ A certified numerical algorithm for the topology of resultant and discriminant curves ⋮ New general convergence theory for iterative processes and its applications to Newton-Kantorovich type theorems ⋮ Convergence of starters for solving Kepler's equation via Smale's \(\alpha \)-test ⋮ Expanding the applicability of Newton's method using Smale's \(\alpha\)-theory ⋮ Condition numbers for the cube. I: Univariate polynomials and hypersurfaces ⋮ Fast evaluation and root finding for polynomials with floating-point coefficients ⋮ Complexity of path-following methods for the eigenvalue problem ⋮ Rigid continuation paths II. structured polynomial systems ⋮ Numerical approximation of multiple isolated roots of analytical systems ⋮ An arithmetic Poisson formula for the multi-variate resultant ⋮ On the probability distribution of data at points in real complete intersection varieties ⋮ An analysis of the convergence of Newton iterations for solving elliptic Kepler's equation ⋮ Stochastic perturbations and smooth condition numbers ⋮ An extension of a theorem by Wang for Smale's \(\alpha\)-theory and applications ⋮ Smale’s 17th problem: Average polynomial time to compute affine and projective solutions ⋮ Rigid continuation paths I. Quasilinear average complexity for solving polynomial systems ⋮ On the probability distribution of condition numbers of complete intersection varieties and the average radius of convergence of Newton's method in the underdetermined case

This page was built for publication: Fixed points, zeros and Newton's method