On computing the eigenvalues of a symplectic pencil (Q1260805): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Matrix eigensystem routines. EISPACK guide extension / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5185900 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4692382 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A new method for computing the closed-loop eigenvalues of a discrete-time algebraic Riccati equation / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Symplectic Orthogonal Method for Single Input or Single Output Discrete Time Optimal Quadratic Control Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: An Algorithm for Generalized Matrix Eigenvalue Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the numerical solution of the discrete-time algebraic Riccati equation / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Generalized Eigenvalue Approach for Solving Riccati Equations / 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: Q3850185 / rank
 
Normal rank

Latest revision as of 18:41, 17 May 2024

scientific article
Language Label Description Also known as
English
On computing the eigenvalues of a symplectic pencil
scientific article

    Statements

    On computing the eigenvalues of a symplectic pencil (English)
    0 references
    0 references
    25 August 1993
    0 references
    An algorithm is presented for computing the eigenvalues of a symplectic matrix pencil which arises in solving the discrete-time algebraic Riccati equation. The algorithm uses only orthogonal transformations and needs about a quarter as many floating-point operations as the QZ algorithm in this case. The method is roughly analogous to the method of \textit{C. van Loan} [ibid. 61, 233-251 (1984; Zbl 0565.65018)] for computing eigenvalues of Hamiltonian matrices.
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    comparison of algorithms
    0 references
    algorithm
    0 references
    eigenvalues
    0 references
    symplectic matrix pencil
    0 references
    discrete-time algebraic Riccati equation
    0 references
    QZ algorithm
    0 references
    Hamiltonian matrices
    0 references
    0 references