Incomplete block matrix factorization preconditioning methods. The ultimate answer? (Q1064733): 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/0377-0427(85)90004-4 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W1989220483 / rank | |||
Normal rank | |||
Revision as of 21:20, 19 March 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Incomplete block matrix factorization preconditioning methods. The ultimate answer? |
scientific article |
Statements
Incomplete block matrix factorization preconditioning methods. The ultimate answer? (English)
0 references
1985
0 references
A survey and comparison for iterative methods for large sparse linear systems is given. The methods are preconditioning methods based on incomplete block matrix factorizations. It is shown how these methods can be vectorized and parallelized and that these methods are very efficient and robust compared with pointwise incomplete factorization preconditioning methods or multilevel methods.
0 references
parallel computing
0 references
survey
0 references
comparison
0 references
large sparse linear systems
0 references
preconditioning methods
0 references
incomplete block matrix factorizations
0 references
multilevel methods
0 references
