A Hessenberg Reduction Algorithm for Rank Structured Matrices

DOI10.1137/060658953zbMath1198.65068OpenAlexW2087621153MaRDI QIDQ3516135

Steven Delvaux, Marc Van Barel

Publication date: 1 August 2008

Published in: SIAM Journal on Matrix Analysis and Applications (Search for Journal in Brave)

Full work available at URL: https://semanticscholar.org/paper/b80817c3d656550e719136bc70bb17e8c4631b8b

zbMATH Keywords

complexityalgorithmeigenvaluenumerical experimentsHessenberg reductionrank structured matrix(zero-creating) Givens-weight representationstructure inheritance

Mathematics Subject Classification ID

Computational methods for sparse matrices (65F50) Numerical computation of eigenvalues and eigenvectors of matrices (65F15) Complexity and performance of numerical algorithms (65Y20)

Related Items

On the fast reduction of a quasiseparable matrix to Hessenberg and tridiagonal forms ⋮ An algorithm for computing the eigenvalues of block companion matrices ⋮ The Ehrlich-Aberth method for palindromic matrix polynomials represented in the Dickson basis ⋮ Efficient Reduction of Compressed Unitary Plus Low Rank Matrices to Hessenberg Form ⋮ Eigenvalue computation for unitary rank structured matrices ⋮ Unitary rank structured matrices ⋮ On the Description and Stability of Orthogonal Transformations of Rank Structured Matrices ⋮ Structures preserved by generalized inversion and Schur complementation ⋮ A multiple shift \(QR\)-step for structured rank matrices ⋮ Fast Hessenberg Reduction of Some Rank Structured Matrices

This page was built for publication: A Hessenberg Reduction Algorithm for Rank Structured Matrices