Conjugate gradient methods for continuation problems

DOI10.1016/0377-0427(91)90157-FzbMath0753.65046MaRDI QIDQ1184104

S. Singh

Publication date: 28 June 1992

Published in: Journal of Computational and Applied Mathematics (Search for Journal in Brave)

zbMATH Keywords

numerical results; bifurcations; Banach space; nonlinear conjugate gradient methods; nonlinear eigenvalue problems; branches of solutions; generalized minimal residual algorithm; higher-order predictor-Newton corrector confirmation methods; large sparse confirmation problems

Mathematics Subject Classification ID

65F50: Computational methods for sparse matrices

65F15: Numerical computation of eigenvalues and eigenvectors of matrices

65H20: Global methods, including homotopy approaches to the numerical solution of nonlinear equations

65F10: Iterative numerical methods for linear systems

65H17: Numerical solution of nonlinear eigenvalue and eigenvector problems

Related Items

Bifurcations of corank greater than two, Continuation-minimization methods for stability problems

Uses Software

• PITCON

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• On the monotone convergence of Newton's method
• Generalized conjugate directions
• 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
• Conjugate gradient type methods and preconditioning
• Large sparse continuation problems
• Implementation of the GMRES Method Using Householder Transformations
• Iterative Methods for Solving Bordered Systems with Applications to Continuation Methods
• PLTMGC: A Multigrid Continuation Program for Parameterized Nonlinear Elliptic Systems
• Continuation-Conjugate Gradient Methods for the Least Squares Solution of Nonlinear Boundary Value Problems
• GMRES: A Generalized Minimal Residual Algorithm for Solving Nonsymmetric Linear Systems
• A Multigrid Continuation Method for Elliptic Problems with Folds
• Higher Order Predictors and Adaptive Steplength Control in Path Following Algorithms
• On Tracing an Implicitly Defined Curve by Quasi-Newton Steps and Calculating Bifurcation by Local Perturbations
• Krylov Subspace Methods for Solving Large Unsymmetric Linear Systems
• An Iterative Solution Method for Linear Systems of Which the Coefficient Matrix is a Symmetric M-Matrix
• Numerical Methods for a Class of Finite Dimensional Bifurcation Problems
• A Pseudo-Arclength Continuation Method for Nonlinear Eigenvalue Problems
• Continuation and Local Perturbation for Multiple Bifurcations
• The principle of minimized iterations in the solution of the matrix eigenvalue problem
• On the Choice of Steplength in Path Following Methods