Error analysis of QR algorithms for computing Lyapunov exponents (Q1866489)

From MaRDI portal
scientific article
Language Label Description Also known as
English
Error analysis of QR algorithms for computing Lyapunov exponents
scientific article

    Statements

    Error analysis of QR algorithms for computing Lyapunov exponents (English)
    0 references
    0 references
    0 references
    30 October 2003
    0 references
    The authors consider the discrete and continuous QR algorithms for a simple class of test problems: Linear and constant coefficient systems. The mathematical problem reduces to one of linear algebra: To find the eigenvalues of a matrix. Although the associated analysis of the numerical algorithms requires results from both numerical linear algebra and ordinary differential equations. Rigorous convergence results are obtained. Numerical tests are applied for the case of real distinct eigenvalues and involving complex conjugate pairs.
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    error analysis
    0 references
    QR algorithms
    0 references
    Lyapunov exponents
    0 references
    dynamics
    0 references
    eigenvalues
    0 references
    orthogonal iteration
    0 references
    timestepping
    0 references
    numerical examples
    0 references
    convergence
    0 references
    0 references