NMath

Modern Fast Fourier Transform

Posted on by Paul Shirkey
All variants of the original Cooley-Tukey O(n log n) fast Fourier transform fundamentally exploit different ways to factor the discrete Fourier summation of length N. For example, the split-radix FFT algorithm divides the Fourier summation of length N into three new Fourier summations: one of length N/2 and two of length N/4. The prime factor FFT, divides the Fourier summation of length N, i...
Read More

Polynomial Curve Fitting

Posted on by Ken Baldwin
A customer recently asked how to reproduce the results of the MATLAB polyfit function in NMath. This is easily done using NMath in C#. MATLAB NMath Standard package CenterSpace.NMath.Analysis polyfit( x, y, degree ) PolynomialLeastSquares( degree, x, y ) Notes: polynomial coefficients are returned in the reverse order. For example, here's some MATLAB code for fittin...
Read More

High Performance FFT in NMath 4.0

Posted on by Paul Shirkey
The next release of Center Space's NMATH .NET libraries will contain high performance, multi-core aware, fast fourier transform classes. This set of classes will elegantly support all common 1D and 2D FFT computations in a robust easy to use object-oriented interface. The following FFT classes will be available. DoubleComplexForward1DFFT DoubleComplexBackward1DFFT DoubleComplexForw...
Read More

NMath Deployment

Posted on by Ken Baldwin
Our libraries have a dependency on Microsoft Visual C++ 2008. Our installers place the C++ runtime on your development machine. However, when you deploy your application, you may need to add it to your installer. There are two ways to do this: 1. Add the VC ++ 9.0 merge module to your installer. It can be found here: c:\program files (x86)\common files\mergemodules\microsoft_vc90_crt_x86.msm or...
Read More
Top