A unification of unitary similarity transforms to compressed representations

DOI10.1007/S00211-011-0400-5MaRDI QIDQ652255zbMATH OpenOpenAlexFDO

Authors Raf Vandebril, Gianna M. Del Corso

Publication date 14 December 2011

Published in Numerische Mathematik (Search for Journal in Brave)

Full work available at URL http://eprints.adm.unipi.it/2258/1/TR%2D10%2D14.pdf.gz

zbMATH Keywords

eigenvaluenumerical experimentcompanion matrixHessenberg formrational Krylov method\(QR\)-algorithmscompressed representationHessenberg-like formQR-factorizationrational Ritz-valuesstructured rank matricesunitary similarity transform

Mathematics Subject Classification ID

Numerical computation of eigenvalues and eigenvectors of matrices (65F15) Iterative numerical methods for linear systems (65F10) Canonical forms, reductions, classification (15A21)

Recommendations

• Efficient reduction of compressed unitary plus low rank matrices to Hessenberg form
• A Hessenberg Reduction Algorithm for Rank Structured Matrices
• Fast Hessenberg reduction of some rank structured matrices
• A fast QR algorithm for companion matrices
• Transformations to rank structures by unitary similarity

Cites work

• scientific article; zbMATH DE number 5527834 (Why is no real title available?)
• scientific article; zbMATH DE number 192975 (Why is no real title available?)
• scientific article; zbMATH DE number 1049347 (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 Lanczos-like reduction of symmetric structured matrices to semiseparable form
• A QR-Based Solver for Rank Structured Matrices
• A fast implicit QR eigenvalue algorithm for companion matrices
• A numerical solution of the constrained weighted energy problem
• An Orthogonal Similarity Reduction of a Matrix into Semiseparable Form
• Convergence Analysis of Krylov Subspace Iterations with Methods from Potential Theory
• Eigenvalue computation for unitary rank structured matrices
• Fast and stable reduction of diagonal plus semi-separable matrices to tridiagonal and bidiagonal form
• Implicit double shift \(QR\)-algorithm for companion matrices
• Linear algebra, rational approximation and orthogonal polynomials
• Matrix computations and semiseparable matrices. Vol. 1: Linear systems.
• On computing givens rotations reliably and efficiently
• On the Convergence of Rational Ritz Values
• On the convergence properties of the orthogonal similarity transformations to tridiagonal and semiseparable (plus diagonal) form
• On the fast reduction of a quasiseparable matrix to Hessenberg and tridiagonal forms
• Orthogonal Rational Functions and Structured Matrices
• Orthogonal similarity transformation of a symmetric matrix into a diagonal-plus-semiseparable one with free choice of the diagonal
• Rational Krylov matrices and QR steps on Hermitian diagonal‐plus‐semiseparable matrices
• Rational Krylov sequence methods for eigenvalue computation
• Structural properties of matrix unitary reduction to semiseparable form
• The Matrix Eigenvalue Problem
• Transformations to rank structures by unitary similarity
• Which eigenvalues are found by the Lanczos method?

Cited in

(7)

• Transforming a hierarchical into a unitary-weight representation
• A generalized unitary Hessenberg matrix
• scientific article; zbMATH DE number 5939034 (Why is no real title available?)
• Similarity-based unification: A multi-adjoint approach
• Block tridiagonal reduction of perturbed normal and rank structured matrices
• A condensed representation of almost normal matrices
• Transformations to rank structures by unitary similarity

This page was built for publication: A unification of unitary similarity transforms to compressed representations

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