The pgcr method for solving unsymmetric linear systems on a vector multiprocessor

DOI10.1080/00207169408804264zbMath0824.65015OpenAlexW2033232519MaRDI QIDQ4839727

Xing-Ping Liu

Publication date: 13 November 1995

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

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

zbMATH Keywords

algorithmconvergencenumerical examplesiterative methodsvector multiprocessorunsymmetric linear systemsmodified incomplete Cholesky decompositionparallel- vector computerpreconditioned generalized conjugate residual method

Mathematics Subject Classification ID

Iterative numerical methods for linear systems (65F10) Numerical computation of matrix norms, conditioning, scaling (65F35)

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: The pgcr method for solving unsymmetric linear systems on a vector multiprocessor