ACM Home Page
Please provide us with feedback. Feedback
Algorithm 827: irbleigs: A MATLAB program for computing a few eigenpairs of a large sparse Hermitian matrix
Full text PdfPdf (120 KB)
Source ACM Transactions on Mathematical Software (TOMS) archive
Volume 29 ,  Issue 3  (September 2003) table of contents
Pages: 337 - 348  
Year of Publication: 2003
ISSN:0098-3500
Authors
J. Baglama  University of Rhode Island, Kingston, RI
D. Calvetti  Case Western Reserve University, Cleveland, OH
L. Reichel  Kent State University, Kent, OH
Publisher
ACM  New York, NY, USA
Bibliometrics
Downloads (6 Weeks): 7,   Downloads (12 Months): 90,   Citation Count: 2
Additional Information:

appendices and supplements   abstract   references   cited by   index terms   collaborative colleagues   peer to peer  

Tools and Actions: Review this Article  
Save this Article to a Binder    Display Formats: BibTex  EndNote ACM Ref   
DOI Bookmark: Use this link to bookmark this Article: http://doi.acm.org/10.1145/838250.838257
What is a DOI?

APPENDICES and SUPPLEMENTS
gZipgZip (16 KB)
Software for "irbleigs: A MATLAB program for computing a few eigenpairs of a large sparse Hermitian matrix"


ABSTRACT

irbleigs is a MATLAB program for computing a few eigenvalues and associated eigenvectors of a sparse Hermitian matrix of large order n. The matrix is accessed only through the evaluation of matrix-vector products. Working space of only a few n-vectors is required. The program implements a restarted block-Lanczos method. Judicious choices of acceleration polynomials make it possible to compute approximations of a few of the largest eigenvalues, a few of the smallest eigenvalues, or a few eigenvalues in the vicinity of a user-specified point on the real axis. irbleigs also can be applied to certain large generalized eigenproblems as well as to the computation of a few nearby singular values and associated right and left singular vectors of a large general matrix.


REFERENCES

Note: OCR errors may be found in this Reference List extracted from the full text article. ACM has opted to expose the complete List rather than only correct and linked references.

 
1
Baglama, J. 2000. Dealing with linear dependence during the iterations of the restarted block Lanczos methods. Numer. Algorithms 25, 23--36.
 
2
Baglama, J., Calvetti, D., and Reichel, L. 1996. Iterative methods for the computation of a few eigenvalues of a large symmetric matrix. BIT 36, 400--421.
 
3
 
4
 
5
Calvetti, D., Reichel, L., and Sorensen, D. C. 1994. An implicitly restarted Lanczos method for large symmetric eigenvalue problems. Elec. Trans. Numer. Anal. 2, 1--21.
 
6
Lehoucq, R. B., Sorensen, D. C., and Yang, C. 1998. ARPACK Users' Guide: Solution of Large-Scale Eigenvalue Problems with Implicitly Restarted Arnoldi Methods. SIAM, Philadelphia, Pa. Code available at web site http://www.caam.rice.edu/software/ARPACK.
 
7
MathWorks. 1998. MATLAB Application Program Interface Guide, Version 5.
 
8


Collaborative Colleagues:
J. Baglama: colleagues
D. Calvetti: colleagues
L. Reichel: colleagues

Peer to Peer - Readers of this Article have also read: