Results 11 - 20 of 905

O.: p4est: scalable algorithms for parallel adaptive mesh refinement on forests of octrees

by Carsten Burstedde, Lucas C. Wilcox, Omar Ghattas - SIAM J. Sci. Comput. (in press
"... Abstract. We present scalable algorithms for parallel adaptive mesh refinement and coarsening (AMR), partitioning, and 2:1 balancing on computational domains composed of multiple connected 2D quadtrees or 3D octrees, referred to as a forest of octrees. By distributing the union of octants from all o ..."
Abstract - Cited by 46 (5 self) - Add to MetaCart
Abstract. We present scalable algorithms for parallel adaptive mesh refinement and coarsening (AMR), partitioning, and 2:1 balancing on computational domains composed of multiple connected 2D quadtrees or 3D octrees, referred to as a forest of octrees. By distributing the union of octants from all

Parallel Refinement of Unstructured Meshes

by José G. Castaños, John E. Savage , 1999
"... In this paper we describe a parallel #-refinement algorithm for unstructured finite element meshes based on the longest-edge bisection of triangles and tetrahedrons. This algorithm is implemented in PARED, a system that supports the parallel adaptive solution of PDEs. We discuss the design of such a ..."
Abstract - Cited by 8 (1 self) - Add to MetaCart
of such an algorithm for distributed memory machines including the problem of propagating refinement across processor boundaries to obtain meshes that are conforming and non-degenerate. We also demonstrate that the meshes obtained by this algorithm are equivalent to the ones obtained using the serial longest

Parallel 3D Adaptive Mesh Refinement in Titanium

by Geoff Pike, Luigi Semenzato, Philip Colella, Paul N. Hilfinger , 1999
"... We describe a 3-dimensional adaptive mesh refinement Poisson solver. The complete program consists of about 3,500 lines of Titanium code and runs on both shared-memory and distributed-memory architectures. This paper focuses on the algorithm and on our experiences in writing AMR and tuning its perfo ..."
Abstract - Cited by 6 (3 self) - Add to MetaCart
We describe a 3-dimensional adaptive mesh refinement Poisson solver. The complete program consists of about 3,500 lines of Titanium code and runs on both shared-memory and distributed-memory architectures. This paper focuses on the algorithm and on our experiences in writing AMR and tuning its

Parallel Implicit Adaptive Mesh Refinement Scheme for Body-Fitted Multi-Block Mesh

by C. P. T. Groth, S. A. Northrup , 2005
"... A parallel implicit adaptive mesh refinement (AMR) algorithm is described for the system of partial-differential equations governing steady two-dimensional compressible gaseous flows. The AMR algorithm uses an upwind finite-volume spatial discretization procedure in conjunction with limited linear s ..."
Abstract - Cited by 10 (1 self) - Add to MetaCart
A parallel implicit adaptive mesh refinement (AMR) algorithm is described for the system of partial-differential equations governing steady two-dimensional compressible gaseous flows. The AMR algorithm uses an upwind finite-volume spatial discretization procedure in conjunction with limited linear

Fast Computation of Generalized Voronoi Diagrams Using Graphics Hardware

by Kenneth E. Hoff, III, Tim Culver, John Keyser, Ming Lin, Dinesh Manocha , 1999
"... We present a new approach for computing generalized 2D and 3D Voronoi diagrams using interpolation-based polygon rasterization hardware. We compute a discrete Voronoi diagram by rendering a three dimensional distance mesh for each Voronoi site. The polygonal mesh is a bounded-error approximation of ..."
Abstract - Cited by 234 (26 self) - Add to MetaCart
segments, polygons, polyhedra, curves, and curved surfaces in 2D and 3D. We generalize to weighted and farthest-site Voronoi diagrams, and present efficient techniques for computing the Voronoi boundaries, Voronoi neighbors, and the Delaunay triangulation of points. We also show how to adaptively refine

Parallelization of structured, hierarchical adaptive mesh refinement algorithms

by Charles A. Rendleman, Vincent E. Beckner, Mike Lijewski, William Crutchfield, John B. Bell - Computing and Visualization in Science , 2000
"... We describe an approach to parallelization of structured adaptive mesh refinement algorithms. This type of adaptive methodology is based on the use of local grids superimposed on a coarse grid to achieve sufficient resolution in the solution. The key elements of the approach to parallelization are a ..."
Abstract - Cited by 39 (10 self) - Add to MetaCart
We describe an approach to parallelization of structured adaptive mesh refinement algorithms. This type of adaptive methodology is based on the use of local grids superimposed on a coarse grid to achieve sufficient resolution in the solution. The key elements of the approach to parallelization

Adaptive mesh refinement using wave-propagation algorithms for hyperbolic systems

by Marsha J. Berger, Randall, J. Leveque - SIAM J. Numer. Anal , 1998
"... Dedicated to Ami Harten for his many contributions and warm sense of humor. Abstract. An adaptive mesh refinement algorithm developed for the Euler equations of gas dynamics has been extended to employ high-resolution wave-propagation algorithms in a more general framework. This allows its use on a ..."
Abstract - Cited by 76 (8 self) - Add to MetaCart
Dedicated to Ami Harten for his many contributions and warm sense of humor. Abstract. An adaptive mesh refinement algorithm developed for the Euler equations of gas dynamics has been extended to employ high-resolution wave-propagation algorithms in a more general framework. This allows its use on a

171ADAPTIVE MESH REFINEMENT A PARALLEL ADAPTIVE MESH REFINEMENT ALGORITHM FOR SOLVING NONLINEAR DYNAMICAL SYSTEMS

by Weicheng Huang, Danesh K. Tafti
"... An unstructured adaptive mesh refinement (AMR) method is used in conjunction with the cell-to-cell mapping method for solving nonlinear dynamical systems. The global anal-ysis is initiated with a coarse mesh without any a priori knowledge of the cell state space of the system. The process of investi ..."
Abstract - Add to MetaCart
An unstructured adaptive mesh refinement (AMR) method is used in conjunction with the cell-to-cell mapping method for solving nonlinear dynamical systems. The global anal-ysis is initiated with a coarse mesh without any a priori knowledge of the cell state space of the system. The process

Parallel Adaptive Mesh Refinement Algorithms

by Mustafa Keskin, Fikret Erca , 1994
"... This study is aimed at developing 2D parallel adaptive mesh refinement algorithms for engineering applications such as penetration mechanics, manufacturing and combustion which use the finite element method for simulation. A new algorithmic approach, called piecewise adaptive mesh refinement for par ..."
Abstract - Add to MetaCart
This study is aimed at developing 2D parallel adaptive mesh refinement algorithms for engineering applications such as penetration mechanics, manufacturing and combustion which use the finite element method for simulation. A new algorithmic approach, called piecewise adaptive mesh refinement

A parallel algorithm for adaptive local refinement of tetrahedral meshes using bisection

by Lin-bo Zhang - Numerical Mathematics: Theory, Methods and Applications
"... Local mesh refinement is one of the key steps in implementations of adaptive finite element methods. This paper presents a parallel algorithm for distributed memory parallel computers for adaptive local refinement of tetrahedral meshes using bisection. The algorithm is part of PHG, Parallel Hierarch ..."
Abstract - Cited by 5 (2 self) - Add to MetaCart
Local mesh refinement is one of the key steps in implementations of adaptive finite element methods. This paper presents a parallel algorithm for distributed memory parallel computers for adaptive local refinement of tetrahedral meshes using bisection. The algorithm is part of PHG, Parallel
Results 11 - 20 of 905