DME Component Libraries for .NET 2025 r1
Library Reference
AGI.Foundation.NumericalMethods.Advanced
AdaptiveNumericalIntegrator Class
BehaviorWhenOnThreshold Enumeration
BracketToward Enumeration
BrentFindExtremum Class
BrentFindRoot Class
BrentSolutionType Enumeration
BurdenFairesAdaptiveQuadrature Class
BurdenFairesAdaptiveQuadrature.Integrand Delegate
Combinatorics Class
ConvergenceCriteria Enumeration
DependentVariableDerivatives Class
DependentVariableDifferentialEquation Class
DoubleFunctionCollection Class
DoubleFunctionExplorerProgress Class
DoubleFunctionExtremumFound Class
DoubleFunctionExtremumIndicated Class
DoubleFunctionFinding Class
DoubleFunctionThresholdCollection Class
DoubleFunctionThresholdCrossingFound Class
DoubleFunctionThresholdCrossingIndicated Class
DurationFunctionCollection Class
DurationFunctionExplorerProgress Class
DurationFunctionExtremumFound Class
DurationFunctionExtremumIndicated Class
DurationFunctionFinding Class
DurationFunctionThresholdCollection Class
DurationFunctionThresholdCrossingFound Class
DurationFunctionThresholdCrossingIndicated Class
ExtremumKind Enumeration
GoldenSectionFindExtremum Class
HermitePolynomialApproximation Class
IDoubleFunctionSampler Interface
IDurationFunctionSampler Interface
IJulianDateFunctionSampler Interface
InterpolationAlgorithm Class
Interpolator Class
IPartialDifferentiable Interface
JulianDateFunctionCollection Class
JulianDateFunctionExplorerProgress Class
JulianDateFunctionExtremumFound Class
JulianDateFunctionExtremumIndicated Class
JulianDateFunctionFinding Class
JulianDateFunctionThresholdCollection Class
JulianDateFunctionThresholdCrossingFound Class
JulianDateFunctionThresholdCrossingIndicated Class
LagrangeOrbitVariationOfParameters Class
LagrangePolynomialApproximation Class
LinearApproximation Class
LineSearchSettings Class
MultipleStepIntegrator Class
MultivariableFunctionSolverWarning Class
MultivariableFunctionWarning Class
NewtonFindRoot Class
NewtonRootType Enumeration
OrdinaryDifferentialEquationFunction Delegate
OrdinaryDifferentialEquationSystem Class
PartialDerivativesEvaluator Class
PartialDerivativesFixed Class
PartialDerivativesSum Class
RealPolynomial Class
RungeKuttaAdaptiveStepIntegrator Class
RungeKuttaAlgorithm Class
RungeKuttaFixedStepIntegrator Class
SolvableMultivariableFunctionOperations Class
ThresholdCrossingSolutionType Enumeration
TimeIntervalFinderProgress Class
Click or drag to resize

BracketToward Enumeration

Defines the behavior of a root finder such as BrentFindRoot when a sampled function value exactly equals zero and the root finder's ConvergenceCriteria requires convergence on the independent variable.

Namespace:  AGI.Foundation.NumericalMethods.Advanced
Assembly:  AGI.Foundation.Core (in AGI.Foundation.Core.dll) Version: 25.1.421.0 (25.1.421.0)
Syntax
Copy
public enum BracketToward
Members
  Member nameDescription
Earliest The new bracket will be formed from the just-sampled zero and the side of the previous bracket with a smaller independent variable value. The identified root will represent the first time (within tolerance) that the function is zero.
Latest The new bracket will be formed from the just-sampled zero and the side of the previous bracket with a larger independent variable value. The identified root will represent the last time (within tolerance) that the function is zero.
Positive The new bracket will be formed from the just-sampled zero and the side of the previous bracket with a positive sampled function value. The identified root will represent the first time (within tolerance) that the function is zero after being negative, or the last time that it is zero before going negative.
Negative The new bracket will be formed from the just-sampled zero and the side of the previous bracket with a negative sampled function value. The identified root will represent the first time (within tolerance) that the function is zero after being positive, or the last time that it is zero before going positive.
See Also