Iterative methods for large continuation problems (Q1591183)

From MaRDI portal
Revision as of 11:57, 3 June 2024 by ReferenceBot (talk | contribs) (‎Changed an Item)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article
Language Label Description Also known as
English
Iterative methods for large continuation problems
scientific article

    Statements

    Iterative methods for large continuation problems (English)
    0 references
    29 November 2001
    0 references
    This is a nice summary of continuation methods for nonlinear parameter dependent problems and implicitly restarted block-Lanczos method for computation of a few eigenvalues and the associated eigenvectors of a symmetric matrix. By combining these techniques the authors developed algorithms for path following around a turning point, detecting singular points on the solution path and for branch switching at a bifurcation point. The algorithms are proposed for large continuation problems and are illustrated by numerical examples.
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    continuation problem
    0 references
    iteration method
    0 references
    eigenvalue
    0 references
    singular point
    0 references
    continuation methods
    0 references
    nonlinear parameter dependent problems
    0 references
    restarted block-Lanczos method
    0 references
    eigenvectors
    0 references
    symmetric matrix
    0 references
    turning point
    0 references
    algorithms
    0 references
    numerical examples
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references