Corrigendum: Computing selected eigenvalues of sparse unsymmetric matrices using subspace iteration

DOI10.1145/212066.215254MaRDI QIDQ4371604zbMATH OpenOpenAlexWikidataFDO

Authors J. A. Scott, Iain S. Duff

Publication date 26 January 1998

Published in ACM Transactions on Mathematical Software (Search for Journal in Brave)

Full work available at URL http://www.acm.org/pubs/contents/journals/toms/1995-21/

zbMATH Keywords

correctioneigenvaluessubspace iteration

Mathematics Subject Classification ID

Numerical computation of eigenvalues and eigenvectors of matrices (65F15) Computational methods for sparse matrices (65F50)

Recommendations

• Computing selected eigenvalues of sparse unsymmetric matrices using subspace iteration
• A refined subspace iteration algorithm for large sparse eigenproblems
• Approximating matrix eigenvalues by subspace iteration with repeated random sparsification
• scientific article; zbMATH DE number 3978276
• Computing eigenvalue bounds for iterative subspace matrix methods
• A note on eigenvalue distribution of constraint-preconditioned symmetric saddle point matrices
• Subspace iterative methods for eigenvalue problems
• Corrigendum
• An Arnoldi code for computing selected eigenvalues of sparse, real, unsymmetric matrices
• scientific article; zbMATH DE number 2069268

Describes a project that uses

Uses Software

• BLAS
• SRRIT

This page was built for publication: Corrigendum: Computing selected eigenvalues of sparse unsymmetric matrices using subspace iteration

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