Iterative Refinement for a Subset of Eigenvectors of Symmetric Matrices via Matrix Multiplications
Fuente:
arXiv
Saved in:
| Main Authors: | , , , |
|---|---|
| Format: | Preprint |
| Published: |
2026
|
| Subjects: | |
| Online Access: | |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| _version_ | 1866914356420149248 |
|---|---|
| author | Terao, Takeshi Ozaki, Katsuhisa Imamura, Toshiyuki Ogita, Takeshi |
| author_facet | Terao, Takeshi Ozaki, Katsuhisa Imamura, Toshiyuki Ogita, Takeshi |
| contents | We develop an iterative refinement method that improves the accuracy of a user-chosen subset of $k$ eigenvectors ($k\ll n$) of an $n\times n$ real symmetric matrix. Using an orthogonal matrix represented in compact WY form, the method expresses the eigenvector error through a correction matrix that can be approximated efficiently from Rayleigh quotients and residuals. Unlike refinement methods for a single eigenpair or for a full eigenbasis, the proposed method refines only the selected $k$ eigenvectors using $\mathcal{O}(nk)$ additional storage, and its dominant work can be organized as matrix--matrix multiplications. Under an eigenvalue separation condition, the refinement converges linearly; we also provide a conservative sufficient condition. Practical variants of the separation condition (e.g., via shifting) enable targeting other extremal parts of the spectrum. For tightly clustered eigenvalues, we discuss limitations and show that preprocessing can restore convergence in a representative sparse example. Numerical experiments on dense test matrices and sparse matrices from the SuiteSparse Matrix Collection illustrate attainable accuracy and problem-dependent convergence. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2602_23778 |
| institution | arXiv |
| publishDate | 2026 |
| record_format | arxiv |
| spellingShingle | Iterative Refinement for a Subset of Eigenvectors of Symmetric Matrices via Matrix Multiplications Terao, Takeshi Ozaki, Katsuhisa Imamura, Toshiyuki Ogita, Takeshi Numerical Analysis 65F15, 65F35, 65F50 We develop an iterative refinement method that improves the accuracy of a user-chosen subset of $k$ eigenvectors ($k\ll n$) of an $n\times n$ real symmetric matrix. Using an orthogonal matrix represented in compact WY form, the method expresses the eigenvector error through a correction matrix that can be approximated efficiently from Rayleigh quotients and residuals. Unlike refinement methods for a single eigenpair or for a full eigenbasis, the proposed method refines only the selected $k$ eigenvectors using $\mathcal{O}(nk)$ additional storage, and its dominant work can be organized as matrix--matrix multiplications. Under an eigenvalue separation condition, the refinement converges linearly; we also provide a conservative sufficient condition. Practical variants of the separation condition (e.g., via shifting) enable targeting other extremal parts of the spectrum. For tightly clustered eigenvalues, we discuss limitations and show that preprocessing can restore convergence in a representative sparse example. Numerical experiments on dense test matrices and sparse matrices from the SuiteSparse Matrix Collection illustrate attainable accuracy and problem-dependent convergence. |
| title | Iterative Refinement for a Subset of Eigenvectors of Symmetric Matrices via Matrix Multiplications |
| topic | Numerical Analysis 65F15, 65F35, 65F50 |
| url | https://arxiv.org/abs/2602.23778 |