forked from tsai/mathnet-numerics
You can not select more than 25 topics
Topics must start with a letter or number, can include dashes ('-') and can be up to 35 characters long.
173 lines
5.5 KiB
173 lines
5.5 KiB
// <copyright file="InverseTransformTest.cs" company="Math.NET">
|
|
// Math.NET Numerics, part of the Math.NET Project
|
|
// http://mathnet.opensourcedotnet.info
|
|
//
|
|
// Copyright (c) 2009 Math.NET
|
|
//
|
|
// Permission is hereby granted, free of charge, to any person
|
|
// obtaining a copy of this software and associated documentation
|
|
// files (the "Software"), to deal in the Software without
|
|
// restriction, including without limitation the rights to use,
|
|
// copy, modify, merge, publish, distribute, sublicense, and/or sell
|
|
// copies of the Software, and to permit persons to whom the
|
|
// Software is furnished to do so, subject to the following
|
|
// conditions:
|
|
//
|
|
// The above copyright notice and this permission notice shall be
|
|
// included in all copies or substantial portions of the Software.
|
|
//
|
|
// THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND,
|
|
// EXPRESS OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES
|
|
// OF MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND
|
|
// NONINFRINGEMENT. IN NO EVENT SHALL THE AUTHORS OR COPYRIGHT
|
|
// HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER LIABILITY,
|
|
// WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING
|
|
// FROM, OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR
|
|
// OTHER DEALINGS IN THE SOFTWARE.
|
|
// </copyright>
|
|
|
|
namespace MathNet.Numerics.UnitTests.IntegralTransformsTests
|
|
{
|
|
using System;
|
|
using IntegralTransforms;
|
|
using IntegralTransforms.Algorithms;
|
|
using MbUnit.Framework;
|
|
|
|
[TestFixture]
|
|
public class InverseTransformTest
|
|
{
|
|
private static void VerifyIsReversibleComplex(
|
|
int count,
|
|
double maximumError,
|
|
Func<Complex[], Complex[]> forward,
|
|
Func<Complex[], Complex[]> inverse)
|
|
{
|
|
var samples = SampleProvider.ProvideComplexSamples(count);
|
|
var work = new Complex[samples.Length];
|
|
samples.CopyTo(work, 0);
|
|
|
|
work = forward(work);
|
|
|
|
Assert.IsFalse(work.AlmostEqualListWithError(samples, maximumError));
|
|
|
|
work = inverse(work);
|
|
|
|
AssertHelpers.AlmostEqualList(samples, work, maximumError);
|
|
}
|
|
|
|
private static void VerifyIsReversibleReal(
|
|
int count,
|
|
double maximumError,
|
|
Func<double[], double[]> forward,
|
|
Func<double[], double[]> inverse)
|
|
{
|
|
var samples = SampleProvider.ProvideRealSamples(count);
|
|
var work = new double[samples.Length];
|
|
samples.CopyTo(work, 0);
|
|
|
|
work = forward(work);
|
|
|
|
Assert.IsFalse(work.AlmostEqualListWithError(samples, maximumError));
|
|
|
|
work = inverse(work);
|
|
|
|
AssertHelpers.AlmostEqualList(samples, work, maximumError);
|
|
}
|
|
|
|
[Test]
|
|
[Row(FourierOptions.Default)]
|
|
[Row(FourierOptions.Matlab)]
|
|
public void FourierNaiveIsReversible(FourierOptions options)
|
|
{
|
|
var dft = new DiscreteFourierTransform();
|
|
|
|
VerifyIsReversibleComplex(
|
|
0x80,
|
|
1e-12,
|
|
s => dft.NaiveForward(s, options),
|
|
s => dft.NaiveInverse(s, options));
|
|
}
|
|
|
|
[Test]
|
|
[Row(FourierOptions.Default)]
|
|
[Row(FourierOptions.Matlab)]
|
|
public void FourierRadix2IsReversible(FourierOptions options)
|
|
{
|
|
var dft = new DiscreteFourierTransform();
|
|
|
|
VerifyIsReversibleComplex(
|
|
0x8000,
|
|
1e-12,
|
|
s =>
|
|
{
|
|
dft.Radix2Forward(s, options);
|
|
return s;
|
|
},
|
|
s =>
|
|
{
|
|
dft.Radix2Inverse(s, options);
|
|
return s;
|
|
});
|
|
}
|
|
|
|
[Test]
|
|
[Row(FourierOptions.Default)]
|
|
[Row(FourierOptions.Matlab)]
|
|
public void FourierBluesteinIsReversible(FourierOptions options)
|
|
{
|
|
var dft = new DiscreteFourierTransform();
|
|
|
|
VerifyIsReversibleComplex(
|
|
0x7FFF,
|
|
1e-12,
|
|
s =>
|
|
{
|
|
dft.BluesteinForward(s, options);
|
|
return s;
|
|
},
|
|
s =>
|
|
{
|
|
dft.BluesteinInverse(s, options);
|
|
return s;
|
|
});
|
|
}
|
|
|
|
[Test]
|
|
[Row(HartleyOptions.Default)]
|
|
[Row(HartleyOptions.AsymmetricScaling)]
|
|
public void HartleyNaiveIsReversible(HartleyOptions options)
|
|
{
|
|
var dht = new DiscreteHartleyTransform();
|
|
|
|
VerifyIsReversibleReal(
|
|
0x80,
|
|
1e-9,
|
|
s => dht.NaiveForward(s, options),
|
|
s => dht.NaiveInverse(s, options));
|
|
}
|
|
|
|
[Test]
|
|
public void FourierDefaultTransformIsReversible()
|
|
{
|
|
var samples = SampleProvider.ProvideComplexSamples(0x7FFF);
|
|
var work = new Complex[samples.Length];
|
|
samples.CopyTo(work, 0);
|
|
|
|
Transform.FourierForward(work);
|
|
|
|
Assert.IsFalse(work.AlmostEqualListWithError(samples, 1e-12));
|
|
|
|
Transform.FourierInverse(work);
|
|
|
|
AssertHelpers.AlmostEqualList(samples, work, 1e-12);
|
|
|
|
Transform.FourierInverse(work, FourierOptions.Default);
|
|
|
|
Assert.IsFalse(work.AlmostEqualListWithError(samples, 1e-12));
|
|
|
|
Transform.FourierForward(work, FourierOptions.Default);
|
|
|
|
AssertHelpers.AlmostEqualList(samples, work, 1e-12);
|
|
}
|
|
}
|
|
}
|
|
|