Matrix factorizations for symplectic QR-like methods (Q1821504): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: A symplectic QR like algorithm for the solution of the real algebraic Riccati equation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Numerical linear algorithms and group theory / rank
 
Normal rank
Property / cites work
 
Property / cites work: On some algebraic problems in connection with general eigenvalue algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Schur decomposition for Hamiltonian matrices / rank
 
Normal rank
Property / cites work
 
Property / cites work: A symplectic method for approximating all the eigenvalues of a Hamiltonian matrix / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4057472 / rank
 
Normal rank

Latest revision as of 18:28, 17 June 2024

scientific article
Language Label Description Also known as
English
Matrix factorizations for symplectic QR-like methods
scientific article

    Statements

    Matrix factorizations for symplectic QR-like methods (English)
    0 references
    1986
    0 references
    The construction of QR-like methods for the solution of eigenvalue problems, that require symplectic similarity transformations to keep the structure invariant is discussed. The existence of SR factorizations with symplectic or unitary and symplectic S factors and different triangular forms R is analyzed and the relationship to transformations to Hessenberg-type forms is investigated.
    0 references
    unitary and symplectic matrices
    0 references
    Hamiltonian matrices
    0 references
    QR-algorithms
    0 references
    eigenvalue problems
    0 references
    symplectic similarity transformations
    0 references
    SR factorizations
    0 references
    Hessenberg-type forms
    0 references

    Identifiers