Test matrices with specified eigenpairs for the symmetric positive definite generalized eigenvalue problem

Abstract The generalized eigenvalue problem is a significant topic with numerous applications in scientific and technological computing. Therefore, verifying the reliability of the results produced by numerical solvers is crucial. This article presents a method for generating test problems for generalized eigenvalue problems such that the exact eigenvalues and eigenvectors are known in advance, thereby enabling precise error monitoring. The proposed method generates a matrix pair that can be represented exactly in floating-point numbers. Ozaki and Ogita previously proposed a method for generating test problems for standard eigenvalue problems. We extend their approach to generalized eigenvalue problems, proposing a method that allows users to specify target eigenvalues and a condition number of the matrix defining the generalized inner product in advance. Furthermore, iterative refinement methods to approach the expected eigenvalues as closely as possible for the user are also discussed. Numerical examples are presented to evaluate the accuracy of the computed results and to assess potential overestimation in the error bounds produced by a method for given approximate eigenvalues.

Authors

Institutions

Publication Details

Journal
Special Matrices
Published
2025-01-01
DOI
https://doi.org/10.1515/spma-2025-0038
Primary Topic
Matrix Theory and Algorithms
Type
article
Field-Weighted Citation Impact
0.00

Funders

Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

Test matrices with specified eigenpairs for the symmetric positive definite generalized eigenvalue problem

Takeshi Terao, Katsuhisa Ozaki
Special Matrices
Matrix Theory and Algorithms
article

Test matrices with specified eigenpairs for the symmetric positive definite generalized eigenvalue problem

Takeshi Terao, Katsuhisa Ozaki
article en

Abstract

Abstract The generalized eigenvalue problem is a significant topic with numerous applications in scientific and technological computing. Therefore, verifying the reliability of the results produced by numerical solvers is crucial. This article presents a method for generating test problems for generalized eigenvalue problems such that the exact eigenvalues and eigenvectors are known in advance, thereby enabling precise error monitoring. The proposed method generates a matrix pair that can be represented exactly in floating-point numbers. Ozaki and Ogita previously proposed a method for generating test problems for standard eigenvalue problems. We extend their approach to generalized eigenvalue problems, proposing a method that allows users to specify target eigenvalues and a condition number of the matrix defining the generalized inner product in advance. Furthermore, iterative refinement methods to approach the expected eigenvalues as closely as possible for the user are also discussed. Numerical examples are presented to evaluate the accuracy of the computed results and to assess potential overestimation in the error bounds produced by a method for given approximate eigenvalues.

Special MatricesVol. 13(1)
Kyushu University (JP), Shibaura Institute of Technology (JP)
Japan Society for the Promotion of Science
Openalex Percentile: Top 81%
Matrix Theory and Algorithms
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.