A block-Lanczos method for large continuation problems
DOI10.1023/A:1019161413952zbMATH Open0942.65054OpenAlexW1662305649MaRDI QIDQ1817783FDOQ1817783
Authors: Daniela Calvetti, Lothar Reichel
Publication date: 2 August 2000
Published in: Numerical Algorithms (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1023/a:1019161413952
Recommendations
least squareseigenvectorspreconditioningbifurcationnonlinear systemsnumerical exampleturning pointsNewton's methodsingular pointsconjugate gradientseigenvalue computationEuler's methodpath followingblock-Lanczos algorithmlarge continuation problems
Global methods, including homotopy approaches to the numerical solution of nonlinear equations (65H20) Numerical solution of nonlinear eigenvalue and eigenvector problems (65H17)
Cited In (7)
- Title not available (Why is that?)
- Title not available (Why is that?)
- An Adaptation of Krylov Subspace Methods to Path Following Problems
- Bordered augmented linear systems in numerical continuation and bifurcation
- Application of the Lanczos algorithm for solving the linear systems that occur in continuation problems
- Iterative methods for large continuation problems
- Dealing with linear dependence during the iterations of the restarted block Lanczos methods
This page was built for publication: A block-Lanczos method for large continuation problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1817783)