Numerical continuation methods: a perspective
Publication:1593828
DOI10.1016/S0377-0427(00)00428-3zbMath0966.65049WikidataQ127363650 ScholiaQ127363650MaRDI QIDQ1593828
Publication date: 1 August 2001
Published in: Journal of Computational and Applied Mathematics (Search for Journal in Brave)
historical surveysimplicial complexesdegree theorysystems of nonlinear equationsnumerical continuation methodshomotopy methodssingularity and foldpoint theory
Numerical computation of solutions to systems of equations (65H10) History of mathematics in the 20th century (01A60) Global methods, including homotopy approaches to the numerical solution of nonlinear equations (65H20) History of numerical analysis (65-03)
Related Items (10)
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- MANPAK: A set of algorithms for computations on implicitly defined manifolds
- On a computational method for the second fundamental tensor and its application to bifurcation problems
- Singularities and groups in bifurcation theory. Volume I
- 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 computation of multi-dimensional solution manifolds of parametrized equations
- A comparison of methods for determining turning points of nonlinear equations
- Finite dimensional approximation of nonlinear problems. I: Branches of nonsingular solutions
- Simplicial pivoting for mesh generation of implicitly defined surfaces
- Manifolds, tensor analysis, and applications.
- Singularities and groups in bifurcation theory. Volume II
- The computation of fixed points and applications
- Complexity of Bezout's theorem. V: Polynomial time
- Piecewise linear methods for nonlinear equations and optimization
- A new algorithm for two-dimensional numerical continuation
- Algorithm 652
- On the Discretization Error of Parametrized Nonlinear Equations
- On the Computation of Manifolds of Foldpoints for Parameter-Dependent Problems
- A locally parameterized continuation process
- An Algorithm for Piecewise-Linear Approximation of an Implicitly Defined Manifold
- A Geometric Framework for the Numerical Study of Singular Points
- Efficient Numerical Pathfollowing Beyond Critical Points
- Solution Fields of Nonlinear Equations and Continuation Methods
- Finding Zeroes of Maps: Homotopy Methods That are Constructive With Probability One
- Algorithm 777: HOMPACK90
- Algorithm 801: POLSYS_PLP
- On the Sensitivity of Solutions of Parameterized Equations
- Approximate Solutions of Transport Problems. II. Convergence and Applications of the Discrete Ordinate Method
This page was built for publication: Numerical continuation methods: a perspective