On the nonuniqueness of the factorization factors in the product singular value decomposition (Q1580534): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
ReferenceBot (talk | contribs)
Changed an Item
 
(3 intermediate revisions by 2 users not shown)
Property / reviewed by
 
Property / reviewed by: Axel Ruhe / rank
Normal rank
 
Property / reviewed by
 
Property / reviewed by: Axel Ruhe / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5689624 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computing the Singular Value Decomposition of a Product of Two Matrices / rank
 
Normal rank
Property / cites work
 
Property / cites work: A New Preprocessing Algorithm for the Computation of the Generalized Singular Value Decomposition / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the structure and geometry of the product singular value decomposition / rank
 
Normal rank
Property / cites work
 
Property / cites work: Generalizations of the Singular Value and QR-Decompositions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3819898 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computation of system balancing transformations and other applications of simultaneous diagonalization algorithms / rank
 
Normal rank

Latest revision as of 13:54, 30 May 2024

scientific article
Language Label Description Also known as
English
On the nonuniqueness of the factorization factors in the product singular value decomposition
scientific article

    Statements

    On the nonuniqueness of the factorization factors in the product singular value decomposition (English)
    0 references
    0 references
    0 references
    7 October 2001
    0 references
    The product singular value decomposition, as is used in e.g. the Procrustes problem, is described in a partitioned form such that 5 arbitrary orthogonal blocks, 3 arbitrary rectangular blocks and one arbitrary nonsingular block determine the choices available when the decomposition is not unique. The sizes of the blocks is determined by ranks of the matrices and their product, and the multiplicity of the singular values.
    0 references
    0 references
    product singular value decomposition
    0 references
    Procrustes problem
    0 references
    0 references