Acceleration of implicit schemes for large systems of nonlinear differential-algebraic equations
When solving large systems of nonlinear differential-algebraic equations by implicit schemes, each integration step requires the solution of a system of large nonlinear algebraic equations. The latter is solved by an inexact Newton method which, in its turn, leads to a set of large linear systems co...
Gespeichert in:
Veröffentlicht in: | AIMS Mathematics 2020, Vol.5 (1), p.603-618 |
---|---|
Hauptverfasser: | , |
Format: | Artikel |
Sprache: | eng |
Schlagworte: | |
Online-Zugang: | Volltext |
Tags: |
Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
|
Zusammenfassung: | When solving large systems of nonlinear differential-algebraic equations by implicit schemes, each integration step requires the solution of a system of large nonlinear algebraic equations. The latter is solved by an inexact Newton method which, in its turn, leads to a set of large linear systems commonly solved by a Krylov subspace iterative method. The efficiency of the whole process depends on the initial guesses for the inexact Newton and the Krylov subspace methods. An inexpensive approach is proposed and justified that computes good initial guesses for these methods. It requires a subspace of small dimension and the use of line search and trust region for the inexact Newton method and Petrov-Galerkin for the Krylov subspace method. Numerical examples are included to illustrate the effectiveness of the proposed approach. Keywords: nonlinear equations; nonlinear DAE systems; inexact Newton; GMRES; line search; trust region |
---|---|
ISSN: | 2473-6988 2473-6988 |
DOI: | 10.3934/math.2020040 |