A condensed representation of almost normal matrices
From MaRDI portal
Recommendations
Cites work
- A unification of unitary similarity transforms to compressed representations
- An implicit multishift \(QR\)-algorithm for Hermitian plus low rank matrices
- Efficient eigenvalue computation for quasiseparable Hermitian matrices under low rank perturbations
- Fast QR Eigenvalue Algorithms for Hessenberg Matrices Which Are Rank‐One Perturbations of Unitary Matrices
- Low-rank perturbations of normal and conjugate-normal matrices and their condensed forms under unitary similarities and congruences
- Multiple Recursion Conjugate Gradient Algorithms Part I: Sufficient Conditions
- Necessary and Sufficient Conditions for the Existence of a Conjugate Gradient Method
- Normal matrices
- Normal matrices: an update
- On a condensed form for normal matrices under finite sequences of elementary unitary similarities
- On normal matrices with normal principal submatrices
- On orthogonal reduction to Hessenberg form with small bandwidth
- On the closeness of eigenvalues and singular values for almost normal matrices
- On the variation of the spectrum of a normal matrix
- Quasi-normal matrices and products
- Spectra of Nearly Hermitian Matrices
- The Faber–Manteuffel Theorem for Linear Operators
- Transformations to rank structures by unitary similarity
- \textit{qd}-type methods for quasiseparable matrices
Cited in
(7)- On almost normal matrices
- On a Compression of Normal Matrix Polynomials
- Block tridiagonal reduction of perturbed normal and rank structured matrices
- On almost normal matrices
- Normal forms for orthogonal similarity classes of skew-symmetric matrices
- On compressions of normal matrices
- On reduction of \(k\)-almost normal and \(k\)-almost conjugate normal matrices to a block tridiagonal form
This page was built for publication: A condensed representation of almost normal matrices
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q389723)