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.
111 lines
5.2 KiB
111 lines
5.2 KiB
// <copyright file="IIterator.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>
|
|
|
|
namespace MathNet.Numerics.LinearAlgebra.Generic.Solvers
|
|
{
|
|
using System;
|
|
using System.Numerics;
|
|
using Status;
|
|
using StopCriterium;
|
|
|
|
/// <summary>
|
|
/// Defines the base interface for iterators that help control an iterative calculation.
|
|
/// </summary>
|
|
/// <typeparam name="T">Supported data types are double, single, <see cref="Complex"/>, and <see cref="Complex32"/>.</typeparam>
|
|
public interface IIterator<T>
|
|
#if !SILVERLIGHT
|
|
: ICloneable
|
|
#endif
|
|
where T : struct, IEquatable<T>, IFormattable
|
|
{
|
|
/// <summary>
|
|
/// Adds an <see cref="IIterationStopCriterium{T}"/> to the internal collection of stop-criteria. Only a
|
|
/// single stop criterium of each type can be stored.
|
|
/// </summary>
|
|
/// <param name="stopCriterium">The stop criterium to add.</param>
|
|
/// <exception cref="ArgumentNullException">Thrown if <paramref name="stopCriterium"/> is <see langword="null" />.</exception>
|
|
/// <exception cref="ArgumentException">Thrown if <paramref name="stopCriterium"/> is of the same type as an already stored criterium.</exception>
|
|
void Add(IIterationStopCriterium<T> stopCriterium);
|
|
|
|
/// <summary>
|
|
/// Removes the <see cref="IIterationStopCriterium{T}"/> from the internal collection.
|
|
/// </summary>
|
|
/// <param name="stopCriterium">The stop criterium that must be removed.</param>
|
|
void Remove(IIterationStopCriterium<T> stopCriterium);
|
|
|
|
/// <summary>
|
|
/// Indicates if the specific stop criterium is stored by the <see cref="IIterator{T}"/>.
|
|
/// </summary>
|
|
/// <param name="stopCriterium">The stop criterium.</param>
|
|
/// <returns><c>true</c> if the <see cref="IIterator{T}"/> contains the stop criterium; otherwise <c>false</c>.</returns>
|
|
bool Contains(IIterationStopCriterium<T> stopCriterium);
|
|
|
|
/// <summary>
|
|
/// Indicates to the iterator that the iterative process has been cancelled.
|
|
/// </summary>
|
|
/// <remarks>Does not reset the stop-criteria.</remarks>
|
|
void IterationCancelled();
|
|
|
|
/// <summary>
|
|
/// Determines the status of the iterative calculation based on the stop criteria stored
|
|
/// by the current <see cref="IIterator{T}"/>. Status is set to <c>Status</c> field of current object.
|
|
/// </summary>
|
|
/// <param name="iterationNumber">The number of iterations that have passed so far.</param>
|
|
/// <param name="solutionVector">The vector containing the current solution values.</param>
|
|
/// <param name="sourceVector">The right hand side vector.</param>
|
|
/// <param name="residualVector">The vector containing the current residual vectors.</param>
|
|
/// <remarks>
|
|
/// The individual iterators may internally track the progress of the calculation based
|
|
/// on the invocation of this method. Therefore this method should only be called if the
|
|
/// calculation has moved forwards at least one step.
|
|
/// </remarks>
|
|
void DetermineStatus(int iterationNumber, Vector<T> solutionVector, Vector<T> sourceVector, Vector<T> residualVector);
|
|
|
|
/// <summary>
|
|
/// Gets the current calculation status.
|
|
/// </summary>
|
|
/// <remarks><see langword="null" /> is not a legal value. Status should be set in <see cref="DetermineStatus"/> implementation.</remarks>.
|
|
ICalculationStatus Status { get; }
|
|
|
|
/// <summary>
|
|
/// Resets the <see cref="IIterator{T}"/> to the pre-calculation state.
|
|
/// </summary>
|
|
/// <remarks>
|
|
/// Note to implementers: Invoking this method should not clear the user defined
|
|
/// property values, only the state that is used to track the progress of the
|
|
/// calculation.
|
|
/// </remarks>
|
|
void ResetToPrecalculationState();
|
|
|
|
#if SILVERLIGHT
|
|
IIterator<double> Clone();
|
|
#endif
|
|
}
|
|
}
|
|
|