A variable dimension fixed point algorithm and the orientation of simplices

DOI10.1007/BF02591935zbMath0575.65043OpenAlexW2043984974MaRDI QIDQ3694554

Yoshitsugu Yamamoto

Publication date: 1984

Published in: Mathematical Programming (Search for Journal in Brave)

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

zbMATH Keywords

fixed point algorithmvariable dimension algorithmorientation of simplices

Mathematics Subject Classification ID

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

Related Items (4)

Fixed-term homotopy ⋮ Rational biparameter homotopy perturbation method and Laplace-Padé coupled version ⋮ Modified HPMs inspired by homotopy continuation methods ⋮ A discrete multivariate mean value theorem with applications

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• A Homotopy for Solving Large, Sparse and Structured Fixed Point Problems
• On the existence and approximation of zeroes
• A unified approach to the implementation of several restart fixed point algorithms and a new variable dimension algorithm
• Simplicial and Continuation Methods for Approximating Fixed Points and Solutions to Systems of Equations
• A class of simplicial restart fixed point algorithms without an extra dimension
• Orientation in Complementary Pivot Algorithms
• The Solution of Systems of Piecewise Linear Equations
• The octahedral algorithm, a new simplicial fixed point algorithm
• A new variable dimension algorithm for the fixed point problem
• A restart algorithm for computing fixed points without an extra dimension

This page was built for publication: A variable dimension fixed point algorithm and the orientation of simplices