Inverse eigenvalue problems for extended Hessenberg and extended tridiagonal matrices

DOI10.1016/j.cam.2014.03.015zbMath1294.65041OpenAlexW2108028694MaRDI QIDQ2253084

Thomas Mach, Raf Vandebril, Marc Van Barel

Publication date: 25 July 2014

Published in: Journal of Computational and Applied Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.cam.2014.03.015

zbMATH Keywords

algorithmeigenvectorinverse eigenvalue problemunitary similarity transformationrational Arnoldi methoddata sparse factorizationsextended Hessenberg matrixnon-unitary similarity transformationrational nonsymmetric Lanczos method

Mathematics Subject Classification ID

Computational methods for sparse matrices (65F50) Orthogonalization in numerical linear algebra (65F25) Numerical solutions to inverse eigenvalue problems (65F18)

Related Items (5)

An implicit filter for rational Krylov using core transformations ⋮ An extended Hamiltonian QR algorithm ⋮ Orthogonal rational functions on the unit circle with prescribed poles not on the unit circle ⋮ Biorthogonal rational Krylov subspace methods ⋮ Generation of orthogonal rational functions by procedures for structured matrices

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• The numerically stable reconstruction of Jacobi matrices from spectral data
• A new approach to the rational interpolation problem: The vector case
• Schur parameter pencils for the solution of the unitary eigenproblem
• Downdating of Szegö polynomials and data-fitting applications
• A parallel algorithm for discrete least squares rational approximation
• Discrete linearized least-squares rational approximation on the unit circle
• Rational approximation in linear systems and control
• On an inverse eigenvalue problem for unitary Hessenberg matrices
• Orthogonal rational functions and tridiagonal matrices
• Orthonormal polynomial vectors and least squares approximation for a discrete inner product
• Computing approximate extended Krylov subspaces without explicit inversion
• Chasing Bulges or Rotations? A Metamorphosis of the QR-Algorithm
• On numerical methods for discrete least-squares approximation by trigonometric polynomials
• Some Perspectives on the Eigenvalue Problem
• Necessary and Sufficient Conditions for the Existence of a Conjugate Gradient Method
• Updating and Downdating of Orthogonal Polynomials with Data Fitting Applications
• Discrete Least Squares Approximation by Trigonometric Polynomials
• On Optimal Short Recurrences for Generating Orthogonal Krylov Subspace Bases
• A fast algorithm for computing the smallest eigenvalue of a symmetric positive-definite Toeplitz matrix
• A survey of matrix inverse eigenvalue problems
• $O( n^2 )$ Reduction Algorithms for the Construction of a Band Matrix from Spectral Data
• Fast QR Decomposition of Vandermonde-Like Mmatrices and Polynomial Least Squares Approximation
• A unifying construction of orthonormal bases for system identification
• Vector Orthogonal Polynomials and Least Squares Approximation
• A Generalization of the Multishift QR Algorithm
• Fast Computation of the Zeros of a Polynomial via Factorization of the Companion Matrix
• Multiple Recurrences and the Associated Matrix Structures Stemming From Normal Matrices
• Orthogonal Rational Functions and Structured Matrices
• The Matrix Eigenvalue Problem

This page was built for publication: Inverse eigenvalue problems for extended Hessenberg and extended tridiagonal matrices