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

Solving an advection-diffusion problem on the connection machine

โœ Scribed by Berggren, Martin

Publisher
John Wiley and Sons
Year
1994
Tongue
English
Weight
557 KB
Volume
6
Category
Article
ISSN
1040-3108

No coin nor oath required. For personal study only.

๐Ÿ“œ SIMILAR VOLUMES

A Data Parallel Algorithm for Solving th
A Data Parallel Algorithm for Solving the Region Growing Problem on the Connection Machine
โœ N. Copty; S. Ranka; G. Fox; R.V. Shankar ๐Ÿ“‚ Article ๐Ÿ“… 1994 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 696 KB

Region growing is a general technique for image segmentation, where image characteristics are used to group adjacent pixels together to form regions. This paper presents a parallel algorithm for solving the region growing problem based on the split-andmerge approach, and uses it to test and compare

Solving the advectionโ€“diffusion equation
Solving the advectionโ€“diffusion equation on unstructured meshes with discontinuous/mixed finite elements and a local time stepping procedure
โœ Ch. P. El Soueidy; A. Younes; P. Ackerer ๐Ÿ“‚ Article ๐Ÿ“… 2009 ๐Ÿ› John Wiley and Sons ๐ŸŒ English โš– 932 KB

## Abstract Explicit schemes are known to provide less numerical diffusion in solving the advectionโ€“diffusion equation, especially for advectionโ€dominated problems. Traditional explicit schemes use fixed time steps restricted by the global __CFL__ condition in order to guarantee stability. This is