Abstract
Local adaptive grid refinement is an important technique in finite element methods. Its study can be traced back to the pioneering work [2] in one dimension. In recent years, mathematicians start to prove the convergence and optimal complexity of the adaptive procedure in multi-dimensions. Dörfler [11] first proved an error reduction in the energy norm for the Poisson equation provided the initial mesh is fine enough.
The work of C. Bacuta was partially supported by NSF DMS-0713125. L. Chen was supported in part by NSF Grant DMS-0811272, DMS-1115961, and in part by DOE Grant DE-SC0006903. J. Xu was supported in part by NSF DMS-0915153, NSFC-10528102, Alexander von Humboldt Research Award for Senior US Scientists and in part by DOE Grant DE-SC0006903.
Access provided by Autonomous University of Puebla. Download to read the full chapter text
Chapter PDF
Similar content being viewed by others
Keywords
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.
Bibliography
F. B. Atalay and D. M. Mount. The cost of compatible refinement of simplex decomposition trees. In Proceedings of the 15th International Meshing Roundtable, Birmingham, AL, September 2006, pages 57–70, 2006.
I. Babuška and W. C. Rheinboldt. A posteriori error estimates for the finite element method. Internat. J. Numer. Methods Engrg., 12: 1597–1615, 1978.
E. Bänsch. Local mesh refinement in 2 and 3 dimensions. Impact Comput. Sci. Engrg., 3:181–191, 1991.
T. C. Biedl, P. Bose, E. D. Demaine, and A. Lubiw. Efficient algorithms for Petersen’s matching theorem. J. Algorithms, 38(1):110–134, 2001. ISSN 0196-6774. doi: http://dx.doi.org/10.1006/jagm.2000.1132.
P. Binev and R. DeVore. Fast computation in adaptive tree approximation. Numer. Math., 97:193–217, 2004.
P. Binev, W. Dahmen, R. DeVore, and P. Petrushev. Approximation classes for adaptive methods. Serdica Math. J, 28:391–416, 2002.
P. Binev, W. Dahmen, and R. DeVore. Adaptive finite element methods with convergence rates. Numer. Math., 97(2):219–268, 2004.
J. M. Cascón, C. Kreuzer, R. H. Nochetto, and K. G. Siebert. Quasi-optimal convergence rate for an adaptive finite element method. SIAM J. Numer. Anal., 46(5):2524–2550, 2008.
L. Chen and J. Xu. Convergence of adaptive finite element methods. In T. Tang and J. Xu, editors, Adaptive Computations: Theory and Algorithms, pages 9–37. Science Press, Beijing, 2007.
R. A. DeVore. Nonlinear approximation. Acta Numer., pages 51–150, 1998.
W. Dörfler. A convergent adaptive algorithm for Poisson’s equation. SIAM J. Numer. Anal., 33:1106–1124, 1996.
P. Grisvard. Elliptic Problems in Nonsmooth Domains. Pitman, Boston, 1995.
W. F. Mitchell. Unified Multilevel Adaptive Finite Element Methods for Elliptic Problems. PhD thesis, University of Illinois at Urbana-Champaign, 1988.
W. F. Mitchell. A comparison of adaptive refinement techniques for elliptic problems. ACM Trans. Math. Softw. (TOMS) archive, 15(4): 326–347, 1989.
P. Morin, R. H. Nochetto, and K. G. Siebert. Data oscillation and convergence of adaptive FEM. SIAM J. Numer. Anal., 38(2):466–488, 2000.
P. Morin, R. H. Nochetto, and K. G. Siebert. Convergence of adaptive finite element methods. SIAM Rev., 44(4):631–658, 2002.
R. M. Stein. Note on the class L(logL). Studia. Math., 32:305–310, 1969.
R. Stevenson. Optimality of a standard adaptive finite element method. Found. Comput. Math., 7(2):245–269, 2007.
R. Verfürth. A Review of A Posteriori Error Estimation and Adaptive Mesh Refinement Tecniques. B. G. Teubner, 1996.
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2013 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Bacuta, C., Chen, L., Xu, J. (2013). Equidistribution and Optimal Approximation Class. In: Bank, R., Holst, M., Widlund, O., Xu, J. (eds) Domain Decomposition Methods in Science and Engineering XX. Lecture Notes in Computational Science and Engineering, vol 91. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-35275-1_1
Download citation
DOI: https://doi.org/10.1007/978-3-642-35275-1_1
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-35274-4
Online ISBN: 978-3-642-35275-1
eBook Packages: Mathematics and StatisticsMathematics and Statistics (R0)