Extreme Optimization™: Complexity made simple.

Numerical Components
for .NET

  • Home
  • •
  • Features
    • Math Library
    • Vector and Matrix Library
    • Statistics Library
    • Performance
    • Usability
  • •
  • Documentation
    • Introduction
    • Math Library User's Guide
    • Vector and Matrix Library User's Guide
    • Statistics Library User's Guide
    • Reference
  • •
  • Support
    • Frequently Asked Questions
    • QuickStart Samples
    • Sample Applications
    • Downloads
  • •
  • Blog
  • •
  • Company
    • About us
    • Testimonials
    • Customers
    • Press Releases
    • Careers
    • Contact us
Introduction
Expand Mathematics Library User's GuideMathematics Library User's Guide
Expand Vector and Matrix Library User's GuideVector and Matrix Library User's Guide
Expand Statistics Library User's GuideStatistics Library User's Guide
Expand ReferenceReference
  • Home
  • Documentation
  • Reference
  • Extreme.Mathematics.Calculus Namespace
  • MidpointIntegrator Class
    • Members
    • MidpointIntegrator Constructor
    • Methods
    • Properties
Collapse imageExpand ImageCopy imageCopyHover image
       




MidpointIntegrator Class

Members  See Also 
Represents a numerical integrator that uses the mid-point rule.

Namespace:  Extreme.Mathematics.Calculus
Assembly:  Extreme.Numerics.Net20 (in Extreme.Numerics.Net20.dll) Version: 3.6.10055.0 (3.6.10077.0)

Syntax

C#
public sealed class MidpointIntegrator : NumericalIntegrator
Visual Basic (Declaration)
Public NotInheritable Class MidpointIntegrator _
	Inherits NumericalIntegrator
Visual C++
public ref class MidpointIntegrator sealed : public NumericalIntegrator
F#
[<SealedAttribute>]
type MidpointIntegrator =  
    class
        inherit NumericalIntegrator
    end

Remarks

The right point rule is one of the simplest numerical integration algorithms around. The interval is divided into smaller intervals, and the function value in the middle of the subinterval is taken as an approximation for the function over the entire subinterval.

This algorithm is of order 1. 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 generally recommended for general use. The fact that previous integration points are not re-used makes this algorithm extra inefficient. However, it does provide a unique feature in that can produce absolute bounds on the value of the integral of some functions. It produces an upper bound for concave integrands, and a lower bound for convex integrands. Complementary bounds are produced by the TrapezoidIntegrator.

Inheritance Hierarchy

System..::.Object
  Extreme.Mathematics.Algorithms..::.IterativeAlgorithm<(Of <(<'Double>)>)>
    Extreme.Mathematics.Calculus..::.NumericalIntegrator
      Extreme.Mathematics.Calculus..::.MidpointIntegrator

See Also

MidpointIntegrator Members
Extreme.Mathematics.Calculus Namespace
Extreme.Mathematics.Calculus..::.TrapezoidIntegrator

Send comments on this topic to support@extremeoptimization.com

Copyright © 2003-2010, Extreme Optimization. All rights reserved.
Extreme Optimization, Complexity made simple, M#, and M Sharp are trademarks of ExoAnalytics Inc.
Microsoft, Visual C#, Visual Basic, Visual Studio, Visual Studio.NET, and the Optimized for Visual Studio logo
are registered trademarks of Microsoft Corporation.