forked from tsai/mathnet-numerics
Christoph Ruegg
13 years ago
51 changed files with 544 additions and 1840 deletions
@ -1,73 +0,0 @@ |
|||
// <copyright file="Iterator.cs" company="Math.NET">
|
|||
// Math.NET Numerics, part of the Math.NET Project
|
|||
// http://numerics.mathdotnet.com
|
|||
// http://github.com/mathnet/mathnet-numerics
|
|||
// http://mathnetnumerics.codeplex.com
|
|||
//
|
|||
// Copyright (c) 2009-2010 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>
|
|||
|
|||
using MathNet.Numerics.LinearAlgebra.Complex.Solvers.StopCriterium; |
|||
using MathNet.Numerics.LinearAlgebra.Solvers; |
|||
|
|||
namespace MathNet.Numerics.LinearAlgebra.Complex.Solvers |
|||
{ |
|||
|
|||
#if NOSYSNUMERICS
|
|||
using Complex = Numerics.Complex; |
|||
#else
|
|||
using Complex = System.Numerics.Complex; |
|||
#endif
|
|||
|
|||
/// <summary>
|
|||
/// An iterator that is used to check if an iterative calculation should continue or stop.
|
|||
/// </summary>
|
|||
public static class Iterator |
|||
{ |
|||
|
|||
// TODO: Refactor
|
|||
|
|||
/// <summary>
|
|||
/// Creates the default stop criteria.
|
|||
/// </summary>
|
|||
public static IIterationStopCriterium<Complex>[] CreateDefaultStopCriteria() |
|||
{ |
|||
return new IIterationStopCriterium<Complex>[] |
|||
{ |
|||
new FailureStopCriterium(), |
|||
new DivergenceStopCriterium(), |
|||
new IterationCountStopCriterium<Complex>(), |
|||
new ResidualStopCriterium() |
|||
}; |
|||
} |
|||
|
|||
/// <summary>
|
|||
/// Creates a default iterator with all the default stop criteria.
|
|||
/// </summary>
|
|||
public static Iterator<Complex> CreateDefault() |
|||
{ |
|||
return new Iterator<Complex>(CreateDefaultStopCriteria()); |
|||
} |
|||
} |
|||
} |
|||
@ -1,68 +0,0 @@ |
|||
// <copyright file="Iterator.cs" company="Math.NET">
|
|||
// Math.NET Numerics, part of the Math.NET Project
|
|||
// http://numerics.mathdotnet.com
|
|||
// http://github.com/mathnet/mathnet-numerics
|
|||
// http://mathnetnumerics.codeplex.com
|
|||
//
|
|||
// Copyright (c) 2009-2010 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>
|
|||
|
|||
using MathNet.Numerics.LinearAlgebra.Complex32.Solvers.StopCriterium; |
|||
using MathNet.Numerics.LinearAlgebra.Solvers; |
|||
|
|||
namespace MathNet.Numerics.LinearAlgebra.Complex32.Solvers |
|||
{ |
|||
using Numerics; |
|||
|
|||
/// <summary>
|
|||
/// An iterator that is used to check if an iterative calculation should continue or stop.
|
|||
/// </summary>
|
|||
public static class Iterator |
|||
{ |
|||
|
|||
// TODO: Refactor
|
|||
|
|||
/// <summary>
|
|||
/// Creates the default stop criteria.
|
|||
/// </summary>
|
|||
public static IIterationStopCriterium<Complex32>[] CreateDefaultStopCriteria() |
|||
{ |
|||
return new IIterationStopCriterium<Complex32>[] |
|||
{ |
|||
new FailureStopCriterium(), |
|||
new DivergenceStopCriterium(), |
|||
new IterationCountStopCriterium<Complex32>(), |
|||
new ResidualStopCriterium() |
|||
}; |
|||
} |
|||
|
|||
/// <summary>
|
|||
/// Creates a default iterator with all the default stop criteria.
|
|||
/// </summary>
|
|||
public static Iterator<Complex32> CreateDefault() |
|||
{ |
|||
return new Iterator<Complex32>(CreateDefaultStopCriteria()); |
|||
} |
|||
} |
|||
} |
|||
@ -1,66 +0,0 @@ |
|||
// <copyright file="Iterator.cs" company="Math.NET">
|
|||
// Math.NET Numerics, part of the Math.NET Project
|
|||
// http://numerics.mathdotnet.com
|
|||
// http://github.com/mathnet/mathnet-numerics
|
|||
// http://mathnetnumerics.codeplex.com
|
|||
//
|
|||
// 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
|
|||
// 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>
|
|||
|
|||
using MathNet.Numerics.LinearAlgebra.Double.Solvers.StopCriterium; |
|||
using MathNet.Numerics.LinearAlgebra.Solvers; |
|||
|
|||
namespace MathNet.Numerics.LinearAlgebra.Double.Solvers |
|||
{ |
|||
/// <summary>
|
|||
/// An iterator that is used to check if an iterative calculation should continue or stop.
|
|||
/// </summary>
|
|||
public static class Iterator |
|||
{ |
|||
|
|||
// TODO: Refactor
|
|||
|
|||
/// <summary>
|
|||
/// Creates the default stop criteria.
|
|||
/// </summary>
|
|||
public static IIterationStopCriterium<double>[] CreateDefaultStopCriteria() |
|||
{ |
|||
return new IIterationStopCriterium<double>[] |
|||
{ |
|||
new FailureStopCriterium(), |
|||
new DivergenceStopCriterium(), |
|||
new IterationCountStopCriterium<double>(), |
|||
new ResidualStopCriterium() |
|||
}; |
|||
} |
|||
|
|||
/// <summary>
|
|||
/// Creates a default iterator with all the default stop criteria.
|
|||
/// </summary>
|
|||
public static Iterator<double> CreateDefault() |
|||
{ |
|||
return new Iterator<double>(CreateDefaultStopCriteria()); |
|||
} |
|||
} |
|||
} |
|||
@ -1,78 +0,0 @@ |
|||
// <copyright file="Matrix.Factorization.cs" company="Math.NET">
|
|||
// Math.NET Numerics, part of the Math.NET Project
|
|||
// http://numerics.mathdotnet.com
|
|||
// http://github.com/mathnet/mathnet-numerics
|
|||
// http://mathnetnumerics.codeplex.com
|
|||
//
|
|||
// 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
|
|||
// 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>
|
|||
|
|||
using MathNet.Numerics.LinearAlgebra.Factorization; |
|||
|
|||
namespace MathNet.Numerics.LinearAlgebra |
|||
{ |
|||
/// <summary>
|
|||
/// Defines the base class for <c>Matrix</c> classes.
|
|||
/// </summary>
|
|||
public abstract partial class Matrix<T> |
|||
{ |
|||
/// <summary>
|
|||
/// Computes the Cholesky decomposition for a matrix.
|
|||
/// </summary>
|
|||
/// <returns>The Cholesky decomposition object.</returns>
|
|||
public abstract Cholesky<T> Cholesky(); |
|||
|
|||
/// <summary>
|
|||
/// Computes the LU decomposition for a matrix.
|
|||
/// </summary>
|
|||
/// <returns>The LU decomposition object.</returns>
|
|||
public abstract LU<T> LU(); |
|||
|
|||
/// <summary>
|
|||
/// Computes the QR decomposition for a matrix.
|
|||
/// </summary>
|
|||
/// <param name="method">The type of QR factorization to perform.</param>
|
|||
/// <returns>The QR decomposition object.</returns>
|
|||
public abstract QR<T> QR(QRMethod method = QRMethod.Thin); |
|||
|
|||
/// <summary>
|
|||
/// Computes the QR decomposition for a matrix using Modified Gram-Schmidt Orthogonalization.
|
|||
/// </summary>
|
|||
/// <returns>The QR decomposition object.</returns>
|
|||
public abstract GramSchmidt<T> GramSchmidt(); |
|||
|
|||
/// <summary>
|
|||
/// Computes the SVD decomposition for a matrix.
|
|||
/// </summary>
|
|||
/// <param name="computeVectors">Compute the singular U and VT vectors or not.</param>
|
|||
/// <returns>The SVD decomposition object.</returns>
|
|||
public abstract Svd<T> Svd(bool computeVectors); |
|||
|
|||
/// <summary>
|
|||
/// Computes the EVD decomposition for a matrix.
|
|||
/// </summary>
|
|||
/// <returns>The EVD decomposition object.</returns>
|
|||
public abstract Evd<T> Evd(); |
|||
} |
|||
} |
|||
@ -0,0 +1,284 @@ |
|||
// <copyright file="Matrix.Solve.cs" company="Math.NET">
|
|||
// Math.NET Numerics, part of the Math.NET Project
|
|||
// http://numerics.mathdotnet.com
|
|||
// http://github.com/mathnet/mathnet-numerics
|
|||
// http://mathnetnumerics.codeplex.com
|
|||
//
|
|||
// 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
|
|||
// 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>
|
|||
|
|||
using System; |
|||
using MathNet.Numerics.LinearAlgebra.Factorization; |
|||
using MathNet.Numerics.LinearAlgebra.Solvers; |
|||
|
|||
namespace MathNet.Numerics.LinearAlgebra |
|||
{ |
|||
/// <summary>
|
|||
/// Defines the base class for <c>Matrix</c> classes.
|
|||
/// </summary>
|
|||
public abstract partial class Matrix<T> |
|||
{ |
|||
|
|||
// Factorizations
|
|||
|
|||
/// <summary>
|
|||
/// Computes the Cholesky decomposition for a matrix.
|
|||
/// </summary>
|
|||
/// <returns>The Cholesky decomposition object.</returns>
|
|||
public abstract Cholesky<T> Cholesky(); |
|||
|
|||
/// <summary>
|
|||
/// Computes the LU decomposition for a matrix.
|
|||
/// </summary>
|
|||
/// <returns>The LU decomposition object.</returns>
|
|||
public abstract LU<T> LU(); |
|||
|
|||
/// <summary>
|
|||
/// Computes the QR decomposition for a matrix.
|
|||
/// </summary>
|
|||
/// <param name="method">The type of QR factorization to perform.</param>
|
|||
/// <returns>The QR decomposition object.</returns>
|
|||
public abstract QR<T> QR(QRMethod method = QRMethod.Thin); |
|||
|
|||
/// <summary>
|
|||
/// Computes the QR decomposition for a matrix using Modified Gram-Schmidt Orthogonalization.
|
|||
/// </summary>
|
|||
/// <returns>The QR decomposition object.</returns>
|
|||
public abstract GramSchmidt<T> GramSchmidt(); |
|||
|
|||
/// <summary>
|
|||
/// Computes the SVD decomposition for a matrix.
|
|||
/// </summary>
|
|||
/// <param name="computeVectors">Compute the singular U and VT vectors or not.</param>
|
|||
/// <returns>The SVD decomposition object.</returns>
|
|||
public abstract Svd<T> Svd(bool computeVectors); |
|||
|
|||
/// <summary>
|
|||
/// Computes the EVD decomposition for a matrix.
|
|||
/// </summary>
|
|||
/// <returns>The EVD decomposition object.</returns>
|
|||
public abstract Evd<T> Evd(); |
|||
|
|||
|
|||
// Iterative Solvers: Try
|
|||
|
|||
/// <summary>
|
|||
/// Solves the matrix equation Ax = b, where A is the coefficient matrix (this matrix), b is the solution vector and x is the unknown vector.
|
|||
/// </summary>
|
|||
/// <param name="input">The solution vector <c>b</c>.</param>
|
|||
/// <param name="result">The result vector <c>x</c>.</param>
|
|||
/// <param name="solver">The iterative solver to use.</param>
|
|||
public IterationStatus TrySolveIterative(Vector<T> input, Vector<T> result, IIterativeSolver<T> solver, IPreconditioner<T> preconditioner, Iterator<T> iterator = null) |
|||
{ |
|||
if (iterator == null) |
|||
{ |
|||
iterator = new Iterator<T>(Builder.IterativeSolverStopCriteria()); |
|||
} |
|||
|
|||
if (preconditioner == null) |
|||
{ |
|||
preconditioner = new UnitPreconditioner<T>(); |
|||
} |
|||
|
|||
solver.Solve(this, input, result, iterator, preconditioner); |
|||
|
|||
return iterator.Status; |
|||
} |
|||
|
|||
/// <summary>
|
|||
/// Solves the matrix equation AX = B, where A is the coefficient matrix (this matrix), B is the solution matrix and X is the unknown matrix.
|
|||
/// </summary>
|
|||
/// <param name="input">The solution matrix <c>B</c>.</param>
|
|||
/// <param name="result">The result matrix <c>X</c></param>
|
|||
/// <param name="solver">The iterative solver to use.</param>
|
|||
public IterationStatus TrySolveIterative(Matrix<T> input, Matrix<T> result, IIterativeSolver<T> solver, IPreconditioner<T> preconditioner, Iterator<T> iterator = null) |
|||
{ |
|||
if (RowCount != input.RowCount || input.RowCount != result.RowCount || input.ColumnCount != result.ColumnCount) |
|||
{ |
|||
throw DimensionsDontMatch<ArgumentException>(this, input, result); |
|||
} |
|||
|
|||
if (iterator == null) |
|||
{ |
|||
iterator = new Iterator<T>(Builder.IterativeSolverStopCriteria()); |
|||
} |
|||
|
|||
if (preconditioner == null) |
|||
{ |
|||
preconditioner = new UnitPreconditioner<T>(); |
|||
} |
|||
|
|||
for (var column = 0; column < input.ColumnCount; column++) |
|||
{ |
|||
var solution = Builder.DenseVector(RowCount); |
|||
|
|||
solver.Solve(this, input.Column(column), solution, iterator, preconditioner); |
|||
|
|||
foreach (var element in solution.EnumerateNonZeroIndexed()) |
|||
{ |
|||
result.At(element.Item1, column, element.Item2); |
|||
} |
|||
} |
|||
|
|||
return iterator.Status; |
|||
} |
|||
|
|||
public IterationStatus TrySolveIterative(Vector<T> input, Vector<T> result, IIterativeSolver<T> solver, Iterator<T> iterator) |
|||
{ |
|||
var preconditioner = new UnitPreconditioner<T>(); |
|||
return TrySolveIterative(input, result, solver, preconditioner, iterator); |
|||
} |
|||
|
|||
public IterationStatus TrySolveIterative(Matrix<T> input, Matrix<T> result, IIterativeSolver<T> solver, Iterator<T> iterator) |
|||
{ |
|||
var preconditioner = new UnitPreconditioner<T>(); |
|||
return TrySolveIterative(input, result, solver, preconditioner, iterator); |
|||
} |
|||
|
|||
public IterationStatus TrySolveIterative(Vector<T> input, Vector<T> result, IIterativeSolver<T> solver) |
|||
{ |
|||
var preconditioner = new UnitPreconditioner<T>(); |
|||
var iterator = new Iterator<T>(Builder.IterativeSolverStopCriteria()); |
|||
return TrySolveIterative(input, result, solver, preconditioner, iterator); |
|||
} |
|||
|
|||
public IterationStatus TrySolveIterative(Matrix<T> input, Matrix<T> result, IIterativeSolver<T> solver) |
|||
{ |
|||
var preconditioner = new UnitPreconditioner<T>(); |
|||
var iterator = new Iterator<T>(Builder.IterativeSolverStopCriteria()); |
|||
return TrySolveIterative(input, result, solver, preconditioner, iterator); |
|||
} |
|||
|
|||
public IterationStatus TrySolveIterative(Vector<T> input, Vector<T> result, IIterativeSolver<T> solver, IPreconditioner<T> preconditioner, params IIterationStopCriterium<T>[] stopCriteria) |
|||
{ |
|||
var iterator = new Iterator<T>(stopCriteria.Length == 0 ? Builder.IterativeSolverStopCriteria() : stopCriteria); |
|||
return TrySolveIterative(input, result, solver, preconditioner, iterator); |
|||
} |
|||
|
|||
public IterationStatus TrySolveIterative(Matrix<T> input, Matrix<T> result, IIterativeSolver<T> solver, IPreconditioner<T> preconditioner, params IIterationStopCriterium<T>[] stopCriteria) |
|||
{ |
|||
var iterator = new Iterator<T>(stopCriteria.Length == 0 ? Builder.IterativeSolverStopCriteria() : stopCriteria); |
|||
return TrySolveIterative(input, result, solver, preconditioner, iterator); |
|||
} |
|||
|
|||
public IterationStatus TrySolveIterative(Vector<T> input, Vector<T> result, IIterativeSolver<T> solver, params IIterationStopCriterium<T>[] stopCriteria) |
|||
{ |
|||
var preconditioner = new UnitPreconditioner<T>(); |
|||
var iterator = new Iterator<T>(stopCriteria.Length == 0 ? Builder.IterativeSolverStopCriteria() : stopCriteria); |
|||
return TrySolveIterative(input, result, solver, preconditioner, iterator); |
|||
} |
|||
|
|||
public IterationStatus TrySolveIterative(Matrix<T> input, Matrix<T> result, IIterativeSolver<T> solver, params IIterationStopCriterium<T>[] stopCriteria) |
|||
{ |
|||
var preconditioner = new UnitPreconditioner<T>(); |
|||
var iterator = new Iterator<T>(stopCriteria.Length == 0 ? Builder.IterativeSolverStopCriteria() : stopCriteria); |
|||
return TrySolveIterative(input, result, solver, preconditioner, iterator); |
|||
} |
|||
|
|||
|
|||
// Iterative Solvers: Simple
|
|||
|
|||
public Vector<T> SolveIterative(Vector<T> input, IIterativeSolver<T> solver, IPreconditioner<T> preconditioner, Iterator<T> iterator) |
|||
{ |
|||
var result = Builder.DenseVector(RowCount); |
|||
TrySolveIterative(input, result, solver, preconditioner, iterator); |
|||
return result; |
|||
} |
|||
|
|||
public Matrix<T> SolveIterative(Matrix<T> input, IIterativeSolver<T> solver, IPreconditioner<T> preconditioner, Iterator<T> iterator) |
|||
{ |
|||
var result = Builder.DenseMatrix(input.RowCount, input.ColumnCount); |
|||
TrySolveIterative(input, result, solver, preconditioner, iterator); |
|||
return result; |
|||
} |
|||
|
|||
public Vector<T> SolveIterative(Vector<T> input, IIterativeSolver<T> solver, Iterator<T> iterator) |
|||
{ |
|||
var result = Builder.DenseVector(RowCount); |
|||
TrySolveIterative(input, result, solver, iterator); |
|||
return result; |
|||
} |
|||
|
|||
public Matrix<T> SolveIterative(Matrix<T> input, IIterativeSolver<T> solver, Iterator<T> iterator) |
|||
{ |
|||
var result = Builder.DenseMatrix(input.RowCount, input.ColumnCount); |
|||
TrySolveIterative(input, result, solver, iterator); |
|||
return result; |
|||
} |
|||
|
|||
/// <summary>
|
|||
/// Solves the matrix equation Ax = b, where A is the coefficient matrix (this matrix), b is the solution vector and x is the unknown vector.
|
|||
/// </summary>
|
|||
/// <param name="input">The solution vector <c>b</c>.</param>
|
|||
/// <param name="solver">The iterative solver to use.</param>
|
|||
/// <returns>The result vector <c>x</c>.</returns>
|
|||
public Vector<T> SolveIterative(Vector<T> input, IIterativeSolver<T> solver) |
|||
{ |
|||
var result = Builder.DenseVector(RowCount); |
|||
TrySolveIterative(input, result, solver); |
|||
return result; |
|||
} |
|||
|
|||
/// <summary>
|
|||
/// Solves the matrix equation AX = B, where A is the coefficient matrix (this matrix), B is the solution matrix and X is the unknown matrix.
|
|||
/// </summary>
|
|||
/// <param name="input">The solution matrix <c>B</c>.</param>
|
|||
/// <param name="solver">The iterative solver to use.</param>
|
|||
/// <returns>The result matrix <c>X</c>.</returns>
|
|||
public Matrix<T> SolveIterative(Matrix<T> input, IIterativeSolver<T> solver) |
|||
{ |
|||
var result = Builder.DenseMatrix(input.RowCount, input.ColumnCount); |
|||
TrySolveIterative(input, result, solver); |
|||
return result; |
|||
} |
|||
|
|||
public Vector<T> SolveIterative(Vector<T> input, IIterativeSolver<T> solver, IPreconditioner<T> preconditioner, params IIterationStopCriterium<T>[] stopCriteria) |
|||
{ |
|||
var result = Builder.DenseVector(RowCount); |
|||
TrySolveIterative(input, result, solver, preconditioner, stopCriteria); |
|||
return result; |
|||
} |
|||
|
|||
public Matrix<T> SolveIterative(Matrix<T> input, IIterativeSolver<T> solver, IPreconditioner<T> preconditioner, params IIterationStopCriterium<T>[] stopCriteria) |
|||
{ |
|||
var result = Builder.DenseMatrix(input.RowCount, input.ColumnCount); |
|||
TrySolveIterative(input, result, solver, preconditioner, stopCriteria); |
|||
return result; |
|||
} |
|||
|
|||
public Vector<T> SolveIterative(Vector<T> input, IIterativeSolver<T> solver, params IIterationStopCriterium<T>[] stopCriteria) |
|||
{ |
|||
var result = Builder.DenseVector(RowCount); |
|||
TrySolveIterative(input, result, solver, stopCriteria); |
|||
return result; |
|||
} |
|||
|
|||
public Matrix<T> SolveIterative(Matrix<T> input, IIterativeSolver<T> solver, params IIterationStopCriterium<T>[] stopCriteria) |
|||
{ |
|||
var result = Builder.DenseMatrix(input.RowCount, input.ColumnCount); |
|||
TrySolveIterative(input, result, solver, stopCriteria); |
|||
return result; |
|||
} |
|||
} |
|||
} |
|||
@ -1,66 +0,0 @@ |
|||
// <copyright file="Iterator.cs" company="Math.NET">
|
|||
// Math.NET Numerics, part of the Math.NET Project
|
|||
// http://numerics.mathdotnet.com
|
|||
// http://github.com/mathnet/mathnet-numerics
|
|||
// http://mathnetnumerics.codeplex.com
|
|||
//
|
|||
// Copyright (c) 2009-2010 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>
|
|||
|
|||
using MathNet.Numerics.LinearAlgebra.Single.Solvers.StopCriterium; |
|||
using MathNet.Numerics.LinearAlgebra.Solvers; |
|||
|
|||
namespace MathNet.Numerics.LinearAlgebra.Single.Solvers |
|||
{ |
|||
/// <summary>
|
|||
/// An iterator that is used to check if an iterative calculation should continue or stop.
|
|||
/// </summary>
|
|||
public static class Iterator |
|||
{ |
|||
|
|||
// TODO: Refactor
|
|||
|
|||
/// <summary>
|
|||
/// Creates the default stop criteria.
|
|||
/// </summary>
|
|||
public static IIterationStopCriterium<float>[] CreateDefaultStopCriteria() |
|||
{ |
|||
return new IIterationStopCriterium<float>[] |
|||
{ |
|||
new FailureStopCriterium(), |
|||
new DivergenceStopCriterium(), |
|||
new IterationCountStopCriterium<float>(), |
|||
new ResidualStopCriterium() |
|||
}; |
|||
} |
|||
|
|||
/// <summary>
|
|||
/// Creates a default iterator with all the default stop criteria.
|
|||
/// </summary>
|
|||
public static Iterator<float> CreateDefault() |
|||
{ |
|||
return new Iterator<float>(CreateDefaultStopCriteria()); |
|||
} |
|||
} |
|||
} |
|||
Loading…
Reference in new issue