Experiments with Krylov subspace methods on a massively parallel computer

DOI10.21136/am.1993.104566zbMath0810.65030OpenAlexW135919330MaRDI QIDQ1321613

Wilhelm Niethammer, Martin Hanke, Marlis Hochbruck

Publication date: 9 April 1995

Published in: Applications of Mathematics (Search for Journal in Brave)

Full work available at URL: https://eudml.org/doc/15764

zbMATH Keywords

preconditioningparallel computationsuccessive overrelaxationsemiiterative methodsBiCGStabKrylov subspace iterative methodsconjugate gradient type methodsred-black orderingGMRES-Richardson method

Mathematics Subject Classification ID

Iterative numerical methods for linear systems (65F10) Parallel numerical computation (65Y05)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• A study of semiiterative methods for nonsymmetric systems of linear equations
• An optimum iterative method for solving any linear system with a square matrix
• On semiiterative methods generated by Faber polynomials
• The analysis of k-step iterative methods for linear systems from summability theory
• QMR: A quasi-minimal residual method for non-Hermitian linear systems
• The Tchebychev iteration for nonsymmetric linear systems
• A hybrid Arnoldi-Faber iterative method for nonsymmetric systems of linear equations
• Necessary and Sufficient Conditions for the Existence of a Conjugate Gradient Method
• GMRES: A Generalized Minimal Residual Algorithm for Solving Nonsymmetric Linear Systems
• Bi-CGSTAB: A Fast and Smoothly Converging Variant of Bi-CG for the Solution of Nonsymmetric Linear Systems
• A Hybrid GMRES Algorithm for Nonsymmetric Linear Systems
• THE PRECONDITIONED CONJUGATE GRADIENT METHOD ON THE CONNECTION MACHINE
• An Implementation of the Look-Ahead Lanczos Algorithm for Non-Hermitian Matrices
• Methods of conjugate gradients for solving linear systems

This page was built for publication: Experiments with Krylov subspace methods on a massively parallel computer