Parallel evaluation of leftmost eigenpairs of large unsymmetric matrices
DOI10.1002/NUM.1690100409zbMATH Open0807.65031OpenAlexW2032672431MaRDI QIDQ4308482FDOQ4308482
Authors: Giorgio Pini
Publication date: 28 February 1995
Published in: Numerical Methods for Partial Differential Equations (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1002/num.1690100409
Recommendations
- LEFTMOST EIGENVALUE OF REAL AND COMPLEX SPARSE MATRICES ON PARALLEL COMPUTER USING APPROXIMATE INVERSE PRECONDITIONING
- scientific article; zbMATH DE number 1817673
- A class of Lanczos-like algorithms implemented on parallel computers
- scientific article; zbMATH DE number 434519
- scientific article; zbMATH DE number 1507107
- A parallel Davidson-type algorithm for several eigenvalues
- Some algorithms for the solution of the symmetric eigenvalue problem on a multiprocessor electronic computer
- Implementing Lanczos-like algorithms on hypercube architectures
- scientific article; zbMATH DE number 3917552
parallel algorithmnumerical experimentsparallel computationArnoldi methodcomparison of methodseigenpairseigenvalues of smallest modulusLanczos-type bi-conjugate gradient methodlarge sparse unsymmetric systemreverse simultaneous iteration scheme
Parallel numerical computation (65Y05) Numerical computation of eigenvalues and eigenvectors of matrices (65F15)
Cites Work
Cited In (3)
Uses Software
This page was built for publication: Parallel evaluation of leftmost eigenpairs of large unsymmetric matrices
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4308482)