|Title:||Adaptive techniques for unstructured nested meshes||Authors:||Padrón, Miguel A.
Suárez, José P.
|UNESCO Clasification:||120601 Construcción de algoritmos||Keywords:||Refinement
|Issue Date:||2004||Journal:||Applied Numerical Mathematics||Conference:||2nd Meeting on Applied Scientific Computing and Tools||Abstract:||The purpose of this paper is twofold. First we introduce improved versions of our algorithms for refining and coarsening 2D and 3D nested triangular and tetrahedral grids, and secondly the application of these algorithms in the simulation of 2D and 3D problems, is demonstrated. A key idea of the algorithms is the use of the topological concept of the skeleton of a triangulation in two or three dimensions in order to reduce the dimension of the refinement problem in a natural hierarchic manner. Improved skeleton based refinement (SBR) algorithms and their counterpart, the skeleton based derefinement (SBD) algorithms are described in this study. The algorithms are fully automatic and are applied here to a 2D boundary value problem, a 3D approximation problem with a large gradient, a geometric shape modeling problem and a simulation evolution problem in 3D. © 2004 IMACS. Published by Elsevier B.V. All rights reserved.||URI:||http://hdl.handle.net/10553/42517||ISSN:||0168-9274||DOI:||10.1016/j.apnum.2004.06.010||Source:||Applied Numerical Mathematics [ISSN 0168-9274], v. 51 (4), p. 565-579||URL:||https://api.elsevier.com/content/abstract/scopus_id/7544238853|
|Appears in Collections:||Actas de congresos|
checked on Nov 26, 2023
WEB OF SCIENCETM
checked on Feb 20, 2022
checked on Apr 15, 2023
Items in accedaCRIS are protected by copyright, with all rights reserved, unless otherwise indicated.