SimpsonIntegrator<T> Class

public sealed class SimpsonIntegrator<T> : NumericalIntegrator<T>
where T : Object, INumber<T>

Public NotInheritable Class SimpsonIntegrator(Of T As {Object, INumber(Of T)})
	Inherits NumericalIntegrator(Of T)

generic<typename T>
where T : Object, INumber<T>
public ref class SimpsonIntegrator sealed : public NumericalIntegrator<T>

[<SealedAttribute>]
type SimpsonIntegrator<'T when 'T : Object and INumber<'T>> = 
    class
        inherit NumericalIntegrator<'T>
    end

Inheritance

Object  →  ManagedIterativeAlgorithm<T, T, SolutionReport<T, T>>  →  IterativeAlgorithm<T>  →  NumericalIntegrator<T>  →  SimpsonIntegrator<T>

Type Parameters

T

The classic Simpson's rule is one of the simplest numerical integration algorithms around. This algorithm is of order 3. In each iteration, the number of points is doubled. The difference between successive approximations is taken as the estimate for the integration error.

Because the order of the algorithm is so low, use of this algorithm is not recommended. It is here more for historical reasons than for its practical applications.

Reference