On tridiagonal matrices unitarily equivalent to normal matrices

DOI10.1016/J.LAA.2010.02.009zbMATH Open1221.15058OpenAlexW2067378250MaRDI QIDQ968982FDOQ968982

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

Krylov subspacessingular value decompositionalgorithmsingular valuesnormal matricestridiagonal matricesunitary equivalencecomplex symmetric matricesTakagi factorizationtridiagonalizationunitary-complex symmetric factorization

Mathematics Subject Classification ID

Factorization of matrices (15A23) Hermitian, skew-Hermitian, and related matrices (15B57) Numerical solutions to overdetermined systems, pseudoinverses (65F20) Canonical forms, reductions, classification (15A21)

Cites Work

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

Cited In (10)

• Title not available (Why is that?)
• Reduction to Tridiagonal Form and Minimal Realizations
• Tridiagonal forms of complex symmetric and persymmetric matrices
• A comparison between the complex symmetric based and classical computation of the singular value decomposition of normal matrices
• On tridiagonal matrices unitarily equivalent to normal matrices
• A Finite Procedure for the Tridiagonalization of a General Matrix
• Title not available (Why is that?)
• Unitary-triangular factorizations of a normal matrix
• On the pseudounitary \(QR\) algorithm for pseudo-Hermitian matrices
• Normal equivalent to an arbitrary diagonalizable matrix

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

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