An efficient implementation scheme of the simplified Newton iteration for block systems of nonlinear equations

DOI10.1016/S0168-9274(01)00050-2zbMath0995.65059OpenAlexW1989681714WikidataQ127174197 ScholiaQ127174197MaRDI QIDQ5953945

Shuangsuo Zhao

Publication date: 9 October 2002

Published in: Applied Numerical Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0168-9274(01)00050-2

zbMATH Keywords

parallel computationinitial value problemLU-decompositionstiff systemblock system of nonlinear equationsintrinsic parallelismsimplified Newton's iteration

Mathematics Subject Classification ID

Numerical computation of solutions to systems of equations (65H10) Nonlinear ordinary differential equations and systems (34A34) Parallel numerical computation (65Y05) Numerical methods for initial value problems involving ordinary differential equations (65L05)

Uses Software

• RODAS

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• The convergence of two Newton-like methods for solving block nonlinear equations and a class of \(r\)-point \((r+1)\)st-order \(A\)-stable one-block methods
• Parallel linear system solvers for Runge-Kutta methods
• On the Efficient Implementation of Implicit Runge-Kutta Methods
• On the implementation of implicit Runge-Kutta methods
• A-stable block implicit one-step methods

This page was built for publication: An efficient implementation scheme of the simplified Newton iteration for block systems of nonlinear equations