Fast simplicial finite element algorithms using Bernstein polynomials

DOI10.1007/s00211-010-0327-2zbMath1211.65156MaRDI QIDQ2431102

Robert C. Kirby

Publication date: 8 April 2011

Published in: Numerische Mathematik (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00211-010-0327-2

zbMATH Keywords

algorithms; numerical examples; finite element; stiffness matrix; Bernstein basis; mass matrices; asymptotic complexity

Mathematics Subject Classification ID

35J25: Boundary value problems for second-order elliptic equations

65N30: Finite element, Rayleigh-Ritz and Galerkin methods for boundary value problems involving PDEs

65Y20: Complexity and performance of numerical algorithms

Uses Software

• DOLFIN

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Geometric decompositions and local bases for spaces of finite element differential forms
• A diagonal-mass-matrix triangular-spectral-element method based on cubature points
• Isogeometric analysis: CAD, finite elements, NURBS, exact geometry and mesh refinement
• Computing bivariate splines in scattered data fitting and the finite-element method
• Spectral elements for transport-dominated equations
• Nodal high-order methods on unstructured grids. I: Time-domain solution of Maxwell's equations
• Assessment of finite and spectral element shape functions for efficient iterative simulations of interior acoustics
• DOLFIN
• Finite element exterior calculus, homological techniques, and applications
• NURBS‐enhanced finite element method for Euler equations
• Spline Functions on Triangulations
• NURBS-enhanced finite element method (NEFEM)
• Spectral/hp Element Methods for Computational Fluid Dynamics