Conjugate gradient and Lanczos methods for sparse matrices on distributed memory multiprocessors

DOI10.1006/JPDC.1997.1364zbMATH Open0894.65012OpenAlexW2081465995MaRDI QIDQ1373792FDOQ1373792

Authors: A. Basermann 

Publication date: 7 September 1998

Published in: Journal of Parallel and Distributed Computing (Search for Journal in Brave)

Full work available at URL: https://semanticscholar.org/paper/6eeed8d72d2283f397ffddbc2069166115df0d6c

Recommendations

• Publication:4860193
• scientific article; zbMATH DE number 125197
• scientific article; zbMATH DE number 926693

zbMATH Keywords

algorithmsparallel computationconjugate gradient methodLanczos methodeigenproblemsparallel distributed memory systems

Mathematics Subject Classification ID

Computational methods for sparse matrices (65F50) Parallel numerical computation (65Y05) Numerical computation of eigenvalues and eigenvectors of matrices (65F15) Iterative numerical methods for linear systems (65F10)

Cited In (9)

• A parallel approach for determining confidence intervals of variable statistics in large and sparse linear equations with RHS ranges
• Iterative algorithms for solution of large sparse systems of linear equations on hypercubes
• Résolution de grands systèmes linéaires creux par méthodes itératives parallèles
• Multiple search direction conjugate gradient method II: theory and numerical experiments
• Title not available (Why is that?)
• Multiple search direction conjugate gradient method I: methods and their propositions
• Algorithmic optimizations of a conjugate gradient solver on shared memory architectures
• Solving systems of linear equations arising in the computation of logarithms in a finite prime field
• Title not available (Why is that?)

This page was built for publication: Conjugate gradient and Lanczos methods for sparse matrices on distributed memory multiprocessors

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1373792)