Implementing Lanczos-like algorithms on hypercube architectures

DOI10.1016/0010-4655(89)90165-3MaRDI QIDQ1330644zbMATH OpenOpenAlexFDO

Authors David S. Scott

Publication date 30 October 1994

Published in Computer Physics Communications (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/0010-4655(89)90165-3

zbMATH Keywords

parallel computationimplementationLanczos algorithmlarge symmetric eigenvalue problemsIntel hypercube distributed-memory message- passing parallel computer system

Mathematics Subject Classification ID

Parallel numerical computation (65Y05) Numerical computation of eigenvalues and eigenvectors of matrices (65F15)

Cites work

• A new look at the Lanczos algorithm for solving symmetric systems of linear equations
• Estimates for Some Computational Techniques in Linear Algebra
• The Lanczos Algorithm with Selective Orthogonalization
• The use of a refined error bound when updating eigenvalues of tridiagonals
• Towards a black box Lanczos program

Cited in

(3)

• Parallel evaluation of leftmost eigenpairs of large unsymmetric matrices
• Analytical Lanczos method: Quantum eigenstates of anharmonic oscillators in one or more dimensions
• Nearly logarithmic-time parallel algorithms for the class of \(\pm 2^ b\) ASCEND computations on a SIMD hypercube

Describes a project that uses

Uses Software

• YSMP

This page was built for publication: Implementing Lanczos-like algorithms on hypercube architectures

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