Algorithm | Description | Requirements
of Containers |
Performance |
FFT | 1,2,and 3
dimensional fast Fourier transform |
1. random access iterator
2. sequential storage of elements in a particular order |
1D O(nlog n)
2D O([nlog n]2) 3D O([nlog n]3) |
Least
SquaresFit |
Fit one set of three
dimensional co-ordinates to another |
1. forward iterator
2. sequential storage in a particular order |
O(n) |
Cholesky
Inverse |
Calculate
the inverse of symmetric matrix |
1. size_type and value_type defining the types matrix subscripts
and contents used
2. NumOfCols() and NumOfRows() functions to obtain the dimensions of the matrix 3. a () operator for direct access to matrix elements via subscripts . Subscripts should start at 1 and be in row, column pairs |
O(n3) |