Please use this identifier to cite or link to this item: http://hdl.handle.net/10553/45259
Title: An improved derefinement algorithm of nested meshes
Authors: Plaza, A. 
Montenegro, R 
Ferragut, L.
UNESCO Clasification: 120601 Construcción de algoritmos
Keywords: Algebra
Computational complexity
Data structures
GeometryVectors
Issue Date: 1996
Journal: Advances in Engineering Software 
Conference: 2nd International Conference on Computational Structures Technology 
Abstract: In this paper we present a new version of the derefinement algorithm developed by Plaza et al. (in Numerical Methods in Engineering, Elsevier Science, Amsterdam, 1992, pp. 225–232; in Algorithms, Software, Architecture, Elsevier Science, Amsterdam, 1992, pp. 409–415; A. Plaza, PhD thesis, University of Las Palmas de Gran Canaria, 1993; Commun. Numer. Meth. Engng., 1994, 10, 403–412).1–4 The purpose is to achieve a better derefinement algorithm with a lesser degree of complexity. We present the theoretical study of this improved derefinement algorithm and of the inverse one for refinement. Firstly, our initial version of the derefinement algorithm is summarized. Then we present the refinement algorithm associated with the improved derefinement one. Finally, automatic control of the sequences of irregular nested triangulations is shown by means of the resolution of an unsteady problem. In this problem the initial mesh has only nine nodes and a combination of refinements and derefinements have been applied to approach both the circular domain and the initial solution.
URI: http://hdl.handle.net/10553/45259
ISSN: 0965-9978
DOI: 10.1016/0965-9978(96)00005-1
Source: Advances In Engineering Software [ISSN 0965-9978], v. 27 (1-2), p. 51-57, (Octubre-Noviembre 1996)
Appears in Collections:Artículos
Show full item record

Google ScholarTM

Check

Altmetric


Share



Export metadata



Items in accedaCRIS are protected by copyright, with all rights reserved, unless otherwise indicated.