✦ LIBER ✦

Parallel algorithms for computational continuum dynamics

✍ Scribed by Joseph F. McGrath; Darrell L. Hicks; Lorie M. Liebrock

Publisher: Elsevier Science
Year: 1986
Tongue: English
Weight: 1013 KB
Volume: 20
Category: Article
ISSN: 0096-3003
DOI: 10.1016/0096-3003(86)90131-1

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Parallel algorithm for molecular dynamic

Parallel algorithm for molecular dynamics integration

✍ Roman Trobec; Izidor Jerebic; Dušanka Janežič 📂 Article 📅 1993 🏛 Elsevier Science 🌐 English ⚖ 519 KB

Development of a parallel computational

Development of a parallel computational fluid dynamics algorithm on a hypercube computer

✍ Mark E. Braaten 📂 Article 📅 1991 🏛 John Wiley and Sons 🌐 English ⚖ 1010 KB

Computational fluid dynamics on parallel

Computational fluid dynamics on parallel processors

✍ William D. Gropp; Edward B. Smith 📂 Article 📅 1990 🏛 Elsevier Science 🌐 English ⚖ 932 KB

Optimal Parallel Algorithms for Computer

Optimal Parallel Algorithms for Computer Vision Problems

✍ Chin-Hsiung Wu; Shi-Jinn Horng; Horng-Ren Tsai 📂 Article 📅 2002 🏛 Elsevier Science 🌐 English ⚖ 315 KB

The computational model on which the algorithms are developed is the arrays with reconfigurable optical buses (abbreviated to AROB). It integrates the advantages of both optical transmission and electronic computation. In this paper, instead of using the radix-2 system, a radix-x system can be used

Some algorithms for vector or parallel c

Some algorithms for vector or parallel computers

✍ Jocelyne Erhel; Alain Lichnewsky; Francois Thomasset 📂 Article 📅 1984 🏛 Elsevier Science 🌐 English ⚖ 548 KB

A Parallel Algorithm for Computing Minim

A Parallel Algorithm for Computing Minimum Spanning Trees

✍ D.B. Johnson; P. Metaxas 📂 Article 📅 1995 🏛 Elsevier Science 🌐 English ⚖ 840 KB

We present a simple and implementable algorithm that computes a minimum spanning tree of an undirected weighted graph \(G=(V, E)\) of \(n=|V|\) vertices and \(m=|E|\) edges on an EREW PRAM in \(O\left(\log ^{3 / 2} n\right)\) time using \(n+m\) processors. This represents a substantial improvement i