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

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
Set OpenAlex properties.
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/0024-3795(93)90481-3 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2006031755 / rank
 
Normal rank

Revision as of 01:54, 20 March 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