Computational & Technology Resources
an online resource for computational,
engineering & technology publications
Civil-Comp Proceedings
ISSN 1759-3433
CCP: 21
Edited by: M. Papadrakakis and B.H.V. Topping
Paper IV.3

An Improved Derefinement Algorithm of Nested Meshes

A. Plaza*, R. Montenegro* and L. Ferragut#

*Department of Mathematics, University of Las Palmas de Gran Canaria, Spain
#Department of Applied Mathematics and Informatic Methods, Polytechnic University of Madrid, Madrid, Spain

Full Bibliographic Reference for this paper
A. Plaza, R. Montenegro, L. Ferragut, "An Improved Derefinement Algorithm of Nested Meshes", in M. Papadrakakis, B.H.V. Topping, (Editors), "Advances in Post and Preprocessing for Finite Element Technology", Civil-Comp Press, Edinburgh, UK, pp 175-180, 1994. doi:10.4203/ccp.21.4.3
In this paper we present a new version of the derefinement algorithm developed by Plaza et al. The purpose is to achieve a better derefinement algorithm in the sense of getting 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 to the improved derefinement one. Finally, the automatic control of the sequences of irregular nested triangulations is shown by means of the resolution of an unsteady problem. In this problem a combination of refinement and derefinement algorithms has been applied to approach a circular domain.

purchase the full-text of this paper (price £20)

go to the previous paper
go to the next paper
return to the table of contents
return to the book description