The convergence rate of block preconditioned systems arising from LMF-based ODE codes (Q5952340)
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: The convergence rate of block preconditioned systems arising from LMF-based ODE codes |
scientific article; zbMATH DE number 1688756
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | The convergence rate of block preconditioned systems arising from LMF-based ODE codes |
scientific article; zbMATH DE number 1688756 |
Statements
The convergence rate of block preconditioned systems arising from LMF-based ODE codes (English)
0 references
9 June 2002
0 references
The solution of ordinary and partial differential equations using implicit linear multistep formulas is considered. Linear boundary value problems lead to linear systems with matrices that are close to block Toeplitz matrices. The circulant Toeplitz matrices are used as preconditioners when the conjugate gradient method is applied. Then \(O(\log s)\) steps are sufficient.
0 references
preconditioning
0 references
implicit linear multistep formulas
0 references
linear boundary value problems
0 references
circulant Toeplitz matrices
0 references
conjugate gradient method
0 references
0.8625026345252991
0 references
0.8211380243301392
0 references
0.8174511194229126
0 references
0.800589919090271
0 references
0.800589919090271
0 references
