On accelerating PL continuation algorithms by predictor—corrector methods
From MaRDI portal
Publication:3934152
DOI10.1007/BF01583781zbMath0477.90058MaRDI QIDQ3934152
Publication date: 1982
Published in: Mathematical Programming (Search for Journal in Brave)
triangulationpredictor-corrector methodnonlinear eigenvalue problemhybrid algorithmspath following methodspiecewise linear approximationsimplicial algorithmnumerical experiencecomplementary pivotingnonlinear bifurcation problem
Numerical mathematical programming methods (65K05) Nonlinear programming (90C30) Bifurcations in context of PDEs (35B32) Numerical solution of eigenvalue problems involving ordinary differential equations (65L15) Triangulation and topological properties of semi-analytic andsubanalytic sets, and related questions (32B25)
Related Items
Cites Work
- Zur Lösung parameterabhängiger nichtlinearer Gleichungen mit singulären Jacobi-Matrizen
- A stepsize control for continuation methods and its special application to multiple shooting techniques
- A globally convergent algorithm for computing fixed points of \(C^2\) maps
- The computation of fixed points and applications
- Simplicial and Continuation Methods for Approximating Fixed Points and Solutions to Systems of Equations
- Exploiting structure in piecewise-linear homotopy algorithms for solving equations
- On Tracing an Implicitly Defined Curve by Quasi-Newton Steps and Calculating Bifurcation by Local Perturbations
- A PL homotopy for finding all the roots of a polynomial
- On the Convergence Rate of Algorithms for Solving Equations that are Based on Methods of Complementary Pivoting
- Efficient Acceleration Techniques for Fixed Point Algorithms
- On Algorithms for Solvingf(x)=0
- A restart algorithm for computing fixed points without an extra dimension
- Homotopies for computation of fixed points
- Homotopies for computation of fixed points on unbounded regions
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
