𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Parallel nested dissection for path algebra computations

✍ Scribed by Victor Pan; John Reif

Publisher
Elsevier Science
Year
1986
Tongue
English
Weight
758 KB
Volume
5
Category
Article
ISSN
0167-6377

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

Using Selective Path-Doubling for Parall
Using Selective Path-Doubling for Parallel Shortest-Path Computations
✍ Edith Cohen πŸ“‚ Article πŸ“… 1997 πŸ› Elsevier Science 🌐 English βš– 291 KB

We 1 consider parallel shortest-paths computations in weighted undirected graphs Ε½ . < < < < Ε½ 3 . Gs V, E , where n s V and m s E . The standard O n work path-doubling Ε½ . Ε½ . Floyd-Warshall algorithm consists of O log n phases, where in each phase, for Ε½ . 3 every triplet of vertices u , u , u g V

Nested and parallel sparse algorithms fo
Nested and parallel sparse algorithms for arterial fluid mechanics computations with boundary layer mesh refinement
✍ Murat Manguoglu; Kenji Takizawa; Ahmed H. Sameh; Tayfun E. Tezduyar πŸ“‚ Article πŸ“… 2010 πŸ› John Wiley and Sons 🌐 English βš– 489 KB

## Abstract Arterial fluid–structure interaction (FSI) computations involve a number of numerical challenges. Because blood flow is incompressible, iterative solution of the fluid mechanics part of the linear equation system at every nonlinear iteration of each time step is one of those challenges,

A Para-Functional Programming Interface
A Para-Functional Programming Interface for a Parallel Computer Algebra Package
✍ WOLFGANG SCHREINER πŸ“‚ Article πŸ“… 1996 πŸ› Elsevier Science 🌐 English βš– 676 KB

We describe the application of pD, a small para-functional language that we developed as a high-level programming interface for the parallel computer algebra package PACLIB. pD provides several facilities to express parallel algorithms in a flexible way on different levels of abstraction. The compil

Order bound for a family of parallel Run
Order bound for a family of parallel Runge-Kutta-NystrΓΆm methods through computer algebra
✍ B. Paternoster πŸ“‚ Article πŸ“… 1998 πŸ› Elsevier Science 🌐 English βš– 634 KB

We prove a bound on the obtainable order of consistency for a family of parallel Runge-Kutta-Nystr6m methods, using computer algebra. Keywords--Numerical methods for ODEs, Runge-Kutta-NystrSm methods, Parallel methods, Computer algebra.