A quasi-orthogonal iterative method for eigenvalue problems
Fuente:
arXiv
Enregistré dans:
| Auteurs principaux: | , |
|---|---|
| Format: | Preprint |
| Publié: |
2026
|
| Sujets: | |
| Accès en ligne: | |
| Tags: |
Ajouter un tag
Pas de tags, Soyez le premier à ajouter un tag!
|
| _version_ | 1866915717817827328 |
|---|---|
| author | Wang, Shengyue Zhou, Aihui |
| author_facet | Wang, Shengyue Zhou, Aihui |
| contents | For large-scale eigenvalue problems requiring many mutually orthogonal eigenvectors, traditional numerical methods suffer substantial computational and communication costs with limited parallel scalability, primarily due to explicit orthogonalization. To address these challenges, we propose a quasi-orthogonal iterative method that dispenses with explicit orthogonalization and orthogonal initial data. It inherently preserves quasi-orthogonality (the iterates asymptotically tend to be orthogonal) and enhances robustness against numerical perturbations. Rigorous analysis confirms its energy-decay property and convergence of energy, gradient, and iterate. Numerical experiments validate the theoretical results, demonstrate key advantages of strong robustness and high-precision numerical orthogonality preservation, and thereby position our iterative method as an efficient, stable alternative for large-scale eigenvalue computations. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2601_02108 |
| institution | arXiv |
| publishDate | 2026 |
| record_format | arxiv |
| spellingShingle | A quasi-orthogonal iterative method for eigenvalue problems Wang, Shengyue Zhou, Aihui Numerical Analysis For large-scale eigenvalue problems requiring many mutually orthogonal eigenvectors, traditional numerical methods suffer substantial computational and communication costs with limited parallel scalability, primarily due to explicit orthogonalization. To address these challenges, we propose a quasi-orthogonal iterative method that dispenses with explicit orthogonalization and orthogonal initial data. It inherently preserves quasi-orthogonality (the iterates asymptotically tend to be orthogonal) and enhances robustness against numerical perturbations. Rigorous analysis confirms its energy-decay property and convergence of energy, gradient, and iterate. Numerical experiments validate the theoretical results, demonstrate key advantages of strong robustness and high-precision numerical orthogonality preservation, and thereby position our iterative method as an efficient, stable alternative for large-scale eigenvalue computations. |
| title | A quasi-orthogonal iterative method for eigenvalue problems |
| topic | Numerical Analysis |
| url | https://arxiv.org/abs/2601.02108 |