Optimal multilevel adaptive FEM for the Argyris element
From MaRDI portal
Publication:2674087
DOI10.1016/j.cma.2022.115352OpenAlexW4285891086MaRDI QIDQ2674087
Publication date: 22 September 2022
Published in: Computer Methods in Applied Mechanics and Engineering (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2203.03975
adaptive algorithmoptimal convergencelinear time complexityArgyris elementa posteriorimultilevel preconditioning
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Axioms of adaptivity
- On 2D newest vertex bisection: optimality of mesh-closure and \(H ^{1}\)-stability of \(L _{2}\)-projection
- An optimal Poincaré inequality for convex domains
- Uniform convergence of multigrid V-cycle on adaptively refined finite element meshes for second order elliptic problems
- Gagliardo-Nirenberg inequalities and non-inequalities: the full story
- Constants in discrete Poincaré and Friedrichs inequalities and discrete quasi-interpolation
- Hierarchical Argyris finite element method for adaptive and multigrid algorithms
- A discrete Helmholtz decomposition with morley finite element functions and the optimality of adaptive finite element schemes
- A survey on boundary conditions for the biharmonic
- On the Complexity of Sparse $QR$ and $LU$ Factorization of Finite-Element Matrices
- On the boundary value problem of the biharmonic operator on domains with angular corners
- The Analysis of Smoothers for Multigrid Algorithms
- The method of alternating projections and the method of subspace corrections in Hilbert space
- Hermite interpolation of nonsmooth functions preserving boundary conditions
- Axioms of Adaptivity with Separate Marking for Data Resolution
- Multigrid methods for the biharmonic problem discretized by conformingC1finite elements on nonnested meshes∗
- A general approach to transforming finite elements
- Rate optimality of adaptive finite element methods with respect to overall computational costs
- Dörfler marking with minimal cardinality is a linear complexity problem
- The completion of locally refined simplicial partitions created by bisection
- The Mathematical Theory of Finite Element Methods