FFT: tweak threading of managed radix2 implementation (much faster ion

small N) #440
10 years ago · 36f47eab88
2 changed files with 2 additions and 2 deletions
--- a/src/Numerics/IntegralTransforms/Fourier.Bluestein.cs
+++ b/src/Numerics/IntegralTransforms/Fourier.Bluestein.cs
@ -156,7 +156,7 @@ namespace MathNet.Numerics.IntegralTransforms
            int n = samples.Length;
            if (n.IsPowerOfTwo())
            {
-                Radix2(samples, exponentSign);
+                Radix2Parallel(samples, exponentSign);
                return;
            }
--- a/src/Numerics/IntegralTransforms/Fourier.RadixN.cs
+++ b/src/Numerics/IntegralTransforms/Fourier.RadixN.cs
@ -134,7 +134,7 @@ namespace MathNet.Numerics.IntegralTransforms
            {
                var size = levelSize;
-                CommonParallel.For(0, size, (u, v) =>
+                CommonParallel.For(0, size, 64, (u, v) =>
                {
                    for (int i = u; i < v; i++)
                    {