Block decomposition techniques in the generation of adaptive grids

Nadaniela Egidi and Pierluigi Maponi

Mathematics and Computers in Simulation (MATCOM), 2008, vol. 78, issue 5, 593-604

Abstract: We consider the problem of the generation of adaptive grids, where, for a given domain Ω, we have to compute a partition that depends on a given map f providing the desired local mesh size. We propose a numerical method for the solution of this problem in the case of planar quadrilateral grids. In particular, a block decomposition method is proposed, by which Ω is first decomposed in several blocks depending on the shape of the domain and on the size map f, and then the whole grid is obtained as the union of the quadrilateral grids on each block. The algorithm concludes with a smoothing step that depends on the size map f. We present some simple numerical examples to test the proposed method.

Keywords: Adaptive grid; Block decomposition technique; Mapping approach; Grid optimization (search for similar items in EconPapers)
Date: 2008
References: View complete reference list from CitEc
Citations: View citations in EconPapers (1)

Downloads: (external link)
http://www.sciencedirect.com/science/article/pii/S0378475408001602
Full text for ScienceDirect subscribers only

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:eee:matcom:v:78:y:2008:i:5:p:593-604

DOI: 10.1016/j.matcom.2008.04.003

Access Statistics for this article

Mathematics and Computers in Simulation (MATCOM) is currently edited by Robert Beauwens

More articles in Mathematics and Computers in Simulation (MATCOM) from Elsevier
Bibliographic data for series maintained by Catherine Liu ().