Fast Generation of Real-Symmetric Matrices and their Exact Eigenpairs
We propose a method to rapidly generate matrices for real-symmetric eigenproblems. The proposed method produces a reproducible matrix with explicit eigenpairs, where the distribution of the eigenvalues can be controlled by a user. All elements of the generated matrix are rigorous floating-point numbers and can be represented in simple expressions involving the exact eigenvalues. The exact eigenpairs of the generated matrix are known in advance; thus, the proposed method contributes to the validation of errors in approximate eigenpairs. Several constraints on the matrix generated by the proposed method, were produced theoretically.
Authors
- Takeshi Terao (ORCID: https://orcid.org/0000-0003-4181-1232)
- Katsuhisa Ozaki (ORCID: https://orcid.org/0000-0003-0431-6232)
- Yuki Uchino (ORCID: https://orcid.org/0000-0002-5906-6624)
- Toshiyuki Imamura (ORCID: https://orcid.org/0000-0003-1601-9710)
Institutions
- Kyushu University (JP)
- Shibaura Institute of Technology (JP)
- Oldenburger Institut für Informatik (DE)
- RIKEN Center for Computational Science (JP)
Publication Details
- Journal
- Journal of Advanced Simulation in Science and Engineering
- Published
- 2025-01-01
- DOI
- https://doi.org/10.15748/jasse.12.44
- Primary Topic
- Matrix Theory and Algorithms
- Type
- article
- Field-Weighted Citation Impact
- 0.00
Funders
- Japan Society for the Promotion of Science