Skip to main content
Log in

Hypergeometric Summation Algorithms for High-order Finite Elements

  • Published:
Computing Aims and scope Submit manuscript

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.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Similar content being viewed by others

References

  • Andrews, G. E., Askey, R. Roy, R.: Special functions. Cambridge UP, 2000.

  • Andrews, G. E., Paule, P., Schneider, C.: Plane partitions VI: Stembridge' s TSPP theorem. Adv. Appl. Math. Special Issue dedicated to Dr. David P. Robbins (Bressoud, D., ed.), 34(4), 709–739 (2005).

  • I. Babuska A. W. Craig J. Mandel J. Pitkäranta (1991) ArticleTitleEfficient preconditioning for the p version of the finite element method in SIAM J. Numer. Anal. 28 624–661 Occurrence Handle0754.65083 Occurrence Handle1098410 Occurrence Handle10.1137/0728034

    Article  MATH  MathSciNet  Google Scholar 

  • Beuchler, S., Schöberl, J.: Extension operators on tensor product structures in 2D and 3D. Appl. Numer. Math. (available online November 2004).

  • D. Braess (2003) Finite Elemente: Theorie, schnelle Löser und Anwendungen in der Elastizitätstheorie EditionNumber3 Springer Berlin Heidelberg

    Google Scholar 

  • Brenner, S. C., Scott, L. R.: The mathematical theory of finite element methods. Texts in Applied Mathematics, vol. 15. New York: Springer, 2nd ed. 2002.

  • Pechstein, C., Schöberl, J., Melenk, J., Zaglmayr, S.: Additive Schwarz preconditioning for p-version triangular and tetrahedral finite elements. IMA J. Numer. Anal. (2005) (submitted).

  • Mallinger, C.: Algorithmic manipulations and transformations of univariate holonomic functions and sequences. Master's thesis, RISC, J. Kepler University, Linz, Austria, August 1996.

  • R. Muñoz-Sola (1997) ArticleTitlePolynomial liftings on a tetrahedron and applications to the hp-version of the finite element method in three dimensions SIAM J. Numer. Anal. 34 IssueID1 282–314 Occurrence Handle0871.46016 Occurrence Handle1445738 Occurrence Handle10.1137/S0036142994267552

    Article  MATH  MathSciNet  Google Scholar 

  • M. Petkovšek H. S. Wilf D. Zeilberger (1996) A=B A. K. Peters Wellesley, MA

    Google Scholar 

  • B. Salvy P. Zimmermann (1994) ArticleTitleGfun: A package for the manipulation of generating and holonomic functions in one variable ACM Trans. Math. Software 20 163–177 Occurrence Handle0888.65010 Occurrence Handle10.1145/178365.178368

    Article  MATH  Google Scholar 

  • Schneider, C.: A new Sigma approach to multi-summation. Adv. Appl. Math. Special Issue dedicated to Dr. David P. Robbins. (Bressoud, D., ed.), 34(4), 740–767 (2005).

  • Ch. Schwab (1998) p- and hp- finite element methods: theory and applications in solid and fluid mechanics. Numerical Mathematics and Scientific Computation Oxford University Press Oxford

    Google Scholar 

  • B. Szabo I. Babuska (1991) Finite element analysis Wiley New York Occurrence Handle0792.73003

    MATH  Google Scholar 

  • T. C. Warburton S. J. Sherwin G. E. Karniadakis (1999) ArticleTitleBasis functions for triangular and quadrilateral high-order elements SIAM J. Sci. Comput. 20 IssueID4 1671–1695 Occurrence Handle0930.35016 Occurrence Handle1694678 Occurrence Handle10.1137/S1064827597315716

    Article  MATH  MathSciNet  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to A. Bećirović.

Additional information

A. Bećirović and J. Schöberl are supported by the Austrian Science Foundation FWF, Start-Project Y 192, V. Pillwein and A. Riese by SFB grants F1301 and F1305 of the Austrian Science Foundation FWF, C. Schneider by FWF grant P16613-N12.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Bećirović, A., Paule, P., Pillwein, V. et al. Hypergeometric Summation Algorithms for High-order Finite Elements. Computing 78, 235–249 (2006). https://doi.org/10.1007/s00607-006-0179-x

Download citation

  • Received:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s00607-006-0179-x

AMS Subject Classifications

Keywords

Navigation