On some new approximate factorization methods for block tridiagonal matrices suitable for vector and parallel processors (Q1013149)
From MaRDI portal
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | On some new approximate factorization methods for block tridiagonal matrices suitable for vector and parallel processors |
scientific article |
Statements
On some new approximate factorization methods for block tridiagonal matrices suitable for vector and parallel processors (English)
0 references
17 April 2009
0 references
Stair matrices are used to construct parallel polynomial approximate inverse preconditioners which lead to an efficient parallel solver for sparse block-tridiagonal linear systems. These preconditioners are suitable to maximize parallelism. In adition, some theoretical results concerning these preconditioners are presented and it is further shown how to effectively construct preconditioners for any nonsingular block tridiagonal H-matrices. Besides, a reasonably good performance of these preconditioners is illustrated with numerical experiments driven from second order elliptic partial differential equations and from problems brought in from oil reservoir simulations.
0 references
tridiagonal matrix
0 references
stair matrix
0 references
polynomial sparse approximate
0 references
preconditioning
0 references
parallel algorithm
0 references
approximate factorization methods
0 references
approximate inverse preconditioners
0 references
sparse block-tridiagonal linear systems
0 references
block tridiagonal H-matrices
0 references
numerical experiments
0 references
second order elliptic equations
0 references
oil reservoir simulations
0 references
0 references
0 references
0 references
0 references
