- Journal Home
- Volume 22 - 2025
- 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
With in-depth refinement, the condition number of the incremental unknowns matrix associated to the Laplace operator is $p(d)O(1/H^2)O(|log_d h|^3)$ for the first order incremental unknowns, and $q(d)O(1/H^2)O((log_d h)^2)$ for the second order incremental unknowns, where $d$ is the depth of the refinement, $H$ is the mesh size of the coarsest grid, $h$ is the mesh size of the finest grid, $p(d) = \frac{d-1}{2}$ and $q(d) = \frac{d-1}{2} \frac{1}{12}d(d^2-1)$. Furthermore, if block diagonal (scaling) preconditioning is used, the condition number of the preconditioned incremental unknowns matrix associated to the Laplace operator is $p(d) O((log_d h)^2)$ for the first order incremental unknowns, and $q(d)O(|log_dh|)$ for the second order incremental unknowns. For comparison, the condition number of the nodal unknowns matrix associated to the Laplace operator is $O(1/h^2)$. Therefore, the incremental unknowns preconditioner is efficient with in-depth refinement, but its efficiency deteriorates at some rate as the depth of the refinement grows.
}, issn = {2617-8710}, doi = {https://doi.org/}, url = {http://global-sci.org/intro/article_detail/ijnam/857.html} }With in-depth refinement, the condition number of the incremental unknowns matrix associated to the Laplace operator is $p(d)O(1/H^2)O(|log_d h|^3)$ for the first order incremental unknowns, and $q(d)O(1/H^2)O((log_d h)^2)$ for the second order incremental unknowns, where $d$ is the depth of the refinement, $H$ is the mesh size of the coarsest grid, $h$ is the mesh size of the finest grid, $p(d) = \frac{d-1}{2}$ and $q(d) = \frac{d-1}{2} \frac{1}{12}d(d^2-1)$. Furthermore, if block diagonal (scaling) preconditioning is used, the condition number of the preconditioned incremental unknowns matrix associated to the Laplace operator is $p(d) O((log_d h)^2)$ for the first order incremental unknowns, and $q(d)O(|log_dh|)$ for the second order incremental unknowns. For comparison, the condition number of the nodal unknowns matrix associated to the Laplace operator is $O(1/h^2)$. Therefore, the incremental unknowns preconditioner is efficient with in-depth refinement, but its efficiency deteriorates at some rate as the depth of the refinement grows.