The numerically stable reconstruction of Jacobi matrices from spectral data

DOI10.1007/BF01405565zbMath0556.65027MaRDI QIDQ761014

William B. Gragg, William J. Harrod

Publication date: 1984

Published in: Numerische Mathematik (Search for Journal in Brave)

Full work available at URL: https://eudml.org/doc/132939

zbMATH Keywords

Jacobi matricesnumerical stabilityinverse eigenvalue problemreconstructionLanczos-algorithmRutishauser-Kahan-Pal-Walker algorithm

Mathematics Subject Classification ID

Numerical computation of eigenvalues and eigenvectors of matrices (65F15) Eigenvalues, singular values, and eigenvectors (15A18)

Related Items

An approximate inverse matrix technique for arrowhead matrices, Discrete linearized least-squares rational approximation on the unit circle, Inverse mode problems for the finite element model of a vibrating rod, Construction of polynomials that are orthogonal with respect to a discrete bilinear form, Gauss quadrature rules for a generalized Hermite weight function, Explicit construction of hyperdominant symmetric matrices with assigned spectrum, On sensitivity of Gauss-Christoffel quadrature, When does the Lanczos algorithm compute exactly?, Construction of acyclic matrices from spectral data, Numerical reconstruction of spring-mass system from two nondisjoint spectra, Minkowski's question mark measure, On generating orthogonal polynomials for discrete measures, Data-dependent orthogonal polynomials on generalized circles: a unified approach applied to \(\delta \)-domain identification, Invariant subspaces for tightly clustered eigenvalues of tridiagonals, \(m\)-functions and inverse spectral analysis for finite and semi-infinite Jacobi matrices, A Lanczos method for approximating composite functions, A finite-step construction of totally nonnegative matrices with specified eigenvalues, Explicit approximate inverse preconditioning techniques, Orthogonal polynomials on a class of planar algebraic curves, The behavior of the Gauss-Radau upper bound of the error norm in CG, A Stieltjes Algorithm for Generating Multivariate Orthogonal Polynomials, On generating Sobolev orthogonal polynomials, Recursive approximation of the dominant eigenspace of an indefinite matrix, Direct and inverse computation of Jacobi matrices of infinite iterated function systems, Calculation of Gauss-Kronrod quadrature rules, CT-scans of fractal and non fractal measures in the plane coded by affine homogeneous iterated function systems, Accurate recovery of recursion coefficients from Gaussian quadrature formulas, Optimally conditioned instrumental variable approach for frequency-domain system identification, Structured eigenvalue problems for rational Gauss quadrature, Calculation of Radau-Kronrod and Lobatto-Kronrod quadrature formulas, Orthogonal polynomials of equilibrium measures supported on Cantor sets, A continued fraction approximation of the modified Bessel function \(I_ 1(t)\), A new parallel chasing algorithm for transforming arrowhead matrices to tridiagonal form, Inverse eigenvalue problems associated with spring-mass systems, A continued fraction approximation of the modified Bessel function \(I_ 1(t)\), Downdating of Szegö polynomials and data-fitting applications, Explicit solution of the inverse eigenvalue problem of real symmetric matrices and its application to electrical network synthesis, Is the recurrence relation for orthogonal polynomials always stable?, A parallel algorithm for discrete least squares rational approximation, Inverse eigenvalue problems for extended Hessenberg and extended tridiagonal matrices, Computation of Gauss-type quadrature formulas, An inverse eigenvalue problem for pseudo-Jacobi matrices, Orthogonal polynomials (in Matlab), The asymptotics of Wilkinson's shift: Loss of cubic convergence, A note on the construction of a positive oscillatory matrix with a prescribed spectrum, Orthonormal rational function vectors, Structural and computational properties of possibly singular semiseparable matrices, An inverse eigenvalue problem for the finite element model of a vibrating rod, Computation of quadrature rules for integration with respect to refinable functions on assigned nodes, On an inverse eigenvalue problem for unitary Hessenberg matrices, On the computation of recurrence coefficients for univariate orthogonal polynomials, Low rank update of singular values, Finite sequences of orthogonal polynomials connected by a Jacobi matrix, Generation of orthogonal rational functions by procedures for structured matrices, Fast and stable eigendecomposition of symmetric banded plus semi-separable matrices, Sensitivity of the Lanczos recurrence to Gaussian quadrature data: how malignant can small weights be?, Solving the inverse eigenvalue problem via the eigenvector matrix

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• A Divide and Conquer method for the symmetric tridiagonal eigenproblem
• Construction of band matrices from spectral data
• The economical storage of plane rotations
• Rank-one modification of the symmetric eigenproblem
• The numerically stable reconstruction of a Jacobi matrix from spectral data
• A Numerical Method for the Inverse Sturm–Liouville Problem
• A Modified Method for Reconstructing Periodic Jacobi Matrices
• The Construction of Jacobi and Periodic Jacobi Matrices With Prescribed Spectra
• On Generating Orthogonal Polynomials
• Error and Perturbation Bounds for Subspaces Associated with Certain Eigenvalue Problems
• Reorthogonalization and Stable Algorithms for Updating the Gram-Schmidt QR Factorization
• On Extrapolation Algorithms for Ordinary Initial Value Problems
• Calculation of Gauss Quadrature Rules
• Construction of Gauss-Christoffel Quadrature Formulas
• The Rotation of Eigenvectors by a Perturbation. III
• Practical use of the symmetric Lanczos process with re-orthogonalization
• Some Modified Matrix Eigenvalue Problems