An efficient implementation scheme of the simplified Newton iteration for block systems of nonlinear equations (Q5953945)
From MaRDI portal
| This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: An efficient implementation scheme of the simplified Newton iteration for block systems of nonlinear equations |
scientific article; zbMATH DE number 1697621
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | An efficient implementation scheme of the simplified Newton iteration for block systems of nonlinear equations |
scientific article; zbMATH DE number 1697621 |
Statements
An efficient implementation scheme of the simplified Newton iteration for block systems of nonlinear equations (English)
0 references
9 October 2002
0 references
block system of nonlinear equations
0 references
simplified Newton's iteration
0 references
LU-decomposition
0 references
intrinsic parallelism
0 references
parallel computation
0 references
initial value problem
0 references
stiff system
0 references
The author presents an implementation scheme of the simplified Newton's iteration for solving a system of nonlinear equations obtained when an implicit general linear method is applied in order to compute the solution of an initial value problem for a stiff system of ordinary differential equations of the form NEWLINE\[NEWLINEy'=f(y), \quad y(t_0)=y_0, \quad t_0 <t \leq T, \quad f:\Omega \subset \mathbb R^n \to \mathbb R^m,\;m \gg 0.NEWLINE\]NEWLINE NEWLINENEWLINENEWLINEUsing a real similarity transformation for an arbitrary nonsingular matrix, the given implementation scheme has good intrinsic parallelism and is suitable for solving large systems often arising in practical applications.
0 references