The cost of eigenvalue computation on distributed-memory MIMD multiprocessors

DOI10.1016/0167-8191(94)00100-OMaRDI QIDQ673928zbMATH OpenWikidataFDO

Authors Elizabeth Jessup, Silvia Crivelli

Publication date 28 February 1997

Published in Parallel Computing (Search for Journal in Brave)

zbMATH Keywords

BisectionDistributed-memory multiprocessorEigenvalue computationIntel iPSC/2Intel Touchstone DeltaLinear algebraMultisectionPolysection

Mathematics Subject Classification ID

Mathematical problems of computer architecture (68M07) Computer system organization (68M99)

Recommendations

• Bisection is not Optimal on Vector Processors
• Parallel implementation of bisection for the calculation of eigenvalues of tridiagonal symmetric matrices
• A Parallel Inertia Method for Finding Eigenvalues on Vector and SIMD Architectures
• Finding eigenvalues and eigenvectors of unsymmetric matrices using a distributed-memory multiprocessor

Cited in

(2)

• Reduction to condensed form for the eigenvalue problem on distributed memory architectures
• Bisection is not Optimal on Vector Processors

This page was built for publication: The cost of eigenvalue computation on distributed-memory MIMD multiprocessors

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