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

DOI10.1007/S10915-014-9912-3zbMATH Open1325.65151arXiv1408.0030OpenAlexW2128792640MaRDI QIDQ2355484FDOQ2355484

Authors: C. Canuto, Valeria Simoncini, M. Verani 

Publication date: 23 July 2015

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

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.

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

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

zbMATH Keywords

convergenceoptimalityDirichlet problemelliptic equationGalerkin methodRiesz basisadaptivityspectral 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)

Cites Work

• Title not available (Why is that?)
• 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)
• Localization of matrix factorizations
• Innovated higher criticism for detecting sparse signals in correlated noise
• Data Oscillation and Convergence of Adaptive FEM
• Adaptive wavelet methods for elliptic operator equations: Convergence rates
• A Convergent Adaptive Algorithm for Poisson’s Equation
• Adaptive finite element methods with convergence rates
• Optimality of a standard adaptive finite element method
• Quasi-Optimal Convergence Rate for an Adaptive Finite Element Method
• Theory of adaptive finite element methods: An introduction
• Convergence of an adaptive \( hp\) finite element strategy in one space dimension
• A posteriori estimators for the \(h\)-\(p\) version of the finite element method in 1D
• Convergence rates of AFEM with \(H^{-1}\) data
• Régularité analytique et iterés d'opérateurs elliptiques dégénérées; applications
• On the numerical analysis of adaptive spectral/\(hp\) methods for elliptic problems
• Contraction and optimality properties of adaptive Legendre-Galerkin methods: the one-dimensional case
• Adaptive wavelet methods for solving operator equations: An overview
• Adaptive Fourier-Galerkin methods
• Convergence of an adaptive \(hp\) finite element strategy in higher space-dimensions
• The h, p and h-p versions of the finite element method in 1 dimension. III. The adaptive h-p version
• A survwey of \(hp\)-adaptive strategies for elliptic partial differential equations
• Condition number and diagonal preconditioning: Comparison of the \(p\)-version and the spectral element methods
• On the decay of the inverse of matrices that are sum of Kronecker products
• Tree approximation for hp-adaptivity
• Convergence and optimality of \({\mathbf {hp}}\)-\textbf{AFEM}

Cited In (11)

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

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)