𝔖 Bobbio Scriptorium
✦   LIBER   ✦

A Better Triangulation for Wright's 2n-Ray Algorithm

✍ Scribed by Chuangyin Dang; Dolf Talman

Publisher
Elsevier Science
Year
1997
Tongue
English
Weight
216 KB
Volume
212
Category
Article
ISSN
0022-247X

No coin nor oath required. For personal study only.

✦ Synopsis

We give a triangulation for Wright's 2 n -ray algorithm to compute solutions of nonlinear equations. According to measures of efficiency of triangulations, it is better than any other available triangulation for the 2 n -ray algorithm.

πŸ“œ SIMILAR VOLUMES

A Better Approximation Algorithm for Fin
A Better Approximation Algorithm for Finding Planar Subgraphs
✍ Gruia CΔƒlinescu; Cristina G Fernandes; Ulrich Finkler; Howard Karloff πŸ“‚ Article πŸ“… 1998 πŸ› Elsevier Science 🌐 English βš– 321 KB

The MAXIMUM PLANAR SUBGRAPH problemᎏgiven a graph G, find a largest planar subgraph of Gᎏhas applications in circuit layout, facility layout, and graph drawing. No previous polynomial-time approximation algorithm for this NP-Complete problem was known to achieve a performance ratio larger than 1r3,

A ray-by-ray algorithm for shaping dual-
A ray-by-ray algorithm for shaping dual-offset reflector antennas
✍ J. O. RubiΓ±os-LΓ³pez; A. GarcΓ­a-Pino πŸ“‚ Article πŸ“… 1997 πŸ› John Wiley and Sons 🌐 English βš– 279 KB

solution, based on the Markov chain model, agree that the modified algorithm gives improved performance.