A block-Lanczos method for large continuation problems (Q1817783): Difference between revisions
From MaRDI portal
Added link to MaRDI item. |
Removed claims |
||
Property / author | |||
Property / author: Daniela Calvetti / rank | |||
Property / author | |||
Property / author: Lothar Reichel / rank | |||
Property / reviewed by | |||
Property / reviewed by: Juan Pedro Milaszewicz / rank | |||
Revision as of 09:54, 13 February 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | A block-Lanczos method for large continuation problems |
scientific article |
Statements
A block-Lanczos method for large continuation problems (English)
0 references
2 August 2000
0 references
When computing solution paths of systems of nonlinear parametric equations \[ G(u,\tau)=0, \] important problems may arise when bifurcation or turning points are encountered. In order to be able to detect such points and pass or traverse them along a desired path, a method is proposed here that solves iteratively the linear systems that arise in the application of Euler's method combined with Newton's method. The problems considered here produce symmetric Jacobian matrices and the iterative method is based on the block-Lanczos algorithm. The method allows the simultaneous computation of some small eigenvalues as well as its eigenvectors. This makes it easy to detect singular points, whose eigenvectors span the null space of the Jacobian matrix, which allows the computation of the least squares solution of the system \[ G_u*u_{\tau }+G_{\tau } =0, \] from which the derivative \(u_{\tau }\) for Euler's method is obtained. In a numerical example that illustrates the method, it is shown that it is more efficient than it would be with the application of conjugate gradients, that it is efficient for path following, and that it can be applied to very large problems, because it only requires the evaluation of matrix-vector products with Jacobian matrices.
0 references
path following
0 references
bifurcation
0 references
eigenvalue computation
0 references
preconditioning
0 references
nonlinear systems
0 references
large continuation problems
0 references
turning points
0 references
Euler's method
0 references
Newton's method
0 references
block-Lanczos algorithm
0 references
eigenvectors
0 references
singular points
0 references
least squares
0 references
numerical example
0 references
conjugate gradients
0 references