The convergence rate of block preconditioned systems arising from LMF-based ODE codes (Q5952340): Difference between revisions
From MaRDI portal
Created a new Item |
Set OpenAlex properties. |
||
| (2 intermediate revisions by 2 users not shown) | |||
| Property / MaRDI profile type | |||
| Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1023/a:1021906926616 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W144457986 / rank | |||
Normal rank | |||
| links / mardi / name | links / mardi / name | ||
Latest revision as of 10:44, 30 July 2024
scientific article; zbMATH DE number 1688756
| Language | Label | Description | Also known as |
|---|---|---|---|
| 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
