The convergence of the perturbed Newton method and its application for ill-conditioned problems (Q426284): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
ReferenceBot (talk | contribs)
Changed an Item
 
(6 intermediate revisions by 5 users not shown)
Property / author
 
Property / author: Rosa M. Peris / rank
Normal rank
 
Property / author
 
Property / author: Antonio Marquina / rank
Normal rank
 
Property / author
 
Property / author: Q426283 / rank
Normal rank
 
Property / review text
 
The paper deals with the numerical solution to nonlinear equations, in particular the case of multiple or almost multiple roots. For this kind of ill-posed problem, the authors propose a modification of the classical Newton method called ``perturbed Newton method''. The idea of this algorithm is calculating the inverse derivative on every Newton iteration at a point given by a combination of the current approximation and the result of an action of some given linear operator. This operator can be selected depending on the equation features. The authors provide a theoretical investigation of convergence and practical recommendations for the use of the proposed method. The perturbed Newton behaves in a way similar to the classic Newton: when the iterates are far from the root it behaves like a bisection and if they are close to the root the sequence becomes second order. Presented numerical examples show the flexibility of perturbed Newton for ill-posed problems and demonstrate its better numerical performance when compared to the classical Newton for ill-posed equations.
Property / review text: The paper deals with the numerical solution to nonlinear equations, in particular the case of multiple or almost multiple roots. For this kind of ill-posed problem, the authors propose a modification of the classical Newton method called ``perturbed Newton method''. The idea of this algorithm is calculating the inverse derivative on every Newton iteration at a point given by a combination of the current approximation and the result of an action of some given linear operator. This operator can be selected depending on the equation features. The authors provide a theoretical investigation of convergence and practical recommendations for the use of the proposed method. The perturbed Newton behaves in a way similar to the classic Newton: when the iterates are far from the root it behaves like a bisection and if they are close to the root the sequence becomes second order. Presented numerical examples show the flexibility of perturbed Newton for ill-posed problems and demonstrate its better numerical performance when compared to the classical Newton for ill-posed equations. / rank
 
Normal rank
Property / Mathematics Subject Classification ID
 
Property / Mathematics Subject Classification ID: 65H05 / rank
 
Normal rank
Property / zbMATH DE Number
 
Property / zbMATH DE Number: 6045127 / rank
 
Normal rank
Property / zbMATH Keywords
 
Newton method
Property / zbMATH Keywords: Newton method / rank
 
Normal rank
Property / zbMATH Keywords
 
nonlinear equations
Property / zbMATH Keywords: nonlinear equations / rank
 
Normal rank
Property / zbMATH Keywords
 
ill-posed problems
Property / zbMATH Keywords: ill-posed problems / rank
 
Normal rank
Property / zbMATH Keywords
 
multiple or almost multiple roots
Property / zbMATH Keywords: multiple or almost multiple roots / rank
 
Normal rank
Property / zbMATH Keywords
 
perturbed Newton method
Property / zbMATH Keywords: perturbed Newton method / rank
 
Normal rank
Property / zbMATH Keywords
 
algorithm
Property / zbMATH Keywords: algorithm / rank
 
Normal rank
Property / zbMATH Keywords
 
convergence
Property / zbMATH Keywords: convergence / rank
 
Normal rank
Property / zbMATH Keywords
 
numerical example
Property / zbMATH Keywords: numerical example / rank
 
Normal rank
Property / author
 
Property / author: Rosa M. Peris / rank
 
Normal rank
Property / author
 
Property / author: Antonio Marquina / rank
 
Normal rank
Property / author
 
Property / author: Vicente F. Candela / rank
 
Normal rank
Property / reviewed by
 
Property / reviewed by: Volodymyr L. Makarov / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/j.amc.2011.08.019 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2026191987 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Inverse Iteration, Ill-Conditioned Equations and Newton’s Method / rank
 
Normal rank
Property / cites work
 
Property / cites work: A modified Newton method for the solution of ill-conditioned systems of nonlinear equations with application to multiple shooting / rank
 
Normal rank
Property / cites work
 
Property / cites work: Solving Ill-Conditioned and Singular Linear Systems: A Tutorial on Regularization / rank
 
Normal rank
Property / cites work
 
Property / cites work: A one-parameter family of quadratically convergent iteration formulae / rank
 
Normal rank
Property / cites work
 
Property / cites work: A one-parameter family of second-order iteration methods / rank
 
Normal rank
Property / cites work
 
Property / cites work: Generalized differentiability conditions for Newton's method / rank
 
Normal rank
Property / cites work
 
Property / cites work: Newton's method under mild differentiability conditions with error analysis / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Newton method for operators with Hölder continuous first derivative / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4034594 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Quasi-Newton Methods, Motivation and Theory / rank
 
Normal rank
Property / cites work
 
Property / cites work: Recurrence relations for a Newton-like method in Banach spaces / rank
 
Normal rank
Property / cites work
 
Property / cites work: Historical developments in convergence analysis for Newton's and Newton-like methods / rank
 
Normal rank
Property / cites work
 
Property / cites work: The convergence of the perturbed Newton method and its application for ill-conditioned problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4818712 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A variant of Newton's method with accelerated third-order convergence / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Newton-Kantorovich Theorem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Recurrence relations for rational cubic methods. I: The Halley method / rank
 
Normal rank
Property / cites work
 
Property / cites work: Recurrence relations for rational cubic methods. II: The Chebyshev method / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3343091 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Newton-Kantorovich method and its global convergence / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 08:34, 5 July 2024

scientific article
Language Label Description Also known as
English
The convergence of the perturbed Newton method and its application for ill-conditioned problems
scientific article

    Statements

    The convergence of the perturbed Newton method and its application for ill-conditioned problems (English)
    0 references
    11 June 2012
    0 references
    The paper deals with the numerical solution to nonlinear equations, in particular the case of multiple or almost multiple roots. For this kind of ill-posed problem, the authors propose a modification of the classical Newton method called ``perturbed Newton method''. The idea of this algorithm is calculating the inverse derivative on every Newton iteration at a point given by a combination of the current approximation and the result of an action of some given linear operator. This operator can be selected depending on the equation features. The authors provide a theoretical investigation of convergence and practical recommendations for the use of the proposed method. The perturbed Newton behaves in a way similar to the classic Newton: when the iterates are far from the root it behaves like a bisection and if they are close to the root the sequence becomes second order. Presented numerical examples show the flexibility of perturbed Newton for ill-posed problems and demonstrate its better numerical performance when compared to the classical Newton for ill-posed equations.
    0 references
    0 references
    Newton method
    0 references
    nonlinear equations
    0 references
    ill-posed problems
    0 references
    multiple or almost multiple roots
    0 references
    perturbed Newton method
    0 references
    algorithm
    0 references
    convergence
    0 references
    numerical example
    0 references
    0 references
    0 references
    0 references
    0 references