Iterative methods for large continuation problems
DOI10.1016/S0377-0427(00)00405-2zbMath0974.65052MaRDI QIDQ1591183
Daniela Calvetti, Lothar Reichel
Publication date: 29 November 2001
Published in: Journal of Computational and Applied Mathematics (Search for Journal in Brave)
algorithms; eigenvalue; numerical examples; eigenvectors; iteration method; singular point; turning point; symmetric matrix; continuation problem; continuation methods; nonlinear parameter dependent problems; restarted block-Lanczos method
65H10: Numerical computation of solutions to systems of equations
65H20: Global methods, including homotopy approaches to the numerical solution of nonlinear equations
65H17: Numerical solution of nonlinear eigenvalue and eigenvector problems
Related Items
Uses Software
Cites Work
- Unnamed Item
- Numerical methods in bifurcation problems. Lectures delivered at the Indian Institute of Science, Bangalore, under the T.I.F.R.-I.I.Sc. Programme in Applications of Mathematics. Notes by A. K. Nandakumaran and Mythily Ramaswamy
- Multiple limit point bifurcation
- Conjugate gradient methods for continuation problems
- Computation of a few small eigenvalues of a large matrix with application to liquid crystal modeling
- Fast Leja points
- An implicit restarted Lanczos method for large symmetric eigenvalue problems
- A block-Lanczos method for large continuation problems
- Eigenvalues of the discretized Navier-Stokes equation with application to the detection of Hopf bifurcations
- Conjugate gradient methods for continuation problems. II
- Iterative methods for the computation of a few eigenvalues of a large symmetric matrix
- A New Algorithm for Numerical Path Following Applied to an Example from Hydrodynamical Flow
- On Tracing an Implicitly Defined Curve by Quasi-Newton Steps and Calculating Bifurcation by Local Perturbations
- The Spectral Transformation Lanczos Method for the Numerical Solution of Large Sparse Generalized Symmetric Eigenvalue Problems
- Implicit Application of Polynomial Filters in a k-Step Arnoldi Method
- Mesh Independence of Matrix-Free Methods for Path Following