- Journal Home
- Volume 21 - 2024
- Volume 20 - 2023
- Volume 19 - 2022
- Volume 18 - 2021
- Volume 17 - 2020
- Volume 16 - 2019
- Volume 15 - 2018
- Volume 14 - 2017
- Volume 13 - 2016
- Volume 12 - 2015
- Volume 11 - 2014
- Volume 10 - 2013
- Volume 9 - 2012
- Volume 8 - 2011
- Volume 7 - 2010
- Volume 6 - 2009
- Volume 5 - 2008
- Volume 4 - 2007
- Volume 3 - 2006
- Volume 2 - 2005
- Volume 1 - 2004
Cited by
- BibTex
- RIS
- TXT
Designing effective high-order adaptive methods for solving stationary reaction-diffusion equations in three dimensions requires the selection of a finite element basis, a posteriori error estimator and refinement strategy. Estimator accuracy may depend on the basis chosen, which in turn, may lead to unreliability or inefficiency via under- or over-refinement, respectively. The basis may also have an impact on the size and condition of the matrices that arise from discretization, and thus, on algorithm effectiveness. Herein, the interaction between these three components is studied in the context of an $h$-refinement procedure. The effects of these choices on the robustness and efficiency of the algorithm are examined for several linear and nonlinear problems. The results demonstrate that popular choices such as the tensor-product basis or the modified Szabό-Babuška basis have significant shortcomings but that promising alternatives exist.
}, issn = {2617-8710}, doi = {https://doi.org/}, url = {http://global-sci.org/intro/article_detail/ijnam/888.html} }Designing effective high-order adaptive methods for solving stationary reaction-diffusion equations in three dimensions requires the selection of a finite element basis, a posteriori error estimator and refinement strategy. Estimator accuracy may depend on the basis chosen, which in turn, may lead to unreliability or inefficiency via under- or over-refinement, respectively. The basis may also have an impact on the size and condition of the matrices that arise from discretization, and thus, on algorithm effectiveness. Herein, the interaction between these three components is studied in the context of an $h$-refinement procedure. The effects of these choices on the robustness and efficiency of the algorithm are examined for several linear and nonlinear problems. The results demonstrate that popular choices such as the tensor-product basis or the modified Szabό-Babuška basis have significant shortcomings but that promising alternatives exist.