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

Symbolic Local Refinement of Tetrahedral Grids

โœ Scribed by D.J. Hebert

Publisher
Elsevier Science
Year
1994
Tongue
English
Weight
421 KB
Volume
17
Category
Article
ISSN
0747-7171

No coin nor oath required. For personal study only.

โœฆ Synopsis

A recent local grid refinement algorithm for simplicial grids is shown to be suitable for symbolic implementation in the 3 -dimensional case. An addressing scheme stores all the geometric information about the tetrahedra in the refinement tree. Location of vertices and the addresses of physically nearest neighbors are computed by decoding the symbols of the simplex address. Bisection and face-compatible refinement of the simplex and its splitting neighbors are obtained by symbolic and logical operations on the leaves of the tree.

๐Ÿ“œ SIMILAR VOLUMES

Numerical Solution of Plasma Fluid Equat
Numerical Solution of Plasma Fluid Equations Using Locally Refined Grids
โœ Phillip Colella; Milo R Dorr; Daniel D Wake ๐Ÿ“‚ Article ๐Ÿ“… 1999 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 449 KB

This paper describes a numerical method for the solution of plasma fluid equations on block-structured, locally refined grids. The plasmas under consideration are typical of those used for the processing of semiconductors. The governing equations consist of a drift-diffusion model of the electrons,

A local grid refinement method for three
A local grid refinement method for three-dimensional turbulent recirculating flows
โœ G. Papadakis; G. Bergeles ๐Ÿ“‚ Article ๐Ÿ“… 1999 ๐Ÿ› John Wiley and Sons ๐ŸŒ English โš– 321 KB ๐Ÿ‘ 2 views

A local grid refinement method is presented and applied to a three-dimensional turbulent recirculating flow. It is based on the staggered grid arrangement. The computational domain is covered by block-structured subgrids of different refinement levels. The exchange of information between the subgrid