✦ LIBER ✦

Elliptic equation algorithms on parallel computers

✍ Scribed by Mcbryan, Oliver A. ;Van De Velde, Eric F.

Publisher: Wiley (John Wiley & Sons)
Year: 1986
Tongue: English
Weight: 474 KB
Volume: 2
Category: Article
ISSN: 0748-8025
DOI: 10.1002/cnm.1630020313

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Analysis of Multigrid Algorithms on Mass

Analysis of Multigrid Algorithms on Massively Parallel Computers: Architectural Implications

✍ Lesley R. Matheson; Robert E. Tarjan 📂 Article 📅 1996 🏛 Elsevier Science 🌐 English ⚖ 234 KB

We study the potential performance of multigrid algorithms running on massively parallel computers with the intent of discovering whether currently envisioned machines will provide an efficient platform for such algorithms. These algorithms substantially improve the performance of iterative methods

Parallel Multigrid for Anisotropic Ellip

Parallel Multigrid for Anisotropic Elliptic Equations

✍ M. Prieto; R. Santiago; D. Espadas; I.M. Llorente; F. Tirado 📂 Article 📅 2001 🏛 Elsevier Science 🌐 English ⚖ 387 KB

Parallel computation on interval graphs:

Parallel computation on interval graphs: algorithms and experiments

✍ A. Ferreira; I. Guérin Lassous; K. Marcus; A. Rau-Chaplin 📂 Article 📅 2002 🏛 John Wiley and Sons 🌐 English ⚖ 264 KB

Heterogeneous Computing and Parallel Gen

Heterogeneous Computing and Parallel Genetic Algorithms

✍ Enrique Alba; Antonio J. Nebro; José M. Troya 📂 Article 📅 2002 🏛 Elsevier Science 🌐 English ⚖ 495 KB

This paper analyzes some technical and practical issues concerning the heterogeneous execution of parallel genetic algorithms (PGAs). In order to cope with a plethora of different operating systems, security restrictions, and other problems associated to multi-platform execution, we use Java to impl

Scalable Parallel Matrix Multiplication

Scalable Parallel Matrix Multiplication on Distributed Memory Parallel Computers

✍ Keqin Li 📂 Article 📅 2001 🏛 Elsevier Science 🌐 English ⚖ 392 KB

Consider any known sequential algorithm for matrix multiplication over an arbitrary ring with time complexity O(N a ), where 2 < a [ 3. We show that such an algorithm can be parallelized on a distributed memory parallel computer (DMPC) in O(log N) time by using N a /log N processors. Such a parallel

General Algorithm for Improved Lattice A

General Algorithm for Improved Lattice Actions on Parallel Computing Architectures

✍ Frédéric D.R. Bonnet; Derek B. Leinweber; Anthony G. Williams 📂 Article 📅 2001 🏛 Elsevier Science 🌐 English ⚖ 275 KB

Quantum field theories underlie all of our understanding of the fundamental forces of nature. There are relatively few first-principles approaches to the study of quantum field theories (such as quantum chromodynamics [QCD] relevant to the strong interaction) apart from the perturbative (i.e., weak-