## The Computation of Fixed Points and Applications |

### What people are saying - Write a review

We haven't found any reviews in the usual places.

### Contents

Some Applications of Brouwers Theorem | 17 |

Triangulations | 24 |

Algorithms to Find CompletelyLabelled Simplices | 40 |

Copyright | |

7 other sections not shown

### Other editions - View all

### Common terms and phrases

aff(S affine combination affinely independent approximate fixed point approximation to F artificial labels barycentric subdivision Brouwer's theorem c e int Chapter closed n-cell compact completely-labelled simplices computation continuous function contradiction convex convex hull convex set define Definition denote diam's directional density Eaves example facets of type follows grid hence homeomorphic homotopy integer labelling Jacobian l l l Let F Let G lies linear programming Mathematical matrix Merrill's algorithm mesh n-l)—simplex n-simplex n-simplices NLCP nodes nonempty Nonlinear Complementarity Problem Nonlinear Programming Note number of simplices obtain šie p. l. approximation P(RP path permutation point of f primitive sets Proof prove result Saigal satisfying Scarf Section Seiten simplex simplices of G solution Sperner's lemma Step tion triangulation G triangulation with crogs u. s.c. mappings unique vector labelling vertex WNOG zero