|
|
|
@ -3,7 +3,9 @@ |
|
|
|
// http://numerics.mathdotnet.com
|
|
|
|
// http://github.com/mathnet/mathnet-numerics
|
|
|
|
// http://mathnetnumerics.codeplex.com
|
|
|
|
// Copyright (c) 2009-2010 Math.NET
|
|
|
|
//
|
|
|
|
// Copyright (c) 2009-2013 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
|
|
|
|
@ -12,8 +14,10 @@ |
|
|
|
// 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
|
|
|
|
@ -28,7 +32,7 @@ using System; |
|
|
|
using System.Reflection; |
|
|
|
using MathNet.Numerics.LinearAlgebra; |
|
|
|
using MathNet.Numerics.LinearAlgebra.Single; |
|
|
|
using MathNet.Numerics.LinearAlgebra.Single.Solvers.Preconditioners; |
|
|
|
using MathNet.Numerics.LinearAlgebra.Single.Solvers; |
|
|
|
using MathNet.Numerics.LinearAlgebra.Solvers; |
|
|
|
using NUnit.Framework; |
|
|
|
|
|
|
|
@ -43,17 +47,17 @@ namespace MathNet.Numerics.UnitTests.LinearAlgebraTests.Single.Solvers.Precondit |
|
|
|
/// <summary>
|
|
|
|
/// The drop tolerance.
|
|
|
|
/// </summary>
|
|
|
|
private double _dropTolerance = 0.1; |
|
|
|
double _dropTolerance = 0.1; |
|
|
|
|
|
|
|
/// <summary>
|
|
|
|
/// The fill level.
|
|
|
|
/// </summary>
|
|
|
|
private double _fillLevel = 1.0; |
|
|
|
double _fillLevel = 1.0; |
|
|
|
|
|
|
|
/// <summary>
|
|
|
|
/// The pivot tolerance.
|
|
|
|
/// </summary>
|
|
|
|
private double _pivotTolerance = 1.0; |
|
|
|
double _pivotTolerance = 1.0; |
|
|
|
|
|
|
|
/// <summary>
|
|
|
|
/// Setup default parameters.
|
|
|
|
@ -73,7 +77,7 @@ namespace MathNet.Numerics.UnitTests.LinearAlgebraTests.Single.Solvers.Precondit |
|
|
|
/// <param name="ilutp">Ilutp instance.</param>
|
|
|
|
/// <param name="methodName">Method name.</param>
|
|
|
|
/// <returns>Result of the method invocation.</returns>
|
|
|
|
private static T GetMethod<T>(ILUTPPreconditioner ilutp, string methodName) |
|
|
|
static T GetMethod<T>(ILUTPPreconditioner ilutp, string methodName) |
|
|
|
{ |
|
|
|
var type = ilutp.GetType(); |
|
|
|
var methodInfo = type.GetMethod( |
|
|
|
@ -84,7 +88,7 @@ namespace MathNet.Numerics.UnitTests.LinearAlgebraTests.Single.Solvers.Precondit |
|
|
|
new Type[0], |
|
|
|
null); |
|
|
|
var obj = methodInfo.Invoke(ilutp, null); |
|
|
|
return (T)obj; |
|
|
|
return (T) obj; |
|
|
|
} |
|
|
|
|
|
|
|
/// <summary>
|
|
|
|
@ -92,7 +96,7 @@ namespace MathNet.Numerics.UnitTests.LinearAlgebraTests.Single.Solvers.Precondit |
|
|
|
/// </summary>
|
|
|
|
/// <param name="ilutp">Ilutp instance.</param>
|
|
|
|
/// <returns>Upper triangle.</returns>
|
|
|
|
private static SparseMatrix GetUpperTriangle(ILUTPPreconditioner ilutp) |
|
|
|
static SparseMatrix GetUpperTriangle(ILUTPPreconditioner ilutp) |
|
|
|
{ |
|
|
|
return GetMethod<SparseMatrix>(ilutp, "UpperTriangle"); |
|
|
|
} |
|
|
|
@ -102,7 +106,7 @@ namespace MathNet.Numerics.UnitTests.LinearAlgebraTests.Single.Solvers.Precondit |
|
|
|
/// </summary>
|
|
|
|
/// <param name="ilutp">Ilutp instance.</param>
|
|
|
|
/// <returns>Lower triangle.</returns>
|
|
|
|
private static SparseMatrix GetLowerTriangle(ILUTPPreconditioner ilutp) |
|
|
|
static SparseMatrix GetLowerTriangle(ILUTPPreconditioner ilutp) |
|
|
|
{ |
|
|
|
return GetMethod<SparseMatrix>(ilutp, "LowerTriangle"); |
|
|
|
} |
|
|
|
@ -112,7 +116,7 @@ namespace MathNet.Numerics.UnitTests.LinearAlgebraTests.Single.Solvers.Precondit |
|
|
|
/// </summary>
|
|
|
|
/// <param name="ilutp">Ilutp instance.</param>
|
|
|
|
/// <returns>Pivots array.</returns>
|
|
|
|
private static int[] GetPivots(ILUTPPreconditioner ilutp) |
|
|
|
static int[] GetPivots(ILUTPPreconditioner ilutp) |
|
|
|
{ |
|
|
|
return GetMethod<int[]>(ilutp, "Pivots"); |
|
|
|
} |
|
|
|
@ -122,7 +126,7 @@ namespace MathNet.Numerics.UnitTests.LinearAlgebraTests.Single.Solvers.Precondit |
|
|
|
/// </summary>
|
|
|
|
/// <param name="size">Matrix order.</param>
|
|
|
|
/// <returns>Reverse Unit matrix.</returns>
|
|
|
|
private static SparseMatrix CreateReverseUnitMatrix(int size) |
|
|
|
static SparseMatrix CreateReverseUnitMatrix(int size) |
|
|
|
{ |
|
|
|
var matrix = new SparseMatrix(size); |
|
|
|
for (var i = 0; i < size; i++) |
|
|
|
@ -137,14 +141,14 @@ namespace MathNet.Numerics.UnitTests.LinearAlgebraTests.Single.Solvers.Precondit |
|
|
|
/// Create preconditioner (internal)
|
|
|
|
/// </summary>
|
|
|
|
/// <returns>Ilutp instance.</returns>
|
|
|
|
private ILUTPPreconditioner InternalCreatePreconditioner() |
|
|
|
ILUTPPreconditioner InternalCreatePreconditioner() |
|
|
|
{ |
|
|
|
var result = new ILUTPPreconditioner |
|
|
|
{ |
|
|
|
DropTolerance = _dropTolerance, |
|
|
|
FillLevel = _fillLevel, |
|
|
|
PivotTolerance = _pivotTolerance |
|
|
|
}; |
|
|
|
{ |
|
|
|
DropTolerance = _dropTolerance, |
|
|
|
FillLevel = _fillLevel, |
|
|
|
PivotTolerance = _pivotTolerance |
|
|
|
}; |
|
|
|
return result; |
|
|
|
} |
|
|
|
|
|
|
|
@ -169,7 +173,7 @@ namespace MathNet.Numerics.UnitTests.LinearAlgebraTests.Single.Solvers.Precondit |
|
|
|
/// <param name="result">Result vector.</param>
|
|
|
|
protected override void CheckResult(IPreconditioner<float> preconditioner, SparseMatrix matrix, Vector<float> vector, Vector<float> result) |
|
|
|
{ |
|
|
|
Assert.AreEqual(typeof(ILUTPPreconditioner), preconditioner.GetType(), "#01"); |
|
|
|
Assert.AreEqual(typeof (ILUTPPreconditioner), preconditioner.GetType(), "#01"); |
|
|
|
|
|
|
|
// Compute M * result = product
|
|
|
|
// compare vector and product. Should be equal
|
|
|
|
@ -177,7 +181,7 @@ namespace MathNet.Numerics.UnitTests.LinearAlgebraTests.Single.Solvers.Precondit |
|
|
|
matrix.Multiply(result, product); |
|
|
|
for (var i = 0; i < product.Count; i++) |
|
|
|
{ |
|
|
|
Assert.IsTrue(((double)vector[i]).AlmostEqual(product[i], -Epsilon.Magnitude()), "#02-" + i); |
|
|
|
Assert.IsTrue(((double) vector[i]).AlmostEqual(product[i], -Epsilon.Magnitude()), "#02-" + i); |
|
|
|
} |
|
|
|
} |
|
|
|
|
|
|
|
@ -241,11 +245,11 @@ namespace MathNet.Numerics.UnitTests.LinearAlgebraTests.Single.Solvers.Precondit |
|
|
|
sparseMatrix[2, 1] = 8; |
|
|
|
sparseMatrix[2, 2] = 9; |
|
|
|
var ilu = new ILUTPPreconditioner |
|
|
|
{ |
|
|
|
PivotTolerance = 0.0, |
|
|
|
DropTolerance = 0, |
|
|
|
FillLevel = 10 |
|
|
|
}; |
|
|
|
{ |
|
|
|
PivotTolerance = 0.0, |
|
|
|
DropTolerance = 0, |
|
|
|
FillLevel = 10 |
|
|
|
}; |
|
|
|
ilu.Initialize(sparseMatrix); |
|
|
|
var l = GetLowerTriangle(ilu); |
|
|
|
|
|
|
|
@ -274,7 +278,7 @@ namespace MathNet.Numerics.UnitTests.LinearAlgebraTests.Single.Solvers.Precondit |
|
|
|
{ |
|
|
|
for (var j = 0; j < sparseMatrix.ColumnCount; j++) |
|
|
|
{ |
|
|
|
Assert.IsTrue(((double)sparseMatrix[i, j]).AlmostEqualInDecimalPlaces(original[i, j], 5), "#03-" + i + "-" + j); |
|
|
|
Assert.IsTrue(((double) sparseMatrix[i, j]).AlmostEqualInDecimalPlaces(original[i, j], 5), "#03-" + i + "-" + j); |
|
|
|
} |
|
|
|
} |
|
|
|
} |
|
|
|
@ -296,11 +300,11 @@ namespace MathNet.Numerics.UnitTests.LinearAlgebraTests.Single.Solvers.Precondit |
|
|
|
sparseMatrix[2, 1] = 8; |
|
|
|
sparseMatrix[2, 2] = 9; |
|
|
|
var ilu = new ILUTPPreconditioner |
|
|
|
{ |
|
|
|
PivotTolerance = 1.0, |
|
|
|
DropTolerance = 0, |
|
|
|
FillLevel = 10 |
|
|
|
}; |
|
|
|
{ |
|
|
|
PivotTolerance = 1.0, |
|
|
|
DropTolerance = 0, |
|
|
|
FillLevel = 10 |
|
|
|
}; |
|
|
|
ilu.Initialize(sparseMatrix); |
|
|
|
var l = GetLowerTriangle(ilu); |
|
|
|
var u = GetUpperTriangle(ilu); |
|
|
|
@ -317,7 +321,7 @@ namespace MathNet.Numerics.UnitTests.LinearAlgebraTests.Single.Solvers.Precondit |
|
|
|
{ |
|
|
|
for (var j = 0; j < sparseMatrix.ColumnCount; j++) |
|
|
|
{ |
|
|
|
Assert.IsTrue(((double)sparseMatrix[i, j]).AlmostEqual(original[i, j], -Epsilon.Magnitude()), "#01-" + i + "-" + j); |
|
|
|
Assert.IsTrue(((double) sparseMatrix[i, j]).AlmostEqual(original[i, j], -Epsilon.Magnitude()), "#01-" + i + "-" + j); |
|
|
|
} |
|
|
|
} |
|
|
|
} |
|
|
|
@ -332,11 +336,11 @@ namespace MathNet.Numerics.UnitTests.LinearAlgebraTests.Single.Solvers.Precondit |
|
|
|
var newMatrix = CreateReverseUnitMatrix(Size); |
|
|
|
var vector = CreateStandardBcVector(Size); |
|
|
|
var preconditioner = new ILUTPPreconditioner |
|
|
|
{ |
|
|
|
PivotTolerance = 1.0, |
|
|
|
DropTolerance = 0, |
|
|
|
FillLevel = 10 |
|
|
|
}; |
|
|
|
{ |
|
|
|
PivotTolerance = 1.0, |
|
|
|
DropTolerance = 0, |
|
|
|
FillLevel = 10 |
|
|
|
}; |
|
|
|
preconditioner.Initialize(newMatrix); |
|
|
|
var result = new DenseVector(vector.Count); |
|
|
|
preconditioner.Approximate(vector, result); |
|
|
|
|
Christoph Ruegg
13 years ago