Some Methods for Closed Form Representation

Anthony Sofo
Additional contact information
Anthony Sofo: Victoria University, School of Computer Science and Mathematics

Chapter Chapter 1 in Computational Techniques for the Summation of Series, 2003, pp 1-29 from Springer

Abstract: Abstract This chapter consists of two sections. The first section is a brief overview of some methods, basically ones dealing with residue theory, which are useful for the summation of series and their representation in closed form. Some results given by various authors are generalized and extended. In the second section a particular tree search sum, with some variations is considered. A number of techniques are utilized, recurrences and automated procedures, that are useful in determining its closed form representation. Some related results, which are new, are also presented.

Keywords: Recurrence Relation; Hypergeometric Function; Computational Technique; Jacobi Polynomial; Summation Formula (search for similar items in EconPapers)
Date: 2003
References: Add references at CitEc
Citations:

There are no downloads for this item, see the EconPapers FAQ for hints about obtaining it.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:spr:sprchp:978-1-4615-0057-5_1

Ordering information: This item can be ordered from
http://www.springer.com/9781461500575

DOI: 10.1007/978-1-4615-0057-5_1

Access Statistics for this chapter

More chapters in Springer Books from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().