A simplicial homotopy algorithm for computing zero points on polytopes (Q1335391)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: A simplicial homotopy algorithm for computing zero points on polytopes |
scientific article; zbMATH DE number 646742
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A simplicial homotopy algorithm for computing zero points on polytopes |
scientific article; zbMATH DE number 646742 |
Statements
A simplicial homotopy algorithm for computing zero points on polytopes (English)
0 references
4 October 1994
0 references
The paper is devoted to the computation of zero points of a continuous mapping on a polytope, by means of a variable dimension algorithm constructed on the base of a suitable triangulation. This algorithm includes the octahedral algorithm as a special case. A new equivalent form of the well-known Brouwer theorem is also given, which is in fact a fixed point theorem of Miranda type [see, for example, {Ioan A. Rus}, Principles and applications of the fixed point theory (in Romanian), Editura DACIA, Cluj-Napoca (1979)]. No applications or numerical examples are given.
0 references
simplicial homotopy algorithm
0 references
zero points on polytopes
0 references
variable dimension algorithm
0 references
triangulation
0 references
octahedral algorithm
0 references
fixed point theorem
0 references
