transforms: xmldoc

Signed-off-by: Christoph Ruegg <git@cdrnet.ch>

src/Managed/IntegralTransforms/Algorithms/DiscreteFourierTransform.Bluestein.cs

@@ -124,7 +124,7 @@ namespace MathNet.Numerics.IntegralTransforms.Algorithms
         }
 
         /// <summary>
-        /// Bluestein generic DFT, useful e.g. to verify faster algorithms.
+        /// Bluestein generic FFT for arbitrary sized sample vectors.
         /// </summary>
         /// <param name="samples">Time-space sample vector.</param>
         /// <param name="exponentSign">Fourier series exponent sign.</param>
@@ -151,7 +151,7 @@ namespace MathNet.Numerics.IntegralTransforms.Algorithms
         }
 
         /// <summary>
-        /// Bluestein forward FFT for arbitrary sample vectors.
+        /// Bluestein forward FFT for arbitrary sized sample vectors.
         /// </summary>
         /// <param name="samples">Sample vector, where the FFT is evaluated in place.</param>
         /// <param name="options">Fourier Transform Convention Options.</param>
@@ -162,7 +162,7 @@ namespace MathNet.Numerics.IntegralTransforms.Algorithms
         }
 
         /// <summary>
-        /// Bluestein inverse FFT for arbitrary sample vectors.
+        /// Bluestein inverse FFT for arbitrary sized sample vectors.
         /// </summary>
         /// <param name="samples">Sample vector, where the FFT is evaluated in place.</param>
         /// <param name="options">Fourier Transform Convention Options.</param>

src/Managed/IntegralTransforms/Algorithms/DiscreteFourierTransform.RadixN.cs

@@ -89,7 +89,7 @@ namespace MathNet.Numerics.IntegralTransforms.Algorithms
         }
 
         /// <summary>
-        /// Radix-2 generic FFT for power-of-two sample vectors.
+        /// Radix-2 generic FFT for power-of-two sized sample vectors.
         /// </summary>
         /// <param name="samples">Sample vector, where the FFT is evaluated in place.</param>
         /// <param name="exponentSign">Fourier series exponent sign.</param>
@@ -136,7 +136,7 @@ namespace MathNet.Numerics.IntegralTransforms.Algorithms
         }
 
         /// <summary>
-        /// Radix-2 forward FFT for power-of-two sample vectors.
+        /// Radix-2 forward FFT for power-of-two sized sample vectors.
         /// </summary>
         /// <param name="samples">Sample vector, where the FFT is evaluated in place.</param>
         /// <param name="options">Fourier Transform Convention Options.</param>
@@ -148,7 +148,7 @@ namespace MathNet.Numerics.IntegralTransforms.Algorithms
         }
 
         /// <summary>
-        /// Radix-2 inverse FFT for power-of-two sample vectors.
+        /// Radix-2 inverse FFT for power-of-two sized sample vectors.
         /// </summary>
         /// <param name="samples">Sample vector, where the FFT is evaluated in place.</param>
         /// <param name="options">Fourier Transform Convention Options.</param>