BILUS: A block version of ILUS factorization. (Q1880490)
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: BILUS: A block version of ILUS factorization. |
scientific article; zbMATH DE number 2103988
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | BILUS: A block version of ILUS factorization. |
scientific article; zbMATH DE number 2103988 |
Statements
BILUS: A block version of ILUS factorization. (English)
0 references
28 September 2004
0 references
The author introduces a new preconditioning technique for general sparse linear systems. This method is called BILUS and is a block form of the incomplete LU factorization in the sparse skyline storage format (ILUS). The BILUS factorization strategy has the same properties as the ILUS preconditioner including its efficiency and robustness. Additionally the BILUS preconditioner can be run in parallel and it is cheaper to construct than the ILUS factorization.
0 references
preconditioning
0 references
iterative methods
0 references
linear systems
0 references
parallel algorithms
0 references
skyline storage format
0 references
sparse matrices
0 references
incomplete LU factorization
0 references
0 references
0.8699871301651001
0 references
0.8699871301651001
0 references
0.8326048254966736
0 references
0.8322187662124634
0 references
0.8292531967163086
0 references
