Positive definiteness aspects of vectorizable preconditioners
From MaRDI portal
Publication:583846
DOI10.1016/0167-8191(89)90080-XzbMath0692.65024MaRDI QIDQ583846
Victor Eijkhout, Panayot S. Vassilevski
Publication date: 1989
Published in: Parallel Computing (Search for Journal in Brave)
positive definitenesspreconditionertest problemsvectorizationM-matricesconjugate gradient iterationincomplete block factorization methodsrow sum criteria
Boundary value problems for second-order elliptic equations (35J25) Iterative numerical methods for linear systems (65F10) Numerical computation of matrix norms, conditioning, scaling (65F35) Numerical solution of discretized equations for boundary value problems involving PDEs (65N22)
Related Items
Vectorizable preconditioners for elliptic difference equations in three space dimensions, The pgcr method for solving unsymmetric linear systems on a vector multiprocessor, 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∗∗∗, On some ways of approximating inverses of banded matrices in connection with deriving preconditioners based on incomplete block factorizations