A comparison between the complex symmetric based and classical computation of the singular value decomposition of normal matrices (Q742851): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Singular value decompositions of complex symmetric matrices / rank
 
Normal rank
Property / cites work
 
Property / cites work: An Improved Algorithm for Computing the Singular Value Decomposition / rank
 
Normal rank
Property / cites work
 
Property / cites work: A $QL$ Procedure for Computing the Eigenvalues of Complex Symmetric Tridiagonal Matrices / rank
 
Normal rank
Property / cites work
 
Property / cites work: Eigenvalue computation for unitary rank structured matrices / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4348513 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Normal matrices / rank
 
Normal rank
Property / cites work
 
Property / cites work: Multiple representations to compute orthogonal eigenvectors of symmetric tridiagonal matrices / rank
 
Normal rank
Property / cites work
 
Property / cites work: Normal matrices: an update / rank
 
Normal rank
Property / cites work
 
Property / cites work: A note on an unusual type of polar decomposition / rank
 
Normal rank
Property / cites work
 
Property / cites work: On conjugate gradient type methods and polynomial preconditioners for a class of complex non-Hermitian matrices / rank
 
Normal rank
Property / cites work
 
Property / cites work: A unitary Hessenberg \(QR\)-based algorithm via semiseparable matrices / rank
 
Normal rank
Property / cites work
 
Property / cites work: Calculating the Singular Values and Pseudo-Inverse of a Matrix / rank
 
Normal rank
Property / cites work
 
Property / cites work: Singular value decomposition and least squares solutions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5689624 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Matrix Analysis / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4040931 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Arnoldi Method for Normal Matrices / rank
 
Normal rank
Property / cites work
 
Property / cites work: Unitary-triangular factorizations of a normal matrix / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4422516 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4348515 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The structured distance to normality of Toeplitz matrices with application to preconditioning / rank
 
Normal rank
Property / cites work
 
Property / cites work: On tridiagonal matrices unitarily equivalent to normal matrices / rank
 
Normal rank
Property / cites work
 
Property / cites work: Convergence of the unitary $QR$ algorithm with a unimodular Wilkinson shift / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Divide-and-Conquer Method for the Takagi Factorization / rank
 
Normal rank
Property / cites work
 
Property / cites work: A fast symmetric SVD algorithm for square Hankel matrices / rank
 
Normal rank
Property / cites work
 
Property / cites work: A twisted factorization method for symmetric SVD of a complex symmetric tridiagonal matrix / rank
 
Normal rank

Latest revision as of 01:18, 9 July 2024

scientific article
Language Label Description Also known as
English
A comparison between the complex symmetric based and classical computation of the singular value decomposition of normal matrices
scientific article

    Statements

    A comparison between the complex symmetric based and classical computation of the singular value decomposition of normal matrices (English)
    0 references
    0 references
    0 references
    0 references
    19 September 2014
    0 references
    singular value decomposition
    0 references
    symmetric singular value decomposition
    0 references
    Takagi factorization
    0 references
    normal matrix
    0 references
    algorithm
    0 references
    numerical experiment
    0 references
    Golub-Kahan method
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers