A sparse nonsymmetric eigensolver for distributed memory architectures
DOI10.1080/17445760701640324zbMath1146.68483OpenAlexW2001296140MaRDI QIDQ3499023
Mario Rosario Guarracino, P. Zanetti, Francesca Perla
Publication date: 19 May 2008
Published in: International Journal of Parallel, Emergent and Distributed Systems (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1080/17445760701640324
matrix-matrix multiplicationdistributed memory architecturesparallel block Lanczos algorithmnonsymmetric eigensolver
Computational methods for sparse matrices (65F50) Symbolic computation and algebraic computation (68W30) Numerical computation of eigenvalues and eigenvectors of matrices (65F15) Parallel algorithms in computer science (68W10)
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Qualitative decomposition of the eigenvalue problem in a dynamic system
- A new look at the Lanczos algorithm for solving symmetric systems of linear equations
- ScaLAPACK: A portable linear algebra library for distributed memory computers -- design issues and performance
- A block Arnoldi-Chebyshev method for computing the leading eigenpairs of large sparse unsymmetric matrices
- Sparse direct methods for model simulation
- Large-Scale Normal Coordinate Analysis for Molecular Structures
- A set of level 3 basic linear algebra subprograms
- ARPACK Users' Guide
- Templates for the Solution of Algebraic Eigenvalue Problems
- Lanczos Algorithms for Large Symmetric Eigenvalue Computations
- SuperLU_DIST
- Linear stability of flow in a differentially heated cavity via large‐scale eigenvalue calculations
This page was built for publication: A sparse nonsymmetric eigensolver for distributed memory architectures
