On tridiagonal matrices unitarily equivalent to normal matrices

DOI10.1016/j.laa.2010.02.009zbMath1221.15058OpenAlexW2067378250MaRDI QIDQ968982

Raf Vandebril

Publication date: 11 May 2010

Published in: Linear Algebra and its Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.laa.2010.02.009

zbMATH Keywords

algorithmsingular value decompositionsingular valuestridiagonal matricesnormal matricesKrylov subspacesTakagi factorizationunitary equivalencecomplex symmetric matricestridiagonalizationunitary-complex symmetric factorization

Mathematics Subject Classification ID

Related Items (2)

On tridiagonal matrices unitarily equivalent to normal matrices ⋮ A comparison between the complex symmetric based and classical computation of the singular value decomposition of normal matrices

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• On a condensed form for normal matrices under finite sequences of elementary unitary similarities
• Approximation of the scattering amplitude and linear systems
• Some observations on the Youla form and conjugate-normal matrices
• A note on an unusual type of polar decomposition
• Conjugate-normal matrices: A survey
• On tridiagonal matrices unitarily equivalent to normal matrices
• Normal matrices
• Singular value decompositions of complex symmetric matrices
• Normal matrices: an update
• High performance solution of the complex symmetric eigenproblem
• On the convergence of a new Rayleigh quotient method with applications to large eigenproblems
• Unitary-triangular factorizations of a normal matrix
• An efficient method for computing eigenvalues of a real normal matrix.
• Eigenvalue computation for unitary rank structured matrices
• A unitary Hessenberg \(QR\)-based algorithm via semiseparable matrices
• Exclusion and Inclusion Regions for the Eigenvalues of a Normal Matrix
• A Hermitian Lanczos Method for Normal Matrices
• Fast Polar Decomposition of an Arbitrary Matrix
• The design and implementation of the MRRR algorithm
• A generalized LSQR algorithm
• Performance and Accuracy of LAPACK's Symmetric Tridiagonal Eigensolvers
• Matrix Analysis
• Computing the Polar Decomposition—with Applications
• Two Conjugate-Gradient-Type Methods for Unsymmetric Linear Equations
• The Arnoldi Method for Normal Matrices
• Convergence of the unitary $QR$ algorithm with a unimodular Wilkinson shift
• A $QL$ Procedure for Computing the Eigenvalues of Complex Symmetric Tridiagonal Matrices
• Product Eigenvalue Problems
• The Matrix Eigenvalue Problem
• Structured Factorizations in Scalar Product Spaces
• An Error Analysis of a Unitary Hessenberg QR Algorithm
• Calculating the Singular Values and Pseudo-Inverse of a Matrix

This page was built for publication: On tridiagonal matrices unitarily equivalent to normal matrices