Mesh Algorithms for PDE with Sieve I: Mesh Distribution
نویسندگان
چکیده
منابع مشابه
Mesh algorithms for PDE with Sieve I: Mesh distribution
We have developed a new programming framework, called Sieve, to support parallel numerical PDE1 algorithms operating over distributed meshes. We have also developed a reference implementation of Sieve in C++ as a library of generic algorithms operating on distributed containers conforming to the Sieve interface. Sieve makes instances of the incidence relation, or arrows, the conceptual first-cl...
متن کاملHapticFlow: PDE-based mesh editing with haptics
This paper presents HapticFlow, a haptics-based direct mesh editing system founded upon the concept of PDE-based geometric surface flow. The proposed flow-based approach for direct geometric manipulation offers a unified design paradigm that can seamlessly integrate implicit, distance-field based shape modeling with dynamic, physics-based shape design. HapticFlow provides an intuitive haptic in...
متن کاملFast Median Filtering Algorithms for Mesh Computers Fast Median Filtering Algorithms for Mesh Computers
Two fast algorithms for median ltering of images using parallel computers having 2-D mesh interconnections are given. Both algorithms assume that an n n image is loaded onto the mesh with one processing element per pixel. One algorithm performs median l-tering over d d neighborhoods in O(d 2) time and works with pixel values in an arbitrarily large range. This algorithm, while theoretically sub...
متن کاملAdaptive Methods for PDE ’ s Wavelets or Mesh Refinement ?
Adaptive mesh refinement techniques are nowadays an established and powerful tool for the numerical discretization of PDE’s. In recent years, wavelet bases have been proposed as an alternative to these techniques. The main motivation for the use of such bases in this context is their good performances in data compression and the approximation theoretic foundations which allow to analyze and opt...
متن کاملPDE-Based Gradient Limiting for Mesh Size Functions
We propose a new method for limiting the gradients in a mesh size function by solving a non-linear partial differential equation on the background mesh. Our gradient limiting Hamilton-Jacobi equation simplifies the generation of mesh size functions significantly, by decoupling size constraints at specific locations from the mesh grading requirements. We derive an analytical solution for convex ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Scientific Programming
سال: 2009
ISSN: 1058-9244,1875-919X
DOI: 10.1155/2009/948613