Positive definiteness aspects of vectorizable preconditioners
From MaRDI portal
Publication:583846
DOI10.1016/0167-8191(89)90080-XzbMath0692.65024MaRDI QIDQ583846
Panayot S. Vassilevski, Victor Eijkhout
Publication date: 1989
Published in: Parallel Computing (Search for Journal in Brave)
positive definiteness; preconditioner; test problems; vectorization; M-matrices; conjugate gradient iteration; incomplete block factorization methods; row sum criteria
35J25: Boundary value problems for second-order elliptic equations
65F10: Iterative numerical methods for linear systems
65F35: Numerical computation of matrix norms, conditioning, scaling
65N22: Numerical solution of discretized equations for boundary value problems involving PDEs
Related Items
The pgcr method for solving unsymmetric linear systems on a vector multiprocessor, On some ways of approximating inverses of banded matrices in connection with deriving preconditioners based on incomplete block factorizations, Vectorizable preconditioners for elliptic difference equations in three space dimensions, A vectorizable variant of pgcr methods for unsymmetric linear systems, Vectorizable preconditioners for mixed finite element solution of second-order elliptic problems, Incomplete block-factorization preconditioners for solving three-dimensional elliptic difference equations on systolic processors∗∗∗
