Truncated incomplete factorization for conjugate-gradient methods in two and three dimensions (Q1111332): Difference between revisions
From MaRDI portal
Set profile property. |
Set OpenAlex properties. |
||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1016/0096-3003(88)90134-8 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2026103301 / rank | |||
Normal rank | |||
Revision as of 18:32, 19 March 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Truncated incomplete factorization for conjugate-gradient methods in two and three dimensions |
scientific article |
Statements
Truncated incomplete factorization for conjugate-gradient methods in two and three dimensions (English)
0 references
1988
0 references
The author investigates how the computational performance of the conjugate gradient method changes when factorization is made more incomplete. Both two- and three-dimensional truncated factorization are treated, considering their performance for difference matrices. For two- dimensional problems the factorization which uses all nine bands has all in all the best performance. In three dimensions the orthogonal factorization method generally gives the best results.
0 references
truncated incomplete factorizations
0 references
conjugate gradient method
0 references
orthogonal factorization
0 references
