Conjugate gradient methods for continuation problems. II
conjugate gradient methodgeneralized minimal residual algorithmlarge sparse continuation problemsmultiple bifurcationsnonlinear eigenvalue problemnumerical resultsperformancepredictor-Newton corrector confirmation method
Iterative numerical methods for linear systems (65F10) Numerical computation of eigenvalues and eigenvectors of matrices (65F15) Numerical solution of nonlinear eigenvalue and eigenvector problems (65H17) Global methods, including homotopy approaches to the numerical solution of nonlinear equations (65H20)
[For part I see \textit{E. L. Allgower}, \textit{C.-S. Chien}, \textit{K. Georg} and \textit{C.-F. Wang}, ibid. 38, No. 1-3, 1-16 (1991; Zbl 0753.65046).] The paper is concerned with a study of the linear conjugate gradient method for large sparse continuation problems. This method is incorporated as linear solver in the context of a continuation method. The branches of the solution of linear and nonlinear eigenvalue problems are approximated using the generalized minimal residual (GMRES) algorithm of \textit{Y. Saad} and \textit{M. H. Schultz} [SIAM J. Sci. Stat. Comput. 7, 856-869 (1986; Zbl 0599.65018)]. It is also indicated how this preconditioned algorithm may by used to test simple and multiple bifurcations without solving the bordered linear systems. An efficient higher-order predictor-Newton corrector confirmation method is proposed with the implementation based on the GMRES algorithm. How to use a special conjugate gradient method to perform the corrector phase is also described. In both cases the investigation deals with the perturbation problems for the bifurcation. Samples of numerical results concerning certain nonlinear eigenvalue problems and concluding remarks concerning the performance of three-term conjugate gradient methods are also given.
- A composite step conjugate gradients squared algorithm for solving nonsymmetric linear systems
- A New Algorithm for Numerical Path Following Applied to an Example from Hydrodynamical Flow
- A parallel continuation algorithm for nonlinear eigenvalue problems
- A Quasi-Minimal Residual Variant of the Bi-CGSTAB Algorithm for Nonsymmetric Systems
- A Transpose-Free Quasi-Minimal Residual Algorithm for Non-Hermitian Linear Systems
- An analysis of the composite step biconjugate gradient method
- Bi-CGSTAB: A Fast and Smoothly Converging Variant of Bi-CG for the Solution of Nonsymmetric Linear Systems
- Bifurcations of a simplified buckling problem and the effect of discretizations
- Bifurcations of corank greater than two
- Block Five Diagonal Matrices and the Fast Numerical Solution of the Biharmonic Equation
- CGS, A Fast Lanczos-Type Solver for Nonsymmetric Linear systems
- Conjugate gradient methods for continuation problems
- Continuation and Local Perturbation for Multiple Bifurcations
- Continuation-Conjugate Gradient Methods for the Least Squares Solution of Nonlinear Boundary Value Problems
- Continuation-minimization methods for stability problems
- Deflation Techniques and Block-Elimination Algorithms for Solving Bordered Singular Systems
- GMRES: A Generalized Minimal Residual Algorithm for Solving Nonsymmetric Linear Systems
- scientific article; zbMATH DE number 4213315 (Why is no real title available?)
- scientific article; zbMATH DE number 47206 (Why is no real title available?)
- scientific article; zbMATH DE number 88927 (Why is no real title available?)
- scientific article; zbMATH DE number 3574436 (Why is no real title available?)
- scientific article; zbMATH DE number 3269388 (Why is no real title available?)
- Iterative Methods for Solving Bordered Systems with Applications to Continuation Methods
- Krylov Subspace Methods on Supercomputers
- Large sparse continuation 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 Tracing an Implicitly Defined Curve by Quasi-Newton Steps and Calculating Bifurcation by Local Perturbations
- Path following around corank-2 bifurcation points of a semi-linear elliptic problem with symmetry
- QMR: A quasi-minimal residual method for non-Hermitian linear systems
- The Lanczos Biorthogonalization Algorithm and Other Oblique Projection Methods for Solving Large Unsymmetric Systems
- Conjugate gradient methods for continuation problems
- Large sparse continuation problems
- Iterative methods for large continuation problems
- Conjugate gradient type methods for semilinear elliptic problems with symmetry
- Nonlinear eigenvalue problems with symmetry
- Numerical experiments with MG continuation algorithms
- 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
- scientific article; zbMATH DE number 1138053 (Why is no real title available?)
- Conjugate gradient predictor corrector method for solving large scale problems
- MULTIGRID-CONJUGATE GRADIENT TYPE METHODS FOR REACTION–DIFFUSION SYSTEMS
- Application of the Lanczos algorithm for solving the linear systems that occur in continuation problems
This page was built for publication: Conjugate gradient methods for continuation problems. II
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1917822)
