Adaptive Fourier-Galerkin methods
From MaRDI portal
Abstract: We study the performance of adaptive Fourier-Galerkin methods in a periodic box in with dimension . These methods offer unlimited approximation power only restricted by solution and data regularity. They are of intrinsic interest but are also a first step towards understanding adaptivity for the -FEM. We examine two nonlinear approximation classes, one classical corresponding to algebraic decay of Fourier coefficients and another associated with exponential decay. We study the sparsity classes of the residual and show that they are the same as the solution for the algebraic class but not for the exponential one. This possible sparsity degradation for the exponential class can be compensated with coarsening, which we discuss in detail. We present several adaptive Fourier algorithms, and prove their contraction and optimal cardinality properties.
Recommendations
- High-Order Adaptive Galerkin Methods
- Contraction and optimality properties of adaptive Legendre-Galerkin methods: the one-dimensional case
- Adaptive spectral Galerkin methods with dynamic marking
- Computation of adaptive Fourier series by sparse approximation of exponential sums
- Contraction and optimality properties of an adaptive Legendre-Galerkin method: the multi-dimensional case
Cites work
- A Convergent Adaptive Algorithm for Poisson’s Equation
- Adaptive finite element methods with convergence rates
- Adaptive frame methods for elliptic operator equations
- 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
- Convergence rates for greedy algorithms in reduced basis methods
- Convergence rates of AFEM with \(H^{-1}\) data
- Data Oscillation and Convergence of Adaptive FEM
- Gevrey class regularity for the solutions of the Navier-Stokes equations
- scientific article; zbMATH DE number 1215245 (Why is no real title available?)
- scientific article; zbMATH DE number 1227077 (Why is no real title available?)
- scientific article; zbMATH DE number 2001584 (Why is no real title available?)
- scientific article; zbMATH DE number 2107175 (Why is no real title available?)
- Introduction to large truncated Toeplitz matrices
- Nonlinear approximation by trigonometric sums
- Optimal adaptive computations in the Jaffard algebra and localized frames
- Optimality of a standard adaptive finite element method
- 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
- Spectral Methods
- Theory of adaptive finite element methods: An introduction
Cited in
(8)- Computation of adaptive Fourier series by sparse approximation of exponential sums
- Contraction and optimality properties of an adaptive Legendre-Galerkin method: the multi-dimensional case
- High-Order Adaptive Galerkin Methods
- Adaptive spectral Galerkin methods with dynamic marking
- Contraction and optimality properties of adaptive Legendre-Galerkin methods: the one-dimensional case
- Multi-Adaptive Galerkin Methods for ODEs I
- Convergence and optimality of \({\mathbf {hp}}\)-\textbf{AFEM}
- An adaptive planewave method for electronic structure calculations
This page was built for publication: Adaptive Fourier-Galerkin methods
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5418483)
