๐”– Scriptorium
โœฆ   LIBER   โœฆ

๐Ÿ“

CAS algorithms for orthogonal polynomials and special functions 2002

โœ Scribed by Koepf.


Tongue
English
Leaves
20
Category
Library

โฌ‡  Acquire This Volume

No coin nor oath required. For personal study only.


๐Ÿ“œ SIMILAR VOLUMES


Orthogonal Polynomials and Special Funct
โœ Erik Koelink (ed.), Walter Van Assche (ed.) ๐Ÿ“‚ Library ๐Ÿ“… 2003 ๐Ÿ› Springer ๐ŸŒ English

The set of lectures from the Summer School held in Leuven in 2002 provide an up-to-date account of recent developments in orthogonal polynomials and special functions, in particular for algorithms for computer algebra packages, 3nj-symbols in representation theory of Lie groups, enumeration, multiva

Orthogonal Polynomials and Special Funct
โœ Wolfram Koepf (auth.), Erik Koelink, Walter Van Assche (eds.) ๐Ÿ“‚ Library ๐Ÿ“… 2003 ๐Ÿ› Springer ๐ŸŒ English

<P>The set of lectures from the Summer School held in Leuven in 2002 provide an up-to-date account of recent developments in orthogonal polynomials and special functions, in particular for algorithms for computer algebra packages, 3nj-symbols in representation theory of Lie groups, enumeration, mult

Orthogonal Polynomials and Special Funct
โœ Wolfram Koepf (auth.), Erik Koelink, Walter Van Assche (eds.) ๐Ÿ“‚ Library ๐Ÿ“… 2003 ๐Ÿ› Springer ๐ŸŒ English

<P>The set of lectures from the Summer School held in Leuven in 2002 provide an up-to-date account of recent developments in orthogonal polynomials and special functions, in particular for algorithms for computer algebra packages, 3nj-symbols in representation theory of Lie groups, enumeration, mult

Special Functions and Orthogonal Polynom
โœ Richard Beals, Roderick Wong ๐Ÿ“‚ Library ๐Ÿ“… 2016 ๐Ÿ› Cambridge University Press ๐ŸŒ English

The subject of special functions is often presented as a collection of disparate results, rarely organized in a coherent way. This book emphasizes general principles that unify and demarcate the subjects of study. The authors' main goals are to provide clear motivation, efficient proofs, and origina