A variable dimension fixed point algorithm and the orientation of simplices
A variable dimension algorithm with integer labelling is proposed for solving systems ofn equations inn 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.
Key wordsFixed Point Algorithm System of Equations Orientation of Simplices
Unable to display preview. Download preview PDF.
- 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.CrossRefGoogle Scholar
- 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.Google Scholar
- 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).Google Scholar