The fractal behaviour of triangular refined/derefined meshes
β Scribed by de la Hoz, A. Plaza
- Publisher
- John Wiley and Sons
- Year
- 1996
- Tongue
- English
- Weight
- 424 KB
- Volume
- 12
- Category
- Article
- ISSN
- 1069-8299
No coin nor oath required. For personal study only.
β¦ Synopsis
In the paper the author presents a novel point of view for the refinement and derefinement algorithms of triangular nested meshes using fractal concepts and iterated function systems (IFS). The fractal behaviour can be understood in the sense that these meshes feature a remarkable amplifying invariance under changes of magnification. Here we compare the meshes obtained by the combination of these algorithms with those presented by Bova and Carey (1992). Although both of the meshes are very similar, the current algorithms automatically build and manage sequences of nested irregular discretizations of the domain.
The author illustrates here how the application of IFS families is equivalent to the use of an adaptive strategy that combines the refinement procedure with the derefinement one.
π SIMILAR VOLUMES
We present a new approach to quadrilateral mesh reΓΏnement, which reduces the problem to its structural core. The resulting problem formulation belongs to a class of discrete problems, network-ow problems, which has been thoroughly investigated and is well understood. The network-ow model is exible
## Abstract This paper presents the results of an investigation into a possible alternative to Monte Carlo methods for solving the transported probability density function (__PDF__) equation for scalars (compositions). The method uses a finiteβvolume approach combined with adaptive mesh refinement