A multiple shift \(QR\)-step for structured rank matrices

DOI10.1016/j.cam.2008.11.017zbMath1179.65041OpenAlexW2029969454MaRDI QIDQ1044861

Nicola Mastronardi, Raf Vandebril, Marc Van Barel

Publication date: 15 December 2009

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

zbMATH Keywords

eigenvaluenumerical experimentssemiseparable matricesHessenberg formstructured rank matricesnonsymmetric matrices\(QR\)-algorithmimplicit \(QR\)-algorithmsmultishift

Mathematics Subject Classification ID

Numerical computation of eigenvalues and eigenvectors of matrices (65F15)

Related Items (2)

A Wilkinson-like multishift QR algorithm for symmetric eigenvalue problems and its global convergence ⋮ On the Description and Stability of Orthogonal Transformations of Rank Structured Matrices

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Rank structures preserved by the \(QR\)-algorithm: the singular case
• A parallel QR-factorization/solver of quasiseparable matrices
• On the fast reduction of a quasiseparable matrix to Hessenberg and tridiagonal forms
• On a new class of structured matrices
• Two fast algorithms for solving diagonal-plus-semiseparable linear systems.
• A divide-and-conquer algorithm for the eigendecomposition of symmetric block-diagonal plus semiseparable matrices
• On the shifted QR iteration applied to companion matrices
• Fast and stable QR eigenvalue algorithms for generalized companion matrices and secular equations
• Eigenvalue computation for unitary rank structured matrices
• Unitary rank structured matrices
• Eigenstructure of order-one-quasiseparable matrices. Three-term and two-term recurrence relations
• The QR iteration method for Hermitian quasiseparable matrices of an arbitrary order
• Divide and conquer algorithms for computing the eigendecomposition of symmetric diagonal-plus-semiseparable matrices
• An implicit \(Q\) theorem for Hessenberg-like matrices
• Structures preserved by the QR-algorithm
• Finite Boundary Value Problems Solved by Green's Matrix.
• Chasing Algorithms for the Eigenvalue Problem
• A Hessenberg Reduction Algorithm for Rank Structured Matrices
• A Givens-Weight Representation for Rank Structured Matrices
• An implicit QR algorithm for symmetric semiseparable matrices
• A note on the representation and definition of semiseparable matrices
• Fast QR Eigenvalue Algorithms for Hessenberg Matrices Which Are Rank‐One Perturbations of Unitary Matrices
• An Orthogonal Similarity Reduction of a Matrix into Semiseparable Form

This page was built for publication: A multiple shift \(QR\)-step for structured rank matrices