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

Combinatorial solutions of multidimensional divide-and-conquer recurrences

โœ Scribed by Louis Monier


Publisher
Elsevier Science
Year
1980
Tongue
English
Weight
572 KB
Volume
1
Category
Article
ISSN
0196-6774

No coin nor oath required. For personal study only.


๐Ÿ“œ SIMILAR VOLUMES


Tighter Bounds on the Solution of a Divi
โœ Biing-Feng Wang ๐Ÿ“‚ Article ๐Ÿ“… 1997 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 207 KB

Let M n be defined by the recurrence where f is an arbitrary nondecreasing function and M 1 is given. The recurrence ลฝ . M n is a divide-and-conquer maximin recurrence, which occurs in a variety of ลฝ . problems in the analysis of algorithms. In this paper, a new upper bound on M n is first derived.

Parallel implementation of divide-and-co
โœ Pan, Wei; Lee, Tai-Sung; Yang, Weitao ๐Ÿ“‚ Article ๐Ÿ“… 1998 ๐Ÿ› John Wiley and Sons ๐ŸŒ English โš– 179 KB

We have implemented a parallel divide-and-conquer method for semiempirical quantum mechanical calculations. The standard message passing ลฝ . library, the message passing interface MPI , was used. In this parallel version, the memory needed to store the Fock and density matrix elements is distributed