IntervalsIntegration class abstract base

This class is extended by classes whose algorithms divide the integration bounds into smaller intervals to compute the result. There currently are three subclasses of IntervalsIntegration:

• TrapezoidalRule
• SimpsonRule
• MidpointRule

For a different approach that doesn't use intervals, see AdaptiveQuadrature.

Inheritance

• Object
• NumericalIntegration
• IntervalsIntegration

Implementers

• MidpointRule
• SimpsonRule
• TrapezoidalRule

Constructors

IntervalsIntegration({required String function, required double lowerBound, required double upperBound, required int intervals})

Creates a IntervalsIntegration object.

const

Properties

function → String

The function to be integrated on the given interval.

final, inherited

hashCode → int

The hash code for this object.

no setter, override

intervals → int

The number of parts in which the interval [lowerBound, upperBound] has to be split by the algorithm.

final

lowerBound → double

The lower bound of the integral.

final, inherited

runtimeType → Type

A representation of the runtime type of the object.

no setter, inherited

upperBound → double

The upper bound of the integral.

final, inherited

Methods

evaluateFunction(double x) → double

Evaluates the given function on the x point.

inherited

integrate() → ({List<double> guesses, double result})

Calculates the numerical value of the definite function integral between lowerBound and upperBound. Returns a Record object whose members are:

inherited

noSuchMethod(Invocation invocation) → dynamic

Invoked when a nonexistent method or property is accessed.

inherited

toString() → String

A string representation of this object.

override

Operators

operator ==(Object other) → bool

The equality operator.

override