NAG Parallel Library

C06 - Summation of Series

Please note that documents marked with an asterisk are new at Release 3

* Chapter Introduction
* C06FUFP Direct or inverse two-dimensional Fourier transform of a complex sequence
* C06GXFP Factorizes a positive integer n as n = n1 × n2. This routine may be used in conjunction with C06MCFP
* C06MCFP Direct or inverse one-dimensional discrete Fourier transform of a complex sequence
* C06MXFP Direct or inverse three-dimensional discrete Fourier transform of a complex sequence


© The Numerical Algorithms Group Ltd, Oxford UK. 2000