Eigenvalue computation for unitary rank structured matrices

DOI10.1016/J.CAM.2007.01.006MaRDI QIDQ2469628zbMATH OpenOpenAlexFDO

Authors Steven Delvaux, Marc van Barel

Publication date 6 February 2008

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.2007.01.006

zbMATH Keywords

numerical experimentseigenvaluereductionHessenberg formunitary matrixrank structured matriximplicit QR-algorithmpull-through operation

Mathematics Subject Classification ID

Computational methods for sparse matrices (65F50) Numerical computation of eigenvalues and eigenvectors of matrices (65F15) Orthogonalization in numerical linear algebra (65F25)

Recommendations

• Unitary rank structured matrices
• Fast QR Eigenvalue Algorithms for Hessenberg Matrices Which Are Rank‐One Perturbations of Unitary Matrices
• Efficient Implementation of the Multishift $QR$ Algorithm for the Unitary Eigenvalue Problem
• The QR algorithm for unitary Hessenberg matrices
• A unitary Hessenberg \(QR\)-based algorithm via semiseparable matrices

Cites work

• scientific article; zbMATH DE number 1183880 (Why is no real title available?)
• scientific article; zbMATH DE number 17441 (Why is no real title available?)
• scientific article; zbMATH DE number 1049353 (Why is no real title available?)
• scientific article; zbMATH DE number 961607 (Why is no real title available?)
• A Givens-Weight Representation for Rank Structured Matrices
• A Hessenberg Reduction Algorithm for Rank Structured Matrices
• A Stable Divide and Conquer Algorithm for the Unitary Eigenproblem
• A divide and conquer method for unitary and orthogonal eigenproblems
• A parallel algorithm for discrete least squares rational approximation
• An Error Analysis of a Unitary Hessenberg QR Algorithm
• An implementation of a divide and conquer algorithm for the unitary eigen problem
• Bestimmung der Eigenwerte orthogonaler Matrizen
• Convergence of the shifted $QR$ algorithm for unitary Hessenberg matrices
• Convergence of the unitary $QR$ algorithm with a unimodular Wilkinson shift
• Discrete Least Squares Approximation by Trigonometric Polynomials
• Discrete linearized least-squares rational approximation on the unit circle
• Downdating of Szegö polynomials and data-fitting applications
• Efficient Implementation of the Multishift $QR$ Algorithm for the Unitary Eigenvalue Problem
• On a Sturm Sequence of Polynomials for Unitary Hessenberg Matrices
• On the Spectral Decomposition of Hermitian Matrices Modified by Low Rank Perturbations with Applications
• Orthogonal similarity transformation of a symmetric matrix into a diagonal-plus-semiseparable one with free choice of the diagonal
• Orthonormal polynomial vectors and least squares approximation for a discrete inner product
• Rank structures preserved by the QR-algorithm: the singular case
• Schur parameter pencils for the solution of the unitary eigenproblem
• Structures preserved by matrix inversion
• The QR algorithm for unitary Hessenberg matrices
• The transmission of shifts and shift blurring in the QR algorithm
• Unitary rank structured matrices
• Vector Orthogonal Polynomials and Least Squares Approximation

Cited in

(23)

• On a Sturm Sequence of Polynomials for Unitary Hessenberg Matrices
• A unification of unitary similarity transforms to compressed representations
• Unitary rank structured matrices
• Efficient reduction of compressed unitary plus low rank matrices to Hessenberg form
• Orthogonal Laurent polynomials on the unit circle and snake-shaped matrix factorizations
• scientific article; zbMATH DE number 5527834 (Why is no real title available?)
• scientific article; zbMATH DE number 94062 (Why is no real title available?)
• Compression of unitary rank-structured matrices to CMV-like shape with an application to polynomial rootfinding
• The restarted QR-algorithm for eigenvalue computation of structured matrices
• Trigonometric orthogonal systems and quadrature formulae
• A multiple shift \(QR\)-step for structured rank matrices
• Schur parameter pencils for the solution of the unitary eigenproblem
• A comparison between the complex symmetric based and classical computation of the singular value decomposition of normal matrices
• The computation of elementary unitary matrices
• A generalized unitary Hessenberg matrix
• On tridiagonal matrices unitarily equivalent to normal matrices
• An algorithm for computing the eigenvalues of block companion matrices
• The unitary completion and QR iterations for a class of structured matrices
• On the description and stability of orthogonal transformations of rank structured matrices
• The QR iteration method for Hermitian quasiseparable matrices of an arbitrary order
• Eigenvector computation for almost unitary Hessenberg matrices and inversion of Szegö-Vandermonde matrices via discrete transmission lines
• Structured eigenvalue problems for rational Gauss quadrature
• Transformations to rank structures by unitary similarity

Describes a project that uses

Uses Software

• UDC

This page was built for publication: Eigenvalue computation for unitary rank structured matrices

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