A new algorithm on the inverse eigenvalue problem for double dimensional Jacobi matrices (Q445837)
From MaRDI portal
| This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: A new algorithm on the inverse eigenvalue problem for double dimensional Jacobi matrices |
scientific article; zbMATH DE number 6072629
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A new algorithm on the inverse eigenvalue problem for double dimensional Jacobi matrices |
scientific article; zbMATH DE number 6072629 |
Statements
A new algorithm on the inverse eigenvalue problem for double dimensional Jacobi matrices (English)
0 references
27 August 2012
0 references
Some properties of eigenvalues and eigenvectors of Jacobi matrices are studied. A new algorithm for reconstructing a \(2n\)-th order Jacobi matrix \(J_{2n}\) with a given \(n\)th order leading principal submatrix \(J_{n}\) and with all eigenvalues of \(J_{2n}\) is proposed. This algorithm needs to compute the eigenvalues of the \(n\)th order tailing principal submatrix \(J_{n+1,2n}\) and the first components of the unit eigenvectors of \(J_{n+1,2n}\). The method avoids computing the coefficients of the characteristic polynomial for getting the eigenvalues of \(J_{n+1,2n}\). Some numerical results are presented.
0 references
symmetric tridiagonal matrix
0 references
Jacobi matrix
0 references
eigenvalue problem
0 references
inverse eigenvalue problem
0 references
double dimension problem
0 references
eigenvectors
0 references
algorithm
0 references
numerical results
0 references
0.9753494
0 references
0 references
0.9370196
0 references
0.9142885
0 references
0.9142052
0 references