Parallel complexity of conjugate gradient method with circulant block-factorization preconditioners for 3D elliptic problems (Q2751248)
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: Parallel complexity of conjugate gradient method with circulant block-factorization preconditioners for 3D elliptic problems |
scientific article; zbMATH DE number 1664512
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Parallel complexity of conjugate gradient method with circulant block-factorization preconditioners for 3D elliptic problems |
scientific article; zbMATH DE number 1664512 |
Statements
21 October 2001
0 references
parallel computation
0 references
numerical examples
0 references
performance
0 references
elliptic boundary value problems
0 references
complexity
0 references
circular block-factorization preconditioners
0 references
preconditioned conjugate gradient method
0 references
fast Fourier transform
0 references
Parallel complexity of conjugate gradient method with circulant block-factorization preconditioners for 3D elliptic problems (English)
0 references
0.8919472098350525
0 references
0.8750730156898499
0 references