Simplicial and Continuation Methods for Approximating Fixed Points and Solutions to Systems of Equations

DOI10.1137/1022003zbMath0432.65027MaRDI QIDQ3870229

Publication date: 1980

Published in: SIAM Review (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1137/1022003

zbMATH Keywords

Brouwer degree; bibliography; convex programming; order of convergence; bifurcation points; nonlinear complementarity problems; homotopy continuation method; constructive methods; fixed-point problem; nonlinear boundary-value problem; complementary pivoting; simplicial algorithms; programmable algorithms; prototype simplicial fixed-point algorithm; simplicial index; survey of simplicial and continuation methods

Mathematics Subject Classification ID

65K05: Numerical mathematical programming methods

90C25: Convex programming

65J05: General theory of numerical analysis in abstract spaces

65H10: Numerical computation of solutions to systems of equations

90C33: Complementarity and equilibrium problems and variational inequalities (finite dimensions) (aspects of mathematical programming)

47H10: Fixed-point theorems

01A65: Development of contemporary mathematics

65-02: Research exposition (monographs, survey articles) pertaining to numerical analysis

55M20: Fixed points and coincidences in algebraic topology

65-03: History of numerical analysis

Related Items

On the use of predictor-corrector continuation to trace implicitly defined curves and calculating bifurcation, An improved computation of time-optimal control trajectory for robotic point-to-point motion, A homotopy method of finding periodic solutions for ordinary differential equations from the upper and lower solutions, Finding periodic solutions of ordinary differential equations via homotopy method, Finding periodic solutions of ordinary differential equations via homotopy method, The \(D_ 2\)-triangulation for simplicial homotopy algorithms for computing solutions of nonlinear equations, A general CDC formulation for specializing the cell exclusion algorithms of finding all zeros of vector functions, Simplicial pivoting for mesh generation of implicitly defined surfaces, A power series method for computing singular solutions to nonlinear analytic systems, Some computational methods for systems of nonlinear equations and systems of polynomial equations, Computing singular solutions to polynomial systems, Generalized trajectory methods for finding multiple extrema and roots of functions, A continuation homotopy method for the inverse problem of operator identification and its application, Phase path tracing methods for solving the high order zeros of nonlinear systems, \(D_ 3\)-triangulation for simplicial deformation algorithms for computing solutions of nonlinear equations, Optimal homotopy methods for solving nonlinear systems. I: Nonsingular homotopy paths, A continuous deformation algorithm for variational inequality problems on polytopes, Deflated Krylov subspace methods for nearly singular linear systems, A cell exclusion algorithm for determining all the solutions of a nonlinear system of equations, A better triangulation for Wright's \(2^n\)-ray algorithm, Interval solution of nonlinear equations using linear programming, Determination of travel directions in path-following methods, A new algorithm for two-dimensional numerical continuation, Comparative statics in the large based on a fixed point algorithm, Time-stepping for three-dimensional rigid body dynamics, Triangulate flat cones on simplices, Obtaining initial parameter estimates for nonlinear systems using multicriteria associative memories, Matrix differential equations: a continuous realization process for linear algebra problems