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

被引:13
|
作者
Casella, Francesco [1 ,2 ]
Bachmann, Bernhard [1 ,2 ]
机构
[1] Politecn Milan, Dipartimento Elettron Informaz & Bioingn, Milan, Italy
[2] Univ Appl Sci Bielefeld, Fac Engn & Math, Bielefeld, Germany
关键词
Newton-Raphson's algorithm; Convergence; Nonlinear equations; Equation-based modelling;
D O I
10.1016/j.amc.2021.125991
中图分类号
O29 [应用数学];
学科分类号
070104 ;
摘要
The initialization of equation-based differential-algebraic system models, and more in general the solution of many engineering and scientific problems, require the solution of systems of nonlinear equations. Newton-Raphson's method is widely used for this purpose; it is very efficient in the computation of the solution if the initial guess is close enough to it, but it can fail otherwise. In this paper, several criteria are introduced to analyze the influence of the initial guess on the evolution of Newton-Raphson's algorithm and to identify which initial guesses need to be improved in case of convergence failure. In particular, indicators based on first and second derivatives of the residual function are introduced, whose values allow to assess how much the initial guess of each variable can be responsible for the convergence failure. The use of such criteria, which are based on rigorously proven results, is successfully demonstrated in three exemplary test cases. (C) 2021 Elsevier Inc. All rights reserved.
引用
收藏
页数:18
相关论文
共 50 条
  • [1] OPTIMAL INITIAL APPROXIMATIONS FOR THE NEWTON-RAPHSON DIVISION ALGORITHM
    SCHULTE, MJ
    OMAR, J
    SWARTZLANDER, EE
    COMPUTING, 1994, 53 (3-4) : 233 - 242
  • [2] The Monte Carlo Newton-Raphson algorithm
    Kuk, AYC
    Cheng, YW
    JOURNAL OF STATISTICAL COMPUTATION AND SIMULATION, 1997, 59 (03) : 233 - 250
  • [3] OPTIMAL VALUE FOR THE NEWTON-RAPHSON DIVISION ALGORITHM
    PARKER, A
    HAMBLEN, JO
    INFORMATION PROCESSING LETTERS, 1992, 42 (03) : 141 - 144
  • [4] Modeling Of Active Bending By The Method Newton-Raphson And The Modified Newton-Raphson
    Herda, Roman
    Slivansky, Milos
    Sandanus, Jaroslav
    CIVIL AND ENVIRONMENTAL ENGINEERING, 2024, 20 (02) : 862 - 870
  • [5] Control of dynamics of the modified Newton-Raphson algorithm
    Gosciniak, Ireneusz
    Gdawiec, Krzysztof
    COMMUNICATIONS IN NONLINEAR SCIENCE AND NUMERICAL SIMULATION, 2019, 67 : 76 - 99
  • [6] SKETCHED NEWTON-RAPHSON
    Yuan, Rui
    Lazaric, Alessandro
    Gower, Robert M.
    SIAM JOURNAL ON OPTIMIZATION, 2022, 32 (03) : 1555 - 1583
  • [7] SKETCHED NEWTON-RAPHSON
    Yuan R.
    Lazaric A.
    GOWER R.M.
    SIAM Journal on Computing, 2022, 51 (04) : 1555 - 1583
  • [8] THE NEWTON-RAPHSON CONNECTION
    COOK, TE
    CHEMICAL ENGINEERING, 1988, 95 (11) : 169 - &
  • [9] ON NEWTON-RAPHSON ITERATION
    TRAUB, JF
    AMERICAN MATHEMATICAL MONTHLY, 1967, 74 (08): : 996 - &
  • [10] RANDOMIZED NEWTON-RAPHSON
    JOSEPH, G
    LEVINE, A
    LIUKKONEN, J
    APPLIED NUMERICAL MATHEMATICS, 1990, 6 (06) : 459 - 469