On a condensed form for normal matrices under finite sequences of elementary unitary similarities
From MaRDI portal
Publication:677902
DOI10.1016/S0024-3795(96)00526-5zbMath0870.65034OpenAlexW2171255712MaRDI QIDQ677902
Khakim D. Ikramov, Ludwig Elsner
Publication date: 17 September 1997
Published in: Linear Algebra and its Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/s0024-3795(96)00526-5
Lanczos methodnormal matriceseliminationHouseholder transformationsblock tridiagonal matrixcondensed formHouseholder reflections
Lua error in Module:PublicationMSCList at line 37: attempt to index local 'msc_result' (a nil value).
Related Items (19)
Orthogonal polyanalytic polynomials and normal matrices ⋮ Unnamed Item ⋮ The CMV matrix and the generalized Lanczos process ⋮ The minimal and characteristic polyanalytic polynomials of a normal matrix ⋮ SYMMLQ-like procedure for \(Ax=b\) where \(A\) is a special normal matrix ⋮ A unitary similarity transform of a normal matrix to complex symmetric form ⋮ A condensed representation of almost normal matrices ⋮ A minimal residual method for linear polynomials in unitary matrices ⋮ Block tridiagonal reduction of perturbed normal and rank structured matrices ⋮ Unnamed Item ⋮ On matrices that admit unitary reduction to band form ⋮ Improved bounds for the recursion width in congruent type methods for solving systems of linear equations ⋮ On condensed forms for partially commuting matrices ⋮ Reducing complex matrices to condensed forms by unitary congruence transformations ⋮ On a condensed form for normal matrices under finite sequences of elementary unitary similarities ⋮ Solving systems of linear equations with normal coefficient matrices and the degree of the minimal polyanalytic polynomial ⋮ On tridiagonal matrices unitarily equivalent to normal matrices ⋮ Low-rank perturbations of normal and conjugate-normal matrices and their condensed forms under unitary similarities and congruences ⋮ The symplectic eigenvalue problem, the butterfly form, the SR algorithm, and the Lanczos method
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- On a condensed form for normal matrices under finite sequences of elementary unitary similarities
- Schur parameter pencils for the solution of the unitary eigenproblem
- Necessary and Sufficient Conditions for the Existence of a Conjugate Gradient Method
- Matrix Analysis
- Matrix shapes invariant under the symmetric QR algorithm
- Polynomial zerofinders based on Szegő polynomials
This page was built for publication: On a condensed form for normal matrices under finite sequences of elementary unitary similarities