Hypergeometric summation techniques for high order finite elements

The goal of this paper is to discuss the application of computer algebra methods in the design of a high order finite element solver. The finite element method is nowadays the most popular method for the computer simulation of partial differential equations. The performance of iterative solution methods depends on the condition number of the system matrix, which itself depends on the chosen basis functions. A major goal is to design basis functions minimizing the condition number, and which can be implemented efficiently. A related goal is the application of symbolic summation techniques to derive cheap recurrence relations allowing a simple and efficient implementation of basis functions

Hypergeometric summation algorithms for high order finite elements

High order finite elements are usually defined by means of certain orthogonal polynomials. The performance of iterative solution methods depends on the condition number of the system matrix, which itself depends on the chosen basis functions. The goal is now to design basis functions minimizing the condition number, and which can be computed efficiently. In this paper we demonstrate the application of recently developed computer algebra algorithms for hypergeometric summation to derive cheap recurrence relations allowing a simple implementation for fast basis function evaluation