BoundedIterativeProcess

Abstract base for root-finding algorithms operating within a bounded search interval. Parallel branch to RootFinder directly under IterativeProcess. Does not impose the sign-change (bracketing) constraint — concrete subclasses that require it assert it in their own init blocks via RootFinder.Companion.hasRoot.

Hierarchy

IterativeProcess<T>
    └── FunctionalIterator          (existing — untouched)
            └── RootFinder          (existing — untouched)
    └── BoundedIterativeProcess<T>  (this class)
            └── StochasticApproximationRootFinder

Stopping

• hasNextStep returns false once maxIterations is reached → COMPLETED_ALL_STEPS.

• Convergence is signalled by calling stop in checkStoppingCondition → MET_STOPPING_CONDITION.

• Degenerate boundary conditions call stop with a diagnostic message → same status.

Observability note

Concrete subclasses may supplement IterativeProcess's Observable notification with typed Emitter pairs via Kotlin interface delegation — one for per-step data, one for lifecycle transitions. See StochasticApproximationRootFinder.

Parameters

Inheritors