Efficient preconditioning for the p-version finite element method in two dimensions
SIAM Journal on Numerical Analysis
A Mathematica version of Zeilberger's algorithm for proving binomial coefficient identities
Journal of Symbolic Computation - Special issue on symbolic computation in combinatorics
SIAM Journal on Numerical Analysis
Hierarchical hp finite elements in hybrid domains
Finite Elements in Analysis and Design - Special issue: Robert J. Melosh medal competition
Journal of Computational and Applied Mathematics
Multiresolution weighted norm equivalences and applications
Numerische Mathematik
Extension Operators on Tensor Product Structures in Two and Three Dimensions
SIAM Journal on Scientific Computing
Handbook of Mathematical Functions, With Formulas, Graphs, and Mathematical Tables,
Handbook of Mathematical Functions, With Formulas, Graphs, and Mathematical Tables,
New shape functions for triangular p-FEM using integrated Jacobi polynomials
Numerische Mathematik
Singularity-free evaluation of collapsed-coordinate orthogonal polynomials
ACM Transactions on Mathematical Software (TOMS)
An eigen-based high-order expansion basis for structured spectral elements
Journal of Computational Physics
Boundary concentrated finite elements for optimal boundary control problems of elliptic PDEs
Computational Optimization and Applications
Hi-index | 0.02 |
In this paper, we investigate the discretization of an ellipticboundary value problem in 3D by means of the hp-version ofthe finite element method using a mesh of tetrahedrons. We presentseveral bases based on integrated Jacobi polynomials in which theelement stiffness matrix has 𝒪(p3)nonzero entries, where p denotes the polynomial degree. Theproof of the sparsity requires the assistance of computer algebrasoftware. Several numerical experiments show the efficiency of theproposed bases for higher polynomial degrees p.