On the choice of initial guesses for the Newton-Raphson algorithm

DOI10.1016/J.AMC.2021.125991OpenAlexW2991316847MaRDI QIDQ2242137

Bernhard Bachmann, F. Casella

Publication date: 9 November 2021

Published in: Applied Mathematics and Computation (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1911.12433

zbMATH Keywords

convergencenonlinear equationsequation-based modellingNewton-Raphson's algorithm

Mathematics Subject Classification ID

Numerical computation of solutions to systems of equations (65H10)

Uses Software

• Modelica

Cites Work

• Weaker conditions for the convergence of Newton's method
• Symbolic manipulation techniques for model simplification in object-oriented modelling of large scale continuous systems
• The theory of Newton's method
• Improving the initial guess for the Newton-Raphson protocol in time-dependent simulations
• Algorithm 907
• The Consistent Initialization of Differential-Algebraic Systems
• Order Reduction of General Nonlinear DAE Systems by Automatic Tearing
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: On the choice of initial guesses for the Newton-Raphson algorithm