Contraction and optimality properties of an adaptive Legendre-Galerkin method: the multi-dimensional case

DOI10.1007/S10915-014-9912-3MaRDI QIDQ2355484zbMATH OpenOpenAlexFDO

Authors C. Canuto, Valeria Simoncini, M. Verani

Publication date 23 July 2015

Published in Journal of Scientific Computing (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/1408.0030

zbMATH Keywords

adaptivityconvergenceDirichlet problemelliptic equationGalerkin methodoptimalityRiesz basisspectral elements

Mathematics Subject Classification ID

Boundary value problems for second-order elliptic equations (35J25) Error bounds for boundary value problems involving PDEs (65N15) Finite element, Rayleigh-Ritz and Galerkin methods for boundary value problems involving PDEs (65N30)

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.

Review text

The present paper constructs an approximate method to solve the Dirichlet problem for the elliptic equation in \(\Omega =[0,1]^{2}\) \[ -\nabla (\nu \nabla u)+ \sigma u = f \quad \text{in} \quad \Omega, \quad u= 0 \quad \text{on} \quad\partial \Omega , \] where \( \nu, \sigma \) are sufficiently smooth coefficients, \( f\in H^{-1}(\Omega)\). For this problem formulated in variational form \[ a(u,v) = (f,v) \quad\forall v\in H_{0}^{1}(\Omega), \] the Galerkin method is applied, using the system of basis functions of Babuška-Shen \(\eta_{k}(x)\), whose elements are defined by the system of Legendre polynomials. The obtained approximate solutions have the contraction property.

Recommendations

• Contraction and optimality properties of adaptive Legendre-Galerkin methods: the one-dimensional case
• Adaptive spectral Galerkin methods with dynamic marking
• Adaptive Fourier-Galerkin methods
• High-Order Adaptive Galerkin Methods
• Convergence and rate optimality of adaptive multilevel stochastic Galerkin FEM

Cites work

• A Convergent Adaptive Algorithm for Poisson’s Equation
• A posteriori estimators for the h-p version of the finite element method in 1D
• A survwey of hp-adaptive strategies for elliptic partial differential equations
• Adaptive finite element methods with convergence rates
• Adaptive Fourier-Galerkin methods
• Adaptive wavelet methods for elliptic operator equations: Convergence rates
• Adaptive wavelet methods for solving operator equations: An overview
• Condition number and diagonal preconditioning: Comparison of the \(p\)-version and the spectral element methods
• Contraction and optimality properties of adaptive Legendre-Galerkin methods: the one-dimensional case
• Convergence and optimality of \({\mathbf {hp}}\)-\textbf{AFEM}
• Convergence of an adaptive \( hp\) finite element strategy in one space dimension
• Convergence of an adaptive hp finite element strategy in higher space-dimensions
• Convergence rates of AFEM with \(H^{-1}\) data
• Data Oscillation and Convergence of Adaptive FEM
• scientific article; zbMATH DE number 194668 (Why is no real title available?)
• Innovated higher criticism for detecting sparse signals in correlated noise
• Localization of matrix factorizations
• On the decay of the inverse of matrices that are sum of Kronecker products
• On the numerical analysis of adaptive spectral/hp methods for elliptic problems
• Optimality of a standard adaptive finite element method
• Orderings for Factorized Sparse Approximate Inverse Preconditioners
• Propriétés des matrices ``bien localisées près de leur diagonale et quelques applications. (Properties of matrices ``well localized near the diagonal and some applications)
• Quasi-Optimal Convergence Rate for an Adaptive Finite Element Method
• Régularité analytique et iterés d'opérateurs elliptiques dégénérées; applications
• The h, p and h-p versions of the finite element method in 1 dimension. III. The adaptive h-p version
• Theory of adaptive finite element methods: An introduction
• Tree approximation for hp-adaptivity

Cited in

(11)

• On the decay of the inverse of matrices that are sum of Kronecker products
• Matrix equation solving of PDEs in polygonal domains using conformal mappings
• Contraction property of adaptive hybridizable discontinuous Galerkin methods
• High-Order Adaptive Galerkin Methods
• Adaptive spectral Galerkin methods with dynamic marking
• Decay bounds for functions of Hermitian matrices with banded or Kronecker structure
• Localization in matrix computations: theory and applications
• Contraction and optimality properties of adaptive Legendre-Galerkin methods: the one-dimensional case
• Convergence and optimality of \({\mathbf {hp}}\)-\textbf{AFEM}
• The Legendre Galerkin Chebyshev collocation least squares for the elliptic problem
• Adaptive Fourier-Galerkin methods

This page was built for publication: Contraction and optimality properties of an adaptive Legendre-Galerkin method: the multi-dimensional case

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2355484)