Conjugate gradient methods for continuation problems
Banach spacebifurcationsbranches of solutionsgeneralized minimal residual algorithmhigher-order predictor-Newton corrector confirmation methodslarge sparse confirmation problemsnonlinear conjugate gradient methodsnonlinear eigenvalue problemsnumerical results
Iterative numerical methods for linear systems (65F10) Numerical computation of eigenvalues and eigenvectors of matrices (65F15) Computational methods for sparse matrices (65F50) Numerical solution of nonlinear eigenvalue and eigenvector problems (65H17) Global methods, including homotopy approaches to the numerical solution of nonlinear equations (65H20)
The paper is concerned with the approximation of branches of solutions of linear and nonlinear eigenvalue problems. Such problems are likely to have arisen from a discretization of an operator equation in Banach space, which involves additional parameters. For such kind of problems linear and nonlinear conjugate gradient methods for large sparse confirmation problems are investigated. The authors show how linear conjugate gradient methods can be incorporated as linear solvers in the context of efficient higher-order predictor-Newton corrector confirmation methods. The implementation of this method is based on the generalized minimal residual algorithm of \textit{Y. Saad} and \textit{M. H. Schultz} [SIAM J. Sci. Stat. Comput. 7, 856-869 (1986; Zbl 0599.65018)]. The authors also describe how to use a special nonlinear conjugate gradient method to perform the corrector phase. In both cases the investigation deals with the perturbed problems for the bifurcations. Samples of numerical results concerning certain nonlinear eigenvalue problems are also given.
- Conjugate gradient methods for continuation problems. II
- Iterative methods for large continuation problems
- Large sparse continuation problems
- Continuation-Conjugate Gradient Methods for the Least Squares Solution of Nonlinear Boundary Value Problems
- Conjugate gradient predictor corrector method for solving large scale problems
- A Multigrid Continuation Method for Elliptic Problems with Folds
- A Pseudo-Arclength Continuation Method for Nonlinear Eigenvalue Problems
- An Iterative Solution Method for Linear Systems of Which the Coefficient Matrix is a Symmetric M-Matrix
- Conjugate gradient type methods and preconditioning
- Continuation and Local Perturbation for Multiple Bifurcations
- Continuation-Conjugate Gradient Methods for the Least Squares Solution of Nonlinear Boundary Value Problems
- Generalized conjugate directions
- GMRES: A Generalized Minimal Residual Algorithm for Solving Nonsymmetric Linear Systems
- Higher Order Predictors and Adaptive Steplength Control in Path Following Algorithms
- scientific article; zbMATH DE number 3881771 (Why is no real title available?)
- scientific article; zbMATH DE number 3930251 (Why is no real title available?)
- scientific article; zbMATH DE number 3658896 (Why is no real title available?)
- scientific article; zbMATH DE number 47206 (Why is no real title available?)
- scientific article; zbMATH DE number 3802743 (Why is no real title available?)
- scientific article; zbMATH DE number 3892457 (Why is no real title available?)
- scientific article; zbMATH DE number 3269388 (Why is no real title available?)
- scientific article; zbMATH DE number 3278849 (Why is no real title available?)
- Implementation of the GMRES Method Using Householder Transformations
- Iterative Methods for Solving Bordered Systems with Applications to Continuation Methods
- Krylov Subspace Methods for Solving Large Unsymmetric Linear Systems
- Large sparse continuation problems
- Numerical Methods for a Class of Finite Dimensional Bifurcation Problems
- 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
- On the Choice of Steplength in Path Following Methods
- On the monotone convergence of Newton's method
- On Tracing an Implicitly Defined Curve by Quasi-Newton Steps and Calculating Bifurcation by Local Perturbations
- PLTMGC: A Multigrid Continuation Program for Parameterized Nonlinear Elliptic Systems
- Proceedings of the fifth international symposium on numerical methods in engineering. Vol. 1 and Vol. 2
- The principle of minimized iterations in the solution of the matrix eigenvalue problem
- Stabilized forms of orthogonal residual and constant incremental work control path following methods
- Large sparse continuation problems
- Computation of a few small eigenvalues of a large matrix with application to liquid crystal modeling
- A parallel continuation algorithm for nonlinear eigenvalue problems
- Iterative methods for large continuation problems
- Conjugate gradient algorithms and the Galerkin boundary element method
- Conjugate gradient type methods for semilinear elliptic problems with symmetry
- Conjugate gradient methods for continuation problems. II
- Bifurcations of corank greater than two
- Continuation-minimization methods for stability problems
- Nonlinear eigenvalue problems with symmetry
- The modified Broyden-variational method for solving nonlinear elliptic differential equations
- Numerical experiments with MG continuation algorithms
- An efficient method for solving Bratu equations
- On the discrete dynamic nature of the conjugate gradient method
- scientific article; zbMATH DE number 3862335 (Why is no real title available?)
- Continuation-Conjugate Gradient Methods for the Least Squares Solution of Nonlinear Boundary Value Problems
- Numerical continuation through folds with step control
- Conjugate gradient predictor corrector method for solving large scale problems
- Conjugate gradient algorithms and finite element methods
- scientific article; zbMATH DE number 1404636 (Why is no real title available?)
This page was built for publication: Conjugate gradient methods for continuation problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1184104)
