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
CAS algorithms for orthogonal polynomials and special functions 2002
โ Scribed by Koepf.
- Tongue
- English
- Leaves
- 20
- Category
- Library
No coin nor oath required. For personal study only.
๐ SIMILAR VOLUMES
<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
<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
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