Sparsity optimized high order finite element functions for H(curl) on tetrahedra
Maxwell equations (35Q61) Finite element, Rayleigh-Ritz and Galerkin methods for boundary value problems involving PDEs (65N30) Symbolic computation and algebraic computation (68W30) Electromagnetic theory (general) (78A25) Finite element, Galerkin and related methods applied to problems in optics and electromagnetic theory (78M10)
The paper is concerned with the construction of sparsity basis functions for \(H\)(curl) Sobolev-type spaces. These optimized basis are mainly defined by using Jacobi-type polynomials and means over general tetrahedra. The first part deals with the variational formulation for Maxwell's equations, in relationship with the finite element method and the function space \(H\)(curl). Next, the authors define the basis functions on a general three-dimensional simplex. Sparsity optimization of high-order basis functions on simplices relies on using particularly chosen Jacobi-type polynomials and some of their basic properties that are introduced in the next section. In the following, the algorithm is described that evaluates the integrals which yield the entries of the inner blocks of the local system matrices. This is done by using Mathematica, and a rewriting procedure is used to explicitly evaluate the inner products.
- Sparsity Optimized High Order Finite Element Functions on Simplices
- Sparsity optimized high order finite element functions for H(div) on simplices
- Fully hierarchical divergence-conforming basis functions on tetrahedral cells, with applications
- Hierarchic finite element bases on unstructured tetrahedral meshes
- Sparse shape functions for tetrahedral \(p\)-FEM using integrated Jacobi polynomials
- A holonomic systems approach to special functions identities
- A new family of mixed finite elements in \({\mathbb{R}}^ 3\)
- An algebraic multigrid method for finite element discretizations with edge elements
- An algorithm for finding the basis elements of the residue class ring of a zero dimensional polynomial ideal
- An extension of Zeilberger's fast algorithm to general holonomic functions
- Computational Electromagnetics
- Computing with hp-ADAPTIVE FINITE ELEMENTS
- Condition number and diagonal preconditioning: Comparison of the \(p\)-version and the spectral element methods
- Finite elements in computational electromagnetism
- GFUN
- Hierarchal vector basis functions of arbitrary order for triangular and tetrahedral finite elements
- Hierarchic finite element bases on unstructured tetrahedral meshes
- High order Nédélec elements with local complete sequence properties
- scientific article; zbMATH DE number 1574099 (Why is no real title available?)
- scientific article; zbMATH DE number 5282905 (Why is no real title available?)
- scientific article; zbMATH DE number 50534 (Why is no real title available?)
- scientific article; zbMATH DE number 3596197 (Why is no real title available?)
- scientific article; zbMATH DE number 1227077 (Why is no real title available?)
- scientific article; zbMATH DE number 1266750 (Why is no real title available?)
- scientific article; zbMATH DE number 1163416 (Why is no real title available?)
- scientific article; zbMATH DE number 1480202 (Why is no real title available?)
- scientific article; zbMATH DE number 3273551 (Why is no real title available?)
- scientific article; zbMATH DE number 3111288 (Why is no real title available?)
- Mixed finite elements in \(\mathbb{R}^3\)
- Multigrid in H(div) and H(curl)
- Multigrid Method for Maxwell's Equations
- New shape functions for triangular \(p\)-FEM using integrated Jacobi polynomials
- Nédélec spaces in affine coordinates
- Sparse shape functions for tetrahedral \(p\)-FEM using integrated Jacobi polynomials
- Sparsity optimized high order finite element functions for H(div) on simplices
- Sparsity Optimized High Order Finite Element Functions on Simplices
- SumCracker: A package for manipulating symbolic sums and related objects
- Symbolic summation assists combinatorics
- The $h{\text{ - }}p$ Version of the Finite Element Method for Domains with Curved Boundaries
- Bernstein-Bézier bases for tetrahedral finite elements
- Orientation embedded high order shape functions for the exact sequence elements of all shapes
- Explicit geometric construction of \textit{sparse inverse mass matrices} for arbitrary tetrahedral grids
- On basis constructions in finite element exterior calculus
- Sparse shape functions for tetrahedral \(p\)-FEM using integrated Jacobi polynomials
- Sparsity Optimized High Order Finite Element Functions on Simplices
- Sparsity optimized high order finite element functions for H(div) on simplices
- Spectral equivalence of low-order discretizations for high-order \(H(\mathrm{curl})\) and \(H(\div)\) spaces
- High-order finite elements in numerical electromagnetism: degrees of freedom and generators in duality
- Creative telescoping for holonomic functions
- High order Nédélec elements with local complete sequence properties
- Novel Raviart-Thomas basis functions on anisotropic finite elements
- High order biorthogonal functions in \(H(\mathrm{curl})\)
- A priori verification method for curl-conforming basis functions in simplices
- D-finiteness: a success story
- High order biorthogonal functions for the discrete de Rham complex on simplices*
- Generation of higher-order polynomial basis of Nédélec H(curl) finite elements for Maxwell's equations
This page was built for publication: Sparsity optimized high order finite element functions for \(H(\mathrm{curl})\) on tetrahedra
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q394759)
