Approximation properties of a gradient recovery operator using a biorthogonal system
From MaRDI portal
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) Mesh generation, refinement, and adaptive methods for boundary value problems involving PDEs (65N50)
Abstract: A gradient recovery operator based on projecting the discrete gradient onto the standard finite element space is considered. We use an oblique projection, where the test and trial spaces are different, and the bases of these two spaces form a biorthogonal system. Biorthogonality allows efficient computation of the recovery operator.We analyse the approximation properties of the gradient recovery operator.
Recommendations
- Publication:4860565
- Greedy approximation for biorthogonal systems in quasi-Banach spaces
- A gradient recovery operator based on an oblique projection
- Greedy algorithms and best \(m\)-term approximation with respect to biorthogonal systems
- scientific article; zbMATH DE number 7401746
- A finite element method for a biharmonic equation based on gradient recovery operators
- Analysis of the finite precision bi-conjugate gradient algorithm for nonsymmetric linear systems
- Enhancing Eigenvalue Approximation by Gradient Recovery
- scientific article; zbMATH DE number 1259478
- Orthogonality constrained gradient reconstruction for superconvergent linear functionals
Cites work
- scientific article; zbMATH DE number 1276034 (Why is no real title available?)
- A Posteriori Error Estimates Based on the Polynomial Preserving Recovery
- A gradient recovery operator based on an oblique projection
- A posteriori error estimation in finite element analysis
- A stabilized mixed finite element method for the biharmonic equation based on biorthogonal systems
- Analysis of recovery type a posteriori error estimators for mildly structured grids
- Asymptotically Exact A Posteriori Error Estimators, Part I: Grids with Superconvergence
- Discretization methods and iterative solvers based on domain decomposition
- Pointwise superconvergence of the gradient for the linear tetrahedral element
- Superconvergence of quadratic finite elements on mildly structured grids
- Superconvergence of tetrahedral linear finite element
- The superconvergent patch recovery anda posteriori error estimates. Part 1: The recovery technique
- The superconvergent patch recovery anda posteriori error estimates. Part 2: Error estimates and adaptivity
- Three-dimensional finite element superconvergent gradient recovery on Par6 patterns
- Ultraconvergence of the patch recovery technique II
- Ultraconvergence of the patch recovery technique
Cited in
(2)
This page was built for publication: Approximation properties of a gradient recovery operator using a biorthogonal system
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q277974)