Hypergeometric Summation Algorithms for High-order Finite Elements |
| |
| Authors: | A. Bećirović P. Paule V. Pillwein A. Riese C. Schneider J. Schöberl |
| |
| Affiliation: | (1) FWF Start-Projekt Y-192 ``3D hp Finite Elemente', Johann Radon Institute for Computational and Applied Mathematics (RICAM), J. Kepler University, Altenberger Str. 69, 4040 Linz, Austria;(2) RISC, J. Kepler University, Altenberger Str. 69, 4040 Linz, Austria;(3) SFB F013 Numerical and Symbolic Scientific Computing, J. Kepler University, Altenberger Str. 69, 4040 Linz, Austria;(4) Johann Radon Institute for Computational and Applied Mathematics (RICAM), J. Kepler University Linz, Altenberger Str. 69, 4040 Linz, Austria |
| |
| Abstract: | 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. |
| |
| Keywords: | 65N30 33F10 33C45 65Q05 |
| 本文献已被 SpringerLink 等数据库收录！ |
|
