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

Efficient Parallel Algorithms for Parabolic Problems

โœ Scribed by Du, Q.; Mu, M.; Wu, Z. N.

Book ID
118190276
Publisher
Society for Industrial and Applied Mathematics
Year
2002
Tongue
English
Weight
200 KB
Volume
39
Category
Article
ISSN
0036-1429

No coin nor oath required. For personal study only.

๐Ÿ“œ SIMILAR VOLUMES

Parallel algorithms for a singularly per
Parallel algorithms for a singularly perturbed parabolic problem
โœ Igor Boglaev ๐Ÿ“‚ Article ๐Ÿ“… 1999 ๐Ÿ› John Wiley and Sons ๐ŸŒ English โš– 372 KB ๐Ÿ‘ 2 views

This article deals with iterative algorithms for domain decomposition applied to the solution of a singularly perturbed parabolic problem. These algorithms are based on finite difference domain decomposition methods and are suitable for parallel computing. Convergence properties of the algorithms ar

Parallel Algorithms for Orthotropic Prob
Parallel Algorithms for Orthotropic Problems
โœ Ivar Gustafsson; Gunhild Lindskog ๐Ÿ“‚ Article ๐Ÿ“… 1996 ๐Ÿ› John Wiley and Sons ๐ŸŒ English โš– 784 KB

Finite element meshes and node-numberings suitable for parallel solution with equally loaded processors are presented for linear orthotropic elliptic partial differential equations. These problems are of great importance, for instance in the oil and airfoil industries. The linear systems of equation

Efficient Parallel Algorithms for Permut
Efficient Parallel Algorithms for Permutation Graphs
โœ K. Arvind; V. Kamakoti; C.P. Rangan ๐Ÿ“‚ Article ๐Ÿ“… 1995 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 641 KB

In this paper, we present optimal \(O(\log n)\) time, \(O(n / \log n)\) processor EREW PRAM parallel algorithms for finding the connected components, cut vertices, and bridges of a permutation graph. We also present an \(O(\log n)\) time, \(O(n)\) processor, CREW PRAM model parallel algorithm for fi