A better triangulation for Wright's \(2^n\)-ray algorithm (Q1365094)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 1053992
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A better triangulation for Wright's \(2^n\)-ray algorithm |
scientific article; zbMATH DE number 1053992 |
Statements
A better triangulation for Wright's \(2^n\)-ray algorithm (English)
0 references
20 March 2000
0 references
It is well-known that the efficiency of simplicial fixed point algorithms crucially depends on the underlying triangulations. In this paper, the authors propose a modification of \textit{A. H. Wright}'s \(2^{n}\)-ray algorithm [Math. Program. 21, 47-69 (1981; Zbl 0475.65029)]. It is shown that this modification is better than any other available triangulation for the \(2^{n}\)-ray algorithm.
0 references
simplicial fixed point algorithm
0 references
triangulations
0 references
\( 2^{n}\)-ray algorithm
0 references
0 references
0 references
0.8089481592178345
0 references
0.8056566715240479
0 references
0.795228898525238
0 references
0.7451340556144714
0 references
