A vectorizable variant of pgcr methods for unsymmetric linear systems

DOI10.1080/00207169208804109zbMath0799.65038OpenAlexW2045953309MaRDI QIDQ4021071

Xing-Ping Liu

Publication date: 17 January 1993

Published in: International Journal of Computer Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1080/00207169208804109

zbMATH Keywords

convergencenumerical examplesiterative methodsincomplete Cholesky factorizationvectorizable algorithmsunsymmetric linear systemsPGCR methodpreconditioned generalized conjugate residue method

Mathematics Subject Classification ID

Iterative numerical methods for linear systems (65F10) Numerical algorithms for specific classes of architectures (65Y10)

Cites Work

• Unnamed Item
• Positive definiteness aspects of vectorizable preconditioners
• Vectorization of some block preconditioning conjugate gradient methods
• The performance of FORTRAN implementations for preconditioned conjugate gradients on vector computers
• Parallel conjugate gradient-like algorithms for solving sparse nonsymmetric linear systems on a vector multiprocessor
• On the efficient implementation of preconditioned s-step conjugate gradient methods on multiprocessors with memory hierarchy
• Variational Iterative Methods for Nonsymmetric Systems of Linear Equations
• Convergence of a parallel jacobi-type method
• Group explicit iterative methods for solving large linear systems
• Preconditioned gradient type methods applied to nonsymmetric linear systems
• A Vectorizable Variant of some ICCG Methods

This page was built for publication: A vectorizable variant of pgcr methods for unsymmetric linear systems