Unsymmetric multi-level hanging nodes and anisotropic polynomial degrees in \(H^1\)-conforming higher-order finite element methods

DOI10.1016/j.camwa.2017.02.029zbMath1373.65081OpenAlexW2600485508MaRDI QIDQ2403738

Andreas Byfut, Andreas Schröder

Publication date: 12 September 2017

Published in: Computers \& Mathematics with Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.camwa.2017.02.029

zbMATH Keywords

algorithmnumerical resulthigher-order finite element methodconstrained approximationorientation problemserendipity spacesanisotropic \(hp\)-refinementmulti-level hanging nodes

Mathematics Subject Classification ID

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)

Related Items (max. 100)

Hybridization and stabilization for \textit{hp}-finite element methods ⋮ Error Control and Adaptivity for the Finite Cell Method ⋮ Spline‐ and hp‐basis functions of higher differentiability in the finite cell method ⋮ \(hp\)-FEM for a stabilized three-field formulation of the biharmonic problem ⋮ Dual weighted residual error estimation for the finite cell method

Uses Software

• Concepts
• HP90
• Boost C++ Libraries
• SuiteSparse
• MTL4
• Boost
• FEAPpv
• OpenBLAS
• PGFPlots

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• The serendipity family of finite elements
• Static condensation, partial orthogonalization of basis functions, and ILU preconditioning in the \(hp\)-FEM
• A fully automatic \(hp\)-adaptivity for elliptic PDEs in three dimensions
• The treatment of nonhomogeneous Dirichlet boundary conditions by the p- version of the finite element method
• Spectral methods for problems in complex geometries
• Aspects of an adaptive \(hp\)-finite element method: Adaptive strategy, conforming approximation and efficient solvers
• HP90: A general and flexible Fortran 90 \(hp\)-FE code
• The h, p and h-p versions of the finite element method in 1 dimension. II. The error analysis of the h- and h-p versions
• A recursive approach to local mesh refinement in two and three dimensions
• Tetrahedral grid refinement
• About the conditioning of matrices in the \(p\)-version of the finite element method for second order elliptic problems
• Orientation embedded high order shape functions for the exact sequence elements of all shapes
• Multi-level \(hp\)-adaptivity: high-order mesh adaptivity without the difficulties of constraining hanging nodes
• Fully automatic \(hp\)-adaptivity in three dimensions
• Arbitrary-level hanging nodes and automatic adaptivity in the \(hp\)-FEM
• Arbitrary-level hanging nodes for adaptive \(hp\)-FEM approximations in 3D
• Constrained Approximation in hp-FEM: Unsymmetric Subdivisions and Multi-Level Hanging Nodes
• A local error analysis of the boundary-concentrated hp-FEM
• Local mesh refinement in 2 and 3 dimensions
• A finite element for transition from a fine to a coarse grid
• Concepts—An Object-Oriented Software Package for Partial Differential Equations
• Object oriented design philosophy for scientific computing
• A Block Algorithm for Matrix 1-Norm Estimation, with an Application to 1-Norm Pseudospectra
• Approximation by quadrilateral finite elements
• Exponential convergence for hp-version and spectral finite element methods for elliptic problems in polyhedra
• Computing with hp-ADAPTIVE FINITE ELEMENTS
• The completion of locally refined simplicial partitions created by bisection
• Computing with hp-ADAPTIVE FINITE ELEMENTS
• Constraints Coefficients in hp-FEM
• On completeness of shape functions for finite element analysis
• Fully discrete \(hp\)-finite elements: Fast quadrature

This page was built for publication: Unsymmetric multi-level hanging nodes and anisotropic polynomial degrees in \(H^1\)-conforming higher-order finite element methods