\(D_ 3\)-triangulation for simplicial deformation algorithms for computing solutions of nonlinear equations

DOI10.1007/BF00939905zbMath0790.65045OpenAlexW2017333950MaRDI QIDQ1321243

V. Pereyra

Publication date: 23 June 1994

Published in: Journal of Optimization Theory and Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bf00939905

zbMATH Keywords

numerical teststriangulationsfixed-point algorithmmeasures of efficiencysimplicial deformation algorithmssolutions of nonlinear equations

Mathematics Subject Classification ID

Numerical computation of solutions to systems of equations (65H10)

Related Items (2)

The \(D_ 2\)-triangulation for simplicial homotopy algorithms for computing solutions of nonlinear equations ⋮ Computation of Leray-Schauder fixed points

Cites Work

• A course in triangulations for solving equations with deformations
• The computation of fixed points and applications
• Simplicial algorithms on the simplotope
• The D1-Triangulation of Rn for Simplicial Algorithms for Computing Solutions of Nonlinear Equations
• A variable rate refining triangulation
• A Continuous Deformation Algorithm on the Product Space of Unit Simplices
• Simplicial and Continuation Methods for Approximating Fixed Points and Solutions to Systems of Equations
• A new subdivision for computing fixed points with a homotopy algorithm
• On triangulations for computing fixed points
• Homotopies for computation of fixed points
• Variable dimension algorithms: Basic theory, interpretations and extensions of some existing methods
• The Approximation of Fixed Points of a Continuous Mapping
• Homotopies for computation of fixed points on unbounded regions

This page was built for publication: \(D_ 3\)-triangulation for simplicial deformation algorithms for computing solutions of nonlinear equations