Contraction and optimality properties of an adaptive Legendre-Galerkin method: the multi-dimensional case
From MaRDI portal
Publication:2355484
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/ discretizations of elliptic boundary-value problems. The main contribution of the paper is a careful construction of a multidimensional Riesz basis in , 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.
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
- scientific article; zbMATH DE number 194668 (Why is no real title available?)
- 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 Fourier-Galerkin methods
- Adaptive finite element methods with convergence rates
- 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
- 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)- Matrix equation solving of PDEs in polygonal domains using conformal mappings
- Contraction property of adaptive hybridizable discontinuous Galerkin methods
- 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
- Adaptive Fourier-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
- Convergence and optimality of \({\mathbf {hp}}\)-\textbf{AFEM}
- High-Order Adaptive Galerkin Methods
- Adaptive spectral Galerkin methods with dynamic marking
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)
