Abstract
We analyze the theoretical properties of an adaptive Legendre–Galerkin method in the multidimensional case. After the recent investigations for Fourier–Galerkin methods in a periodic box and for Legendre–Galerkin methods in the one dimensional setting, the present study represents a further step towards a mathematically rigorous understanding of adaptive spectral/\(hp\) discretizations of elliptic boundary-value problems. The main contribution of the paper is a careful construction of a multidimensional Riesz basis in \(H^1\), based on a quasi-orthonormalization procedure. This allows us to design an adaptive algorithm, to prove its convergence by a contraction argument, and to discuss its optimality properties (in the sense of non-linear approximation theory) in certain sparsity classes of Gevrey type.
Similar content being viewed by others
References
Adams, J.: On the expression of the product of any two legendres coefficients by means of a series of legendres coefficients. Proc. R. Soc. Lond. 27, 63–71 (1878)
Baouendi, M.S., Goulaouic, C.: Régularité analytique et itérés d’opérateurs elliptiques dégénérés; applications. J. Funct. Anal. 9, 208–248 (1972)
Benzi, M., Tůma, M.: Orderings for factorized sparse approximate inverse preconditioners. SIAM J. Sci. Comput. 21(5), 1851–1868 (electronic), 2000. Iterative methods for solving systems of algebraic equations (Copper Mountain, CO, 1998)
Binev, P.: Tree approximation for \(hp\)-adaptivity. (in preparation)
Binev, P.: Instance optimality for \(hp\)-type approximation. Technical Report 39, Mathematisches Forschungsinstitut Oberwolfach (2013)
Binev, P., Dahmen, W., DeVore, R.: Adaptive finite element methods with convergence rates. Numer. Math. 97(2), 219–268 (2004)
Bürg, M., Dörfler, W.: Convergence of an adaptive \(hp\) finite element strategy in higher space-dimensions. Appl. Numer. Math. 61(11), 1132–1146 (2011)
Canuto, C., Nochetto, R., Stevenson, R., Verani, M.: An \(hp\) adaptive finite element method: convergence and optimality properties. (in preparation)
Canuto, C., Nochetto, R., Verani, M.: Contraction and optimality properties of adaptive Legendre–Galerkin methods: the 1-dimensional case. Comput. Math. Appl. 67(4), 752–770 (2014)
Canuto, C., Nochetto, R.H., Verani, M.: Adaptive Fourier–Galerkin methods. Math. Comput. 83, 1645–1687 (2014)
Canuto, C., Simoncini, V., Verani, M.: On the decay of the inverse of matrices that are sum of Kronecker products. Linear Algebra Appl. 452, 21–39 (2014)
Canuto, C., Verani, M.: On the numerical analysis of adaptive spectral/hp methods for elliptic problems. In: Brezzi, F. et al. (eds.) Analysis and Numerics of Partial Differential Equations, pp. 165–192. Springer INdAM series (2013)
Cascon, J.M., Kreuzer, C., Nochetto, R.H., Siebert, K.G.: Quasi-optimal convergence rate for an adaptive finite element method. SIAM J. Numer. Anal. 46(5), 2524–2550 (2008)
Cohen, A., Dahmen, W., DeVore, R.: Adaptive wavelet methods for elliptic operator equations: convergence rates. Math. Comput. 70, 27–75 (1998)
Cohen, A., DeVore, R., Nochetto, R.H.: Convergence rates of AFEM with \(H^{-1}\) data. Found. Comput. Math. 12(5), 671–718 (2012)
Dörfler, W.: A convergent adaptive algorithm for Poisson’s equation. SIAM J. Numer. Anal. 33(3), 1106–1124 (1996)
Dörfler, W., Heuveline, V.: Convergence of an adaptive \(hp\) finite element strategy in one space dimension. Appl. Numer. Math. 57(10), 1108–1124 (2007)
Duff, I.S., Erisman, A.M., Reid, J.K.: Direct Methods for Sparse Matrices. Clarendon Press, Oxford (1989)
Golub, G.H., Van Loan, C.F.: Matrix Computations, 3rd edn. Johns Hopkins Studies in the Mathematical Sciences. Johns Hopkins University Press, Baltimore, MD (1996)
Gui, W., Babuška, I.: The \(h,\;p\) and \(h\)-\(p\) versions of the finite element method in 1 dimension. III. The adaptive \(h\)-\(p\) version. Numer. Math. 49(6), 659–683 (1986)
Hall, P., Jin, J.: Innovated higher criticism for detecting sparse signals in correlated noise. Ann. Stat. 38(3), 1686–1732 (2010)
Jaffard, S.: Propriétés des matrices “bien localisées” près de leur diagonale et quelques applications. Annales de l’I.H.P. 5, 461–476 (1990)
Krishtal, I., Strohmer, T., Wertz, T.: Localization of matrix factorizations (2013). arXiv:1305.1618
Maitre, J.-F., Pourquier, O.: Condition number and diagonal preconditioning: comparison of the \(p\)-version and the spectral element methods. Numer. Math. 74(1), 69–84 (1996)
Mitchell, W.F., McClain, M.A.: A survey of \(hp\)-adaptive strategies for elliptic partial differential equations. In: Recent Advances in Computational and Applied Mathematics, pp. 227–258. Springer, Dordrecht (2011)
Morin, P., Nochetto, R.H., Siebert, K.G.: Data oscillation and convergence of adaptive FEM. SIAM J. Numer. Anal. 38(2), 466–488 (2000). (electronic)
Nochetto, R.H., Siebert, K.G., Veeser, A.: Theory of adaptive finite element methods: an introduction. In: Multiscale, Nonlinear and Adaptive Approximation, pp. 409–542. Springer, Berlin (2009)
Schmidt, A., Siebert, K.G.: A posteriori estimators for the \(h\)-\(p\) version of the finite element method in 1D. Appl. Numer. Math. 35(1), 43–66 (2000)
Stevenson, R.: Optimality of a standard adaptive finite element method. Found. Comput. Math. 7(2), 245–269 (2007)
Stevenson, R.: Adaptive wavelet methods for solving operator equations: an overview. In: Multiscale, Nonlinear and Adaptive Approximation, pp. 543–597. Springer, Berlin (2009)
Acknowledgments
The authors would like to thank Michele Benzi for helpful discussions and for pointing to [23].
Author information
Authors and Affiliations
Corresponding author
Additional information
The first and third author have been partially supported by the Italian research grant Prin 2012 2012HBLYE4_004 “Metodologie innovative nella modellistica differenziale numerica”.
Appendix
Appendix
Proof
(Proof of Lemma 2 ) In the following we will make extensive use of the following property of the product of univariate Legendre polynomials (see, e.g., [1]):
with
and
Moreover we recall the following asymptotic estimates (see [9]):
-
Case \(0< r <\min (m,n)\):
$$\begin{aligned} \frac{A_{m-r} A_r A_{n-r}}{A_{n+m-r}}\sim \frac{1}{\pi } \frac{\sqrt{n+m-r}}{\sqrt{m-r}\sqrt{n-r}\sqrt{r}}\ ; \end{aligned}$$(5.2) -
Case \(r=0\):
$$\begin{aligned} \frac{A_{m} A_{n}}{A_{n+m}}\sim \frac{1}{\sqrt{\pi }} \frac{\sqrt{n+m}}{\sqrt{nm}} \ ; \end{aligned}$$(5.3) -
Case \(r=\min (m,n)\) and \(m\not = n\):
$$\begin{aligned} \frac{A_{\min (m,n)} A_{\vert m -n \vert }}{{{A_{\max (m,n)}}}}\sim \frac{1}{\sqrt{\pi }} \frac{\sqrt{\max (m,n)}}{\sqrt{\min (m,n)}\sqrt{\vert m -n \vert }}. \end{aligned}$$(5.4)When \(m=n\) it is sufficient to use \(A_0=1\) to get \(\frac{A_{m} A_{0}}{A_{m}}=1\).
We begin from the following expression:
We first estimate \(a^{(1)}_{mn}\). Let \(m=(m_1,m_2)\) and \(n=(n_1,n_2)\) then using the notation \(\nu :=\nu (x_1,x_2)\) and the relation \(\eta ^\prime _k(x_i)=-\sqrt{k-1/2} L_{k-1}(x_i)\), \(i=1,2\), we have
where we set
Let us focus on the first term \(J_1\). Straightforward calculations yield
For the ease of presentation we only show how to estimate \(J_1^1\) as the other terms can be worked out similarly. Employing (5.1) we obtain
Using the multidimensional Legendre expansion \(\nu (x)=\sum _{k\in \mathcal{K}} \nu _k L_k(x)\) we obtain
We now employ the asymptotic estimates (5.2)–(5.4) to bound the terms \(A_{m_1-2,n_1-2}^{r_1}\) and \(A_{m_2-2,n_2-2}^{r_2}\). Accordingly, we need to distinguish among several cases depending on the combination of the values assumed by \(r_1\) and \(r_2\). However, for the ease of reading, we only consider the case \(0<r_1<\min (m_1-2,n_1-2)\) and \(0<r_2<\min (m_2-2,n_2-2)\) as the other ones can be treated similarly. In this case, (5.2) yields
A similar estimate holds also for \(A_{m_2-2,n_2-2}^{r_2}\). Thus we have
Thus we have
Similar estimates can be obtained for the terms \(J_1^2,\ldots ,J_1^4\) yielding
Anaologously, we can prove the following estimate for the term \(J_2\)
Assuming \( \vert \nu _k \vert \le C_\eta e^{-\gamma \Vert k\Vert _{\ell ^{1}}}\) for every \(k\in \mathcal{K}\) and employing the above estimates for \(J_1\) and \(J_2\), we obtain
We now estimate \(a^{(0)}_{mn}\). Let \(m=(m_1,m_2)\) and \(n=(n_1,n_2)\) then recalling (2.2) and using the notation \(\sigma :=\sigma (x_1,x_2)\) we have
with \(C_m^n:=\frac{1}{\sqrt{(4m_1-1)(4m_2-1)(4n_1-1)(4n_2-1)}}\). Now employing (5.1) we obtain
We now need to estimate \(I_1,\ldots ,I_{16}\). To simplify the exposition, we only show how to estimate \(I_1\), as the other terms can be treated similarly.
Using the multidimensional Legendre expansion \(\sigma (x)=\sum _{k\in \mathcal{K}} \sigma _k L_k(x)\) together with (2.1) we get
We now employ the asymptotic estimates (5.2)–(5.4) to bound the terms \(A_{m_1-2,n_1-2}^{r_1}\) and \(A_{m_2-2,n_2-2}^{r_2}\). Accordingly, we need to distinguish among several cases depending on the combination of the values assumed by \(r_1\) and \(r_2\). However, for the ease of reading, we only consider the case \(0<r_1<\min (m_1-2,n_1-2)\) and \(0<r_2<\min (m_2-2,n_2-2)\) as the other ones can be treated similarly. In this case, (5.2) yields
A similar estimate holds also for \(A_{m_2-2,n_2-2}^{r_2}\). Hence, we have
Employing (5.3) and (5.4) yields similar estimates for the cases \(r_1=0,\min (m_1-2,n_1-2)\) and \(r_2=0,\min (m_2-2,n_2-2)\). In conclusion, we get
Similar estimates can be obtained for \(I_2,\ldots ,I_{16}\) thus yielding
Assuming \( \vert \sigma _k \vert \le C_\eta e^{-\gamma \Vert k\Vert _{\ell ^{1}}}\) for every \(k\in \mathcal{K}\) and employing the above estimate, we obtain
This concludes the proof. \(\square \)
Rights and permissions
About this article
Cite this article
Canuto, C., Simoncini, V. & Verani, M. Contraction and Optimality Properties of an Adaptive Legendre–Galerkin Method: The Multi-Dimensional Case. J Sci Comput 63, 769–798 (2015). https://doi.org/10.1007/s10915-014-9912-3
Received:
Accepted:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s10915-014-9912-3