Reconstruction of tridiagonal matrices from spectral data

arXivmath/0508099MaRDI QIDQ6475871FDOQ6475871

Authors: Ricardo S. Leite, Nicolau C. Saldanha, Carlos Tomei 

Publication date: 4 August 2005

Abstract: Jacobi matrices are parametrized by their eigenvalues and norming constants (first coordinates of normalized eigenvectors): this coordinate system breaks down at reducible tridiagonal matrices. The set of real symmetric tridiagonal matrices with prescribed simple spectrum is a compact manifold, admitting an open covering by open dense sets ${calU}^p{i}_{L}ambda$ centered at diagonal matrices $Lambd{a}^{p}i$, where $pi$ spans the permutations. {it Bidiagonal coordinates} are a variant of norming constants which parametrize each open set ${calU}^p{i}_{L}ambda$ by the Euclidean space. The reconstruction of a Jacobi matrix from inverse data is usually performed by an algorithm introduced by de Boor and Golub. In this paper we present a reconstruction procedure from bidiagonal coordinates and show how to employ it as an alternative to the de Boor-Golub algorithm. The inverse bidiagonal algorithm rates well in terms of speed and accuracy.

Mathematics Subject Classification ID

Inverse problems in linear algebra (15A29) Numerical solutions to inverse eigenvalue problems (65F18)

This page was built for publication: Reconstruction of tridiagonal matrices from spectral data

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6475871)