A numerical algorithm for computing the restricted singular value decomposition of matrix triplets (Q1189620): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
ReferenceBot (talk | contribs)
Changed an Item
 
(4 intermediate revisions by 3 users not shown)
Property / reviewed by
 
Property / reviewed by: Volker Mehrmann / rank
Normal rank
 
Property / reviewed by
 
Property / reviewed by: Volker Mehrmann / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / cites work
 
Property / cites work: Canonical correlations and generalized SVD: Applications and new algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3359644 / 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: Computing the Generalized Singular Value Decomposition / rank
 
Normal rank
Property / cites work
 
Property / cites work: The computation of Kronecker's canonical form of a singular pencil / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Restricted Total Least Squares Problem: Formulation, Algorithm, and Properties / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Restricted Singular Value Decomposition of Matrix Triplets / rank
 
Normal rank
Property / cites work
 
Property / cites work: Regularization and the General Gauss-Markov Linear Model / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 11:02, 16 May 2024

scientific article
Language Label Description Also known as
English
A numerical algorithm for computing the restricted singular value decomposition of matrix triplets
scientific article

    Statements

    A numerical algorithm for computing the restricted singular value decomposition of matrix triplets (English)
    0 references
    0 references
    27 September 1992
    0 references
    For a triplet of matrices \(A\), \(B\), \(C\) arising for example in linear control systems \(x=Ax+Bu\), \(y=Cx\) an algorithm is given to compute the restricted singular value decomposition of the triplet. The method is based on a reduction step to get a regular triplet that can be treated by the Kogbetliantz algorithm followed by some rank computations. Numerical examples are given.
    0 references
    rank detection
    0 references
    triplet of matrices
    0 references
    linear control systems
    0 references
    singular value decomposition
    0 references
    Kogbetliantz algorithm
    0 references
    Numerical examples
    0 references

    Identifiers