Hostname: page-component-89b8bd64d-x2lbr Total loading time: 0 Render date: 2026-05-09T00:52:48.798Z Has data issue: false hasContentIssue false

Multiple-term approximations for Appell's F1 function

Published online by Cambridge University Press:  17 February 2009

Magdi A. El-Gabali
Affiliation:
Kuwait University, Department of Mathematics and Computer Science, P.O. Box 5969 Safat 13060, Kuwait
Rights & Permissions [Opens in a new window]

Abstract

Core share and HTML view are not available for this content. However, as you have access to this content, a full PDF is available via the 'Save PDF' action button.

In this paper computational issues of Appell's F1 function

are addressed. A novel technique is used in the derivation of highly efficient multiple-term approximations of this function (including asymptotic ones). Simple structured single- and double-term approximations, as the first two candidates of this multiple-term representa-tion, are developed in closed form. Error analysis shows that- the developed algorithms are superior to existing approximations for the same number of terms. The formulation presented is highly efficient and could be extended to a wide class of special functions.

Information

Type
Research Article
Copyright
Copyright © Australian Mathematical Society 1997