A variable dimension fixed point algorithm and the orientation of simplices. (English) Zbl 0575.65043

A variable dimension algorithm with integer labelling is proposed for solving systems of n equations in n variables. The algorithm is an integer labelling version of the 2-ray algorithm proposed by the author. The orientation of lower dimensional simplices is studied and is shown to be preserved along a sequence of adjacent simplices.


65H10 Numerical computation of solutions to systems of equations
Full Text: DOI


[1] E. Allgower and K. Georg, ”Simplicial and continuation methods for approximating fixed points and solutions to systems of equations”,SIAM Review 22 (1980) 28–85. · Zbl 0432.65027
[2] B.C. Eaves, ”A short course in solving equations with PL homotopies”,SIAM-AMS Proceedings 9 (1976) 73–143. · Zbl 0343.47048
[3] B.C. Eaves and H. Scarf, ”The solution of systems of piecewise linear equations”,Mathematics of Operations Research 1 (1976) 1–27. · Zbl 0458.65056
[4] M. Kojima and Y. Yamamoto, ”A unified approach to the implementation of several restart fixed point algorithms and a new variable dimension algorithm”,Mathematical Programming 28 (1984) 288–328. · Zbl 0539.65036
[5] G. van der Laan, ”Simplicial fixed point algorithms”, Ph.D. Dissertation, Free University (Amsterdam, 1980). · Zbl 0464.90046
[6] G. van der Laan, ”On the existence and approximation of zeroes”,Mathematical Programing 28 (1984) 1–24. · Zbl 0535.65031
[7] G. van der Laan and A.J.J. Talman, ”A restart algorithm for computing fixed point without extra dimension”,Mathematical Programming 17 (1979) 74–84. · Zbl 0411.90061
[8] G. van der Laan and A.J.J. Talman, ”A restart algorithm without an artificial level for computing fixed points on unbounded regions”, in: H.-O. Peitgen and H.-O. Walther, eds.,Functional Differential Equations and Approximation of Fixed Points, Lecture Notes in Mathematics 730 (Springer Berlin, 1979) pp. 247–256. · Zbl 0447.65019
[9] G. van der Laan and A.J.J. Talman, ”Convergence and properties of recent variable dimension algorithms”, in: W. Forster, ed.,Numerical Solution of Highly Nonlinear Problems, Fixed Point Algoroithms and Complementarity Problems (North-Holland, New York, 1980) pp. 3–36.
[10] G. van der Laan and A.J.J. Talman, ”A class of simplicial restart fixed point algorithms without an extra dimension”,Mathematical Programming 20 (1981) 33–48. · Zbl 0441.90112
[11] R. Saigal, ”A homotopy for solving large, sparse and structured fixed point problems”,Mathematics of Operations Research 8 (1983) 557–578. · Zbl 0532.65039
[12] M.J. Todd, ”Orientation in complementary pivoting”Mathematics of Operations Research 1 (1976) 54–66. · Zbl 0457.90074
[13] A.H. Wright, ”The octahedral algorithm, a new simplicial fixed point algorithm”,Mathematical Programming 21 (1981) 47–69. · Zbl 0475.65029
[14] Y. Yamamoto, ”A new variable dimension algorithm for the fixed point problem”,Mathematical Programming 25 (1983) 329–342. · Zbl 0495.90071
[15] Y. Yamamoto and K. Murata, ”A new variable dimension algorithm: extension for separable mappings, geometric interpretation and some applications”, Discussion Paper Series No. 129 (81-30), University of Tsukuba (Japan, 1981).
This reference list is based on information provided by the publisher or from digital mathematics libraries. Its items are heuristically matched to zbMATH identifiers and may contain data conversion errors. It attempts to reflect the references listed in the original paper as accurately as possible without claiming the completeness or perfect precision of the matching.