Please use this identifier to cite or link to this item:
|Type:||Artigo de evento|
|Title:||Adaptive Wavelet Representation And Differentiation On Block-structured Grids|
|Abstract:||This paper considers a new adaptive wavelet solver for two-dimensional systems based on an adaptive block refinement (ABR) method that takes advantage of the quadtree structure of dyadic blocks in rectangular regions of the plane. The computational domain is formed by non-overlapping blocks. Each block is a uniform grid, but the step size may change from one block to another. The blocks are not predetermined, but they are dynamically constructed according to the refinement needs of the numerical solution. The decision over whether a block should be refined or unrefined is taken by looking at the magnitude of wavelet coefficients of the numerical solution on such block. The wavelet coefficients are defined as differences between values interpolated from a coarser level and known function values at the finer level. The main objective of this paper is to establish a general framework for the construction and operation on such adaptive block-grids in 2D. The algorithms and data structure are formulated by using abstract concepts borrowed from quaternary trees. This procedure helps in the understanding of the method and simplifies its computational implementation. The ability of the method is demonstrated by solving some typical test problems. © 2003 IMACS. Published by Elsevier B.V. All rights reserved.|
|Appears in Collections:||Unicamp - Artigos e Outros Documentos|
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.