Volume 6, Issue 1 pp. 689-690
Section 15
Free Access

Hypergeometric Summation Techniques for High Order Finite Elements

V. Pillwein

V. Pillwein

SFB F013 Numerical and Symbolic Scientific Computing, J. Kepler University, Altenberger Str. 69, A–4040 Linz, Austria

Search for more papers by this author
P. Paule

P. Paule

RISC, J. Kepler University, Altenberger Str. 69, A–4040 Linz, Austria

Search for more papers by this author
C. Schneider

C. Schneider

RISC, J. Kepler University, Altenberger Str. 69, A–4040 Linz, Austria

Search for more papers by this author
J. Schöberl

J. Schöberl

SFB F013 Numerical and Symbolic Scientific Computing, J. Kepler University, Altenberger Str. 69, A–4040 Linz, Austria

Search for more papers by this author
First published: 23 January 2007
Citations: 5

Abstract

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. (© 2006 WILEY-VCH Verlag GmbH & Co. KGaA, Weinheim)

The full text of this article hosted at iucr.org is unavailable due to technical difficulties.