Iterative methods for large continuation problems (Q1591183)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 1546548
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Iterative methods for large continuation problems |
scientific article; zbMATH DE number 1546548 |
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
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.9092729
0 references
0.9078981
0 references
0.8991047
0 references
0.89827514
0 references
