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

DOI10.1006/jpdc.1997.1364zbMath0894.65012OpenAlexW2081465995MaRDI QIDQ1373792

Achim 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

zbMATH Keywords

algorithmsLanczos methodparallel computationconjugate gradient methodeigenproblemsparallel distributed memory systems

Mathematics Subject Classification ID

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

Related Items

Multiple search direction conjugate gradient method I: methods and their propositions ⋮ Multiple search direction conjugate gradient method II: theory and numerical experiments ⋮ Решение систем линейных уравнений при вычислении логарифмов в конечном простом поле ⋮ A parallel approach for determining confidence intervals of variable statistics in large and sparse linear equations with RHS ranges