Sparse shape functions for tetrahedral \(p\)-FEM using integrated Jacobi polynomials

DOI10.1007/s00607-007-0236-0zbMath1172.65384OpenAlexW2036180306MaRDI QIDQ2457943

Sven Beuchler, Veronika Pillwein

Publication date: 24 October 2007

Published in: Computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00607-007-0236-0

zbMATH Keywords

finite element methodorthogonal polynomialsnumerical experimentspreconditioningcomputer algebraelliptic boundary value problemhigh-order finite elementssolution of discretized equations

Mathematics Subject Classification ID

Symbolic computation and algebraic computation (68W30) Boundary value problems for second-order elliptic equations (35J25) Finite element, Rayleigh-Ritz and Galerkin methods for boundary value problems involving PDEs (65N30) Iterative numerical methods for linear systems (65F10) Numerical computation of matrix norms, conditioning, scaling (65F35)

Related Items

Sparsity optimized high order finite element functions for \(H(\mathrm{curl})\) on tetrahedra, Improved p‐version finite element matrix conditioning using semi‐orthogonal modal approximation functions, An eigen-based high-order expansion basis for structured spectral elements, Boundary concentrated finite elements for optimal boundary control problems of elliptic PDEs, Sparsity optimized high order finite element functions for H(div) on simplices, Sparse shape functions for tetrahedral \(p\)-FEM using integrated Jacobi polynomials, Iterated integrals of Jacobi polynomials, Orientation embedded high order shape functions for the exact sequence elements of all shapes, Creative Telescoping for Holonomic Functions, Sparse spectral-Galerkin method on an arbitrary tetrahedron using generalized Koornwinder polynomials

Uses Software

• SumCracker

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Hypergeometric summation algorithms for high-order finite elements
• Spectral methods for problems in complex geometries
• Preconditioning of the \(p\)-version of the finite element method
• An iterative and parallel solver based on domain decomposition for the \(h-p\) version of the finite element method
• Hierarchical \(hp\) finite elements in hybrid domains
• An additive Schwarz preconditioner for \(p\)-version boundary element approximation of the hypersingular operator in three dimensions
• Multiresolution weighted norm equivalencies and applications
• A \textit{Mathematica} version of Zeilberger's algorithm for proving binomial coefficient identities
• SumCracker: A package for manipulating symbolic sums and related objects
• Sparse shape functions for tetrahedral \(p\)-FEM using integrated Jacobi polynomials
• New shape functions for triangular \(p\)-FEM using integrated Jacobi polynomials
• Polynomial Liftings on a Tetrahedron and Applications to the h-p Version of the Finite Element Method in Three Dimensions
• The problem of selecting the shape functions for ap-type finite element
• Explicit polynomial preserving trace liftings on a triangle
• Generalized Nested Dissection
• Quadrature Over a Pyramid or Cube of Integrands with a Singularity at a Vertex
• Efficient Preconditioning for thep-Version Finite Element Method in Two Dimensions
• Hierarchic finite element bases on unstructured tetrahedral meshes
• On Fast Domain Decomposition Solving Procedures for hp-Discretizations of 3-D Elliptic Problems
• A new triangular and tetrahedral basis for high‐order (hp) finite element methods
• Extension Operators on Tensor Product Structures in Two and Three Dimensions
• Nested Dissection of a Regular Finite Element Mesh
• Fully discrete \(hp\)-finite elements: Fast quadrature