Simple Search

Query:

Enter a query and click »Search«...

Format:

Display: entries per page entries

Zbl 1117.33007
Koev, Plamen; Edelman, Alan
The efficient evaluation of the hypergeometric function of a matrix argument. (English)
[J] Math. Comput. 75, No. 254, 833-846 (2006). ISSN 0025-5718; ISSN 1088-6842/e

This paper focuses on the expansion of matrix argument generalized hypergeometric functions (${}_pF_q$) as a series of Jack functions. The main purpose in fact is the approximation of these type functions by truncating these series. The authors first mention the previous approaches to this end. Then they propose their own technique. They conjecture and show that the computational complexity of their method is linear in the size of the matrix appearing as the argument of the concerned generalized hypergeometric function. Their work contains also certain theorems about the validation of the efficiency of their method.
[Metin Demiralp (Istanbul)]

MSC 2000:: *33C20 Generalized hypergeometric series
65B10 Summation of series
05A99 Classical combinatorial problems

Keywords: Generalized hypergeometric functions; Jack functions; computational complexity

Comment on this Item PDF MathML XML ASCII DVI PS BibTeX Online Ordering Article Journal

	Scientific prize winners of the ICM 2010
	Overhang
	Lie groups, physics and geometry. An introduction for physicists, engineers and chemists.

Simple Search

Zentralblatt MATH Berlin [Germany]