Adaptive spectral Galerkin methods with dynamic marking

DOI10.1137/15M104579XMaRDI QIDQ2832140zbMATH OpenOpenAlexFDO

Authors C. Canuto, Ricardo H. Nochetto, Rob P. Stevenson, M. Verani

Publication date 7 November 2016

Published in SIAM Journal on Numerical Analysis (Search for Journal in Brave)

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

zbMATH Keywords

adaptivityconvergenceoptimal cardinalityspectral methods

Mathematics Subject Classification ID

Stability and convergence of numerical methods for boundary value problems involving PDEs (65N12) Finite element, Rayleigh-Ritz and Galerkin methods for boundary value problems involving PDEs (65N30) Spectral, collocation and related methods for boundary value problems involving PDEs (65N35) Mesh generation, refinement, and adaptive methods for boundary value problems involving PDEs (65N50)

Abstract: The convergence and optimality theory of adaptive Galerkin methods is almost exclusively based on the D"orfler marking. This entails a fixed parameter and leads to a contraction constant bounded below away from zero. For spectral Galerkin methods this is a severe limitation which affects performance. We present a dynamic marking strategy that allows for a super-linear relation between consecutive discretization errors, and show exponential convergence with linear computational complexity whenever the solution belongs to a Gevrey approximation class.

Recommendations

• Contraction and optimality properties of adaptive Legendre-Galerkin methods: the one-dimensional case
• Adaptive Fourier-Galerkin methods
• Contraction and optimality properties of an adaptive Legendre-Galerkin method: the multi-dimensional case
• scientific article; zbMATH DE number 5985657
• High-Order Adaptive Galerkin Methods

Cites work

• 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
• An optimal adaptive wavelet method without coarsening of the iterands
• Axioms of adaptivity
• Contraction and optimality properties of adaptive Legendre-Galerkin methods: the one-dimensional case
• Contraction and optimality properties of an adaptive Legendre-Galerkin method: the multi-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
• Data Oscillation and Convergence of Adaptive FEM
• High-Order Adaptive Galerkin Methods
• scientific article; zbMATH DE number 1227077 (Why is no real title available?)
• Instance optimality of the adaptive maximum strategy
• On the numerical analysis of adaptive spectral/hp methods for elliptic problems
• 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

Cited in

(5)

• Quantized tensor-structured finite elements for second-order elliptic PDEs in two dimensions
• Contraction and optimality properties of an adaptive Legendre-Galerkin method: the multi-dimensional case
• Contraction and optimality properties of adaptive Legendre-Galerkin methods: the one-dimensional case
• Adaptive Fourier-Galerkin methods
• Adaptive VEM: Stabilization-Free A Posteriori Error Analysis and Contraction Property

This page was built for publication: Adaptive spectral Galerkin methods with dynamic marking

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