A spectral trichotomy method for symplectic matrices (Q735069): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Q2707390 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4396493 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3023553 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Some new algorithms for the spectral dichotomy methods / rank
 
Normal rank
Property / cites work
 
Property / cites work: Spectral Analysis of Symplectic Matrices with Application to the Theory of Parametric Resonance / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5711210 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3359644 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3998992 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4850020 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Structured Factorizations in Scalar Product Spaces / rank
 
Normal rank
Property / cites work
 
Property / cites work: Discrete-time Lyapunov stability of large matrices / rank
 
Normal rank
Property / cites work
 
Property / cites work: On theoretical and numerical aspects of symplectic Gram-Schmidt-like algorithms / rank
 
Normal rank

Latest revision as of 01:58, 2 July 2024

scientific article
Language Label Description Also known as
English
A spectral trichotomy method for symplectic matrices
scientific article

    Statements

    A spectral trichotomy method for symplectic matrices (English)
    0 references
    0 references
    0 references
    14 October 2009
    0 references
    Given a symplectic matrix an algorithm is presented which allows the numerical approximation of spectral projectors onto the invariant subspaces corresponding to the eigenvalues inside, on, and outside the unit circle. Three matrix sequences are generated iteratively from which the projectors can be obtained. Convergence depends on the distance between the eigenvalues inside the unit circle and the circle itself. The larger the gap, the faster is convergence. Numerical results are given.
    0 references
    0 references
    0 references
    symplectic matrices
    0 references
    invariant subspaces
    0 references
    spectral projector
    0 references
    eigenvalues
    0 references
    convergence
    0 references
    numerical results
    0 references
    0 references