Positive definiteness aspects of vectorizable preconditioners
From MaRDI portal
Recommendations
- Uniform preconditioners for problems of positive order
- The use of preconditioning in direct methods of solving positive definite linear systems
- Multisplitting preconditioners for a symmetric positive definite matrix
- A robust incomplete factorization preconditioner for positive definite matrices
- The preconditioned SOR iterative method for positive definite matrices
- scientific article; zbMATH DE number 4190984
- Massively parallel preconditioners for symmetric positive definite linear systems
- A symmetric positive definite preconditioner for saddle-point problems
- Combination preconditioning of saddle point systems for positive definiteness.
- scientific article; zbMATH DE number 877150
Cited in
(6)- A vectorizable variant of pgcr methods for unsymmetric linear systems
- 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
- The pgcr method for solving unsymmetric linear systems on a vector multiprocessor
- Vectorizable preconditioners for elliptic difference equations in three space dimensions
- Vectorizable preconditioners for mixed finite element solution of second-order elliptic problems
This page was built for publication: Positive definiteness aspects of vectorizable preconditioners
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q583846)