A vectorizable variant of pgcr methods for unsymmetric linear systems
From MaRDI portal
Recommendations
- The pgcr method for solving unsymmetric linear systems on a vector multiprocessor
- On vectorizing the preconditioned generalized conjugate residual methods
- Preconditioned iterative algorithms for large sparse unsymmetric problems
- Parallel conjugate gradient-like algorithms for solving sparse nonsymmetric linear systems on a vector multiprocessor
- Vectorization of some block preconditioning conjugate gradient methods
Cites work
- A Vectorizable Variant of some ICCG Methods
- Convergence of a parallel jacobi-type method
- Group explicit iterative methods for solving large linear systems
- scientific article; zbMATH DE number 3215568 (Why is no real title available?)
- On the efficient implementation of preconditioned s-step conjugate gradient methods on multiprocessors with memory hierarchy
- Parallel conjugate gradient-like algorithms for solving sparse nonsymmetric linear systems on a vector multiprocessor
- Positive definiteness aspects of vectorizable preconditioners
- Preconditioned gradient type methods applied to nonsymmetric linear systems
- The performance of FORTRAN implementations for preconditioned conjugate gradients on vector computers
- Variational Iterative Methods for Nonsymmetric Systems of Linear Equations
- Vectorization of some block preconditioning conjugate gradient methods
This page was built for publication: A vectorizable variant of pgcr methods for unsymmetric linear systems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4021071)