Iterative methods for solving sparse linear systems with a parallel preconditioner

DOI10.1080/00207169208804098zbMath0757.65037OpenAlexW1966492133MaRDI QIDQ4021059

Giovanni Zilli

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/00207169208804098

zbMATH Keywords

convergence rateparallel algorithmssparse linear systemsKrylov subspace methodssupercomputersnonsymmetric matricesconjugate gradient-type methodsincomplete \(LU\) factorizationblock triangular systemlevel scheduling methodpreconditioned gradient-type methodspreconditioned iterative projection methods

Mathematics Subject Classification ID

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

Uses Software

• NSPCG

Cites Work

• Exploiting autotasking on a CRAY Y-MP: An improved software interface to multitasking
• Variational Iterative Methods for Nonsymmetric Systems of Linear Equations
• High Performance Preconditioning
• Krylov Subspace Methods on Supercomputers
• Preconditioned iterative algorithms for large sparse unsymmetric problems
• A Computation Model of Parallel Solution of Linear Equations
• On vectorizing the preconditioned generalized conjugate residual methods
• Numerical comparison of preconditionings for large sparse finite element problems

This page was built for publication: Iterative methods for solving sparse linear systems with a parallel preconditioner