Conjugate gradient methods for continuation problems. II

DOI10.1016/0377-0427(94)00104-4zbMath0857.65060OpenAlexW4205316602MaRDI QIDQ1917822

Yanyan Li

Publication date: 9 March 1997

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

Full work available at URL: https://doi.org/10.1016/0377-0427(94)00104-4

zbMATH Keywords

performancenumerical resultsconjugate gradient methodnonlinear eigenvalue problemmultiple bifurcationsgeneralized minimal residual algorithmlarge sparse continuation problemspredictor-Newton corrector confirmation method

Mathematics Subject Classification ID

Numerical computation of eigenvalues and eigenvectors of matrices (65F15) Global methods, including homotopy approaches to the numerical solution of nonlinear equations (65H20) Iterative numerical methods for linear systems (65F10) Numerical solution of nonlinear eigenvalue and eigenvector problems (65H17)

Related Items

Conjugate gradient type methods for semilinear elliptic problems with symmetry, Iterative methods for large continuation problems

Uses Software

• ITSOL
• PITCON
• SPARSKIT
• CGS

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Bifurcations of a simplified buckling problem and the effect of discretizations
• 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
• 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
• Conjugate gradient methods for continuation problems
• Large sparse continuation problems
• A parallel continuation algorithm for nonlinear eigenvalue problems
• An analysis of the composite step biconjugate gradient method
• A composite step conjugate gradients squared algorithm for solving nonsymmetric linear systems
• Bifurcations of corank greater than two
• Continuation-minimization methods for stability problems
• A New Algorithm for Numerical Path Following Applied to an Example from Hydrodynamical Flow
• Deflation Techniques and Block-Elimination Algorithms for Solving Bordered Singular Systems
• Krylov Subspace Methods on Supercomputers
• Iterative Methods for Solving Bordered Systems with Applications to Continuation Methods
• 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
• CGS, A Fast Lanczos-Type Solver for Nonsymmetric Linear systems
• On Tracing an Implicitly Defined Curve by Quasi-Newton Steps and Calculating Bifurcation by Local Perturbations
• The Lanczos Biorthogonalization Algorithm and Other Oblique Projection Methods for Solving Large Unsymmetric Systems
• Bi-CGSTAB: A Fast and Smoothly Converging Variant of Bi-CG for the Solution of Nonsymmetric Linear Systems
• A Quasi-Minimal Residual Variant of the Bi-CGSTAB Algorithm for Nonsymmetric Systems
• Continuation and Local Perturbation for Multiple Bifurcations
• A Transpose-Free Quasi-Minimal Residual Algorithm for Non-Hermitian Linear Systems
• Block Five Diagonal Matrices and the Fast Numerical Solution of the Biharmonic Equation