๐”– Bobbio Scriptorium
โœฆ   LIBER   โœฆ

On the convergence rates of subdivision algorithms for box spline surfaces

โœ Scribed by Wolfgang Dahmen; Nira Dyn; David Levin

Publisher
Springer
Year
1985
Tongue
English
Weight
709 KB
Volume
1
Category
Article
ISSN
0176-4276

No coin nor oath required. For personal study only.

๐Ÿ“œ SIMILAR VOLUMES

Effect of the subdivision strategy on co
Effect of the subdivision strategy on convergence and efficiency of some global optimization algorithms
โœ Hoang Tuy ๐Ÿ“‚ Article ๐Ÿ“… 1991 ๐Ÿ› Springer US ๐ŸŒ English โš– 874 KB

We investigate subdivision strategies that can improve the convergence and efficiency of some branch and bound algorithms of global optimization. In particular, a general class of so called weakly exhaustive simplicial subdivision processes is introduced that subsumes all previously known radial exh

Techniques for bounding the convergence
Techniques for bounding the convergence rate of genetic algorithms
โœ Yuri Rabinovich; Avi Wigderson ๐Ÿ“‚ Article ๐Ÿ“… 1999 ๐Ÿ› John Wiley and Sons ๐ŸŒ English โš– 308 KB ๐Ÿ‘ 2 views

The main purpose of the present paper is the study of computational aspects, ## ลฝ . and primarily the convergence rate, of genetic algorithms GAs . Despite the fact that such algorithms are widely used in practice, little is known so far about their theoretical properties, and in particular about