Special Issue on Orthogonal Polynomials and Computer Algebra Foreword of the Guest Editors

• Publisher: Elsevier Science
• Year: 1999
• Tongue: English
• Weight: 97 KB
• Volume: 28
• Category: Article
• ISSN: 0747-7171
• DOI: 10.1006/jsco.1999.0300

✦ Synopsis

In the last decade major steps toward an algorithmic treatment of orthogonal polynomials and special functions have been made, notably Zeilberger's brilliant extension of Gosper's algorithm on algorithmic definite hypergeometric summation. By implementations of these and other algorithms, symbolic computation has the potential to change the daily work of anyone who uses orthogonal polynomials or special functions in research or applications. It can be expected that symbolic computation will also play an important role in on-line versions of major revisions of existing formula books in these areas.

Many articles on the algorithmic treatment of orthogonal polynomials and special functions and on applications of such algorithms have been published in the meantime. However, such articles are distributed widely in the literature. To bring together some of these efforts Wolfram Koepf organized a session on orthogonal polynomials at the first ISAAC Congress (http://www.math.udel.edu/isaac) with an emphasis on the use of computer algebra. ISAAC is the International Society for Analysis, its Applications and Computation.