A Hessenberg Reduction Algorithm for Rank Structured Matrices

DOI10.1137/060658953MaRDI QIDQ3516135zbMATH OpenOpenAlexFDO

Authors 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

algorithmcomplexitynumerical experimentseigenvalueHessenberg reductionrank structured matrix(zero-creating) Givens-weight representationstructure inheritance

Mathematics Subject Classification ID

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

Recommendations

• Fast Hessenberg reduction of some rank structured matrices
• Algorithms for Hessenberg-triangular reduction of Fiedler linearization of matrix polynomials
• Quasiseparable Hessenberg reduction of real diagonal plus low rank matrices and applications
• Efficient reduction of compressed unitary plus low rank matrices to Hessenberg form
• A Householder-Based Algorithm for Hessenberg-Triangular Reduction
• Computing Most Nearly Rank-Reducing Structured Matrix Perturbations
• On the stability of some hierarchical rank structured matrix algorithms
• On the complexity of some hierarchical structured matrix algorithms
• A Rank–One Reduction Formula and Its Applications to Matrix Factorizations
• scientific article; zbMATH DE number 2089175

Cited in

(15)

• A unification of unitary similarity transforms to compressed representations
• Unitary rank structured matrices
• Eigenvalue computation for unitary rank structured matrices
• Efficient reduction of compressed unitary plus low rank matrices to Hessenberg form
• Quasiseparable Hessenberg reduction of real diagonal plus low rank matrices and applications
• Implementing Hager's exchange methods for matrix profile reduction
• Fast Hessenberg reduction of some rank structured matrices
• The Ehrlich-Aberth method for palindromic matrix polynomials represented in the Dickson basis
• On the fast reduction of a quasiseparable matrix to Hessenberg and tridiagonal forms
• An input/output efficient algorithm for Hessenberg reduction
• A multiple shift \(QR\)-step for structured rank matrices
• A Givens-Weight Representation for Rank Structured Matrices
• An algorithm for computing the eigenvalues of block companion matrices
• On the description and stability of orthogonal transformations of rank structured matrices
• Structures preserved by generalized inversion and Schur complementation

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

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