Using Chebyshev polynomials and approximate inverse triangular factorizations for preconditioning the conjugate gradient method (Q2901137)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 6057652
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Using Chebyshev polynomials and approximate inverse triangular factorizations for preconditioning the conjugate gradient method |
scientific article; zbMATH DE number 6057652 |
Statements
Using Chebyshev polynomials and approximate inverse triangular factorizations for preconditioning the conjugate gradient method (English)
0 references
16 July 2012
0 references
symmetric positive definite matrix
0 references
sparse matrix
0 references
approximate inverse triangular factorizations
0 references
polynomial preconditioning
0 references
Chebyshev polynomials
0 references
numerical examples
0 references
parallel computation
0 references
conjugate gradient method
0 references
sparse matrix-vector products
0 references
condition number
0 references
0.8358761668205261
0 references
0.8225722908973694
0 references
0.8198767900466919
0 references
0.8118835091590881
0 references
0.8118833303451538
0 references
