Abstract
A fast method for enclosing all eigenpairs in symmetric positive definite generalized eigenvalue problems is proposed. Firstly theorems on verifying all eigenvalues are presented. Next a theorem on verifying all eigenvectors is presented. The proposed method is developed based on these theorems. Numerical results are presented showing the efficiency of the proposed method. As an application of the proposed method, an efficient method of enclosing all eigenpairs in the quadratic eigenvalue problem is also sketched.
| Original language | English |
|---|---|
| Pages (from-to) | 24-45 |
| Number of pages | 22 |
| Journal | Reliable Computing |
| Volume | 14 |
| Publication status | Published - 2010 Jun 1 |
Keywords
- Eigenpairs
- Generalized eigenvalue problem
- Numerical verification
ASJC Scopus subject areas
- Software
- Computational Mathematics
- Applied Mathematics
Fingerprint Dive into the research topics of 'Fast verification for all eigenpairs in symmetric positive definite generalized eigenvalue problems'. Together they form a unique fingerprint.
Cite this
Miyajima, S., Ogita, T., Rump, S. M., & Oishi, S. (2010). Fast verification for all eigenpairs in symmetric positive definite generalized eigenvalue problems. Reliable Computing, 14, 24-45.