Pages that link to "Item:Q4749611"

The following pages link to Variable dimension algorithms: Basic theory, interpretations and extensions of some existing methods (Q4749611):

Displaying 20 items.

• The \(D_ 2\)-triangulation for simplicial homotopy algorithms for computing solutions of nonlinear equations (Q687034) (← links)
• Combinatorial analogs of Brouwer's fixed-point theorem on a bounded polyhedron (Q756763) (← links)
• Simplicial zero-point algorithms: A unifying description (Q1061618) (← links)
• A variable-dimension homotopy on networks for computing linear spatial equilibria (Q1077331) (← links)
• Some computational methods for systems of nonlinear equations and systems of polynomial equations (Q1201902) (← links)
• The \((n+1)2^ m\)-ray algorithm: A new simplicial algorithm for the variational inequality problem on \(\mathbb{R}^ m_ +\times S^ n\) (Q1308654) (← links)
• \(D_ 3\)-triangulation for simplicial deformation algorithms for computing solutions of nonlinear equations (Q1321243) (← links)
• A continuous deformation algorithm for variational inequality problems on polytopes (Q1330896) (← links)
• Implementation of a continuation method for normal maps (Q1356060) (← links)
• Rational biparameter homotopy perturbation method and Laplace-Padé coupled version (Q1952986) (← links)
• Modified HPMs inspired by homotopy continuation methods (Q1954641) (← links)
• A unifying model based on retraction for fixed point algorithms (Q3316473) (← links)
• A unified approach to the implementation of several restart fixed point algorithms and a new variable dimension algorithm (Q3326743) (← links)
• Simplicial approximation of solutions to the nonlinear complementarity problem with lower and upper bounds (Q3771993) (← links)
• A variable rate refining triangulation (Q3773705) (← links)
• The (2 n+1−2)-ray algorithm: A new simplicial algorithm to compute economic equilibria (Q3780017) (← links)
• A new variable dimension algorithm for the fixed point problem (Q3959753) (← links)
• Efficiency and implementation of simplicial zero point algorithms (Q5186644) (← links)
• Computing an integer point of a class of convex sets. (Q5929418) (← links)
• Computing an integer point of a simplex with an arbitrary starting homotopy-like simplicial algorithm (Q5936075) (← links)