Recursion Formulas for Integrated Products of Jacobi Polynomials

Research output: Contribution to journalArticleResearchpeer review

Authors

  • Sven Beuchler
  • Tim Haubold
  • Veronika Pillwein

External Research Organisations

  • Johannes Kepler University of Linz (JKU)
View graph of relations

Details

Original languageEnglish
JournalConstructive approximation
Early online date27 May 2023
Publication statusE-pub ahead of print - 27 May 2023

Abstract

From the literature it is known that orthogonal polynomials as the Jacobi polynomials can be expressed by hypergeometric series. In this paper, the authors derive several contiguous relations for terminating multivariate hypergeometric series. With these contiguous relations one can prove several recursion formulas of those series. This theoretical result allows to compute integrals over products of Jacobi polynomials in a very efficient recursive way. Moreover, the authors present an application to numerical analysis where it can be used in algorithms which compute the approximate solution of boundary value problem of partial differential equations by means of the finite elements method. With the aid of the contiguous relations, the approximate solution can be computed much faster than using numerical integration. A numerical example illustrates this effect.

Keywords

    High order finite element methods, Hypergeometric function, Orthogonal polynomials, Recurrence equations

ASJC Scopus subject areas

Cite this

Recursion Formulas for Integrated Products of Jacobi Polynomials. / Beuchler, Sven; Haubold, Tim; Pillwein, Veronika.
In: Constructive approximation, 27.05.2023.

Research output: Contribution to journalArticleResearchpeer review

Beuchler S, Haubold T, Pillwein V. Recursion Formulas for Integrated Products of Jacobi Polynomials. Constructive approximation. 2023 May 27. Epub 2023 May 27. doi: 10.48550/arXiv.2105.08989, 10.1007/s00365-023-09655-z
Beuchler, Sven ; Haubold, Tim ; Pillwein, Veronika. / Recursion Formulas for Integrated Products of Jacobi Polynomials. In: Constructive approximation. 2023.
Download
@article{d8e1e9735eaf4fabbcef65855386e8f1,
title = "Recursion Formulas for Integrated Products of Jacobi Polynomials",
abstract = "From the literature it is known that orthogonal polynomials as the Jacobi polynomials can be expressed by hypergeometric series. In this paper, the authors derive several contiguous relations for terminating multivariate hypergeometric series. With these contiguous relations one can prove several recursion formulas of those series. This theoretical result allows to compute integrals over products of Jacobi polynomials in a very efficient recursive way. Moreover, the authors present an application to numerical analysis where it can be used in algorithms which compute the approximate solution of boundary value problem of partial differential equations by means of the finite elements method. With the aid of the contiguous relations, the approximate solution can be computed much faster than using numerical integration. A numerical example illustrates this effect.",
keywords = "High order finite element methods, Hypergeometric function, Orthogonal polynomials, Recurrence equations",
author = "Sven Beuchler and Tim Haubold and Veronika Pillwein",
note = "Funding Information: The first author has been supported by the Deutsche Forschungsgemeinschaft (DFG) under Germany{\textquoteright}s Excellence Strategy within the Cluster of Excellence PhoenixD (EXC 2122, Project ID 390833453). ",
year = "2023",
month = may,
day = "27",
doi = "10.48550/arXiv.2105.08989",
language = "English",
journal = "Constructive approximation",
issn = "0176-4276",
publisher = "Springer New York",

}

Download

TY - JOUR

T1 - Recursion Formulas for Integrated Products of Jacobi Polynomials

AU - Beuchler, Sven

AU - Haubold, Tim

AU - Pillwein, Veronika

N1 - Funding Information: The first author has been supported by the Deutsche Forschungsgemeinschaft (DFG) under Germany’s Excellence Strategy within the Cluster of Excellence PhoenixD (EXC 2122, Project ID 390833453).

PY - 2023/5/27

Y1 - 2023/5/27

N2 - From the literature it is known that orthogonal polynomials as the Jacobi polynomials can be expressed by hypergeometric series. In this paper, the authors derive several contiguous relations for terminating multivariate hypergeometric series. With these contiguous relations one can prove several recursion formulas of those series. This theoretical result allows to compute integrals over products of Jacobi polynomials in a very efficient recursive way. Moreover, the authors present an application to numerical analysis where it can be used in algorithms which compute the approximate solution of boundary value problem of partial differential equations by means of the finite elements method. With the aid of the contiguous relations, the approximate solution can be computed much faster than using numerical integration. A numerical example illustrates this effect.

AB - From the literature it is known that orthogonal polynomials as the Jacobi polynomials can be expressed by hypergeometric series. In this paper, the authors derive several contiguous relations for terminating multivariate hypergeometric series. With these contiguous relations one can prove several recursion formulas of those series. This theoretical result allows to compute integrals over products of Jacobi polynomials in a very efficient recursive way. Moreover, the authors present an application to numerical analysis where it can be used in algorithms which compute the approximate solution of boundary value problem of partial differential equations by means of the finite elements method. With the aid of the contiguous relations, the approximate solution can be computed much faster than using numerical integration. A numerical example illustrates this effect.

KW - High order finite element methods

KW - Hypergeometric function

KW - Orthogonal polynomials

KW - Recurrence equations

UR - http://www.scopus.com/inward/record.url?scp=85160232260&partnerID=8YFLogxK

U2 - 10.48550/arXiv.2105.08989

DO - 10.48550/arXiv.2105.08989

M3 - Article

AN - SCOPUS:85160232260

JO - Constructive approximation

JF - Constructive approximation

SN - 0176-4276

ER -