Expand description
Automatic scalar root and minimum bracketing. Automatic scalar root and minimum bracketing.
Bracketing is an explicit preliminary search, with its own limits and
evaluation counts. RootBracketer finds distinct endpoints suitable for
crate::BrentRoot or the other direct root solvers. MinimumBracketer
finds three points suitable for initializing a scalar minimizer. Solvers
reevaluate the supplied points; add the two stages’ counts when reporting
total work. A discovered search interval is not a global-optimality claim.
Re-exports§
pub use minimum::MinimumBracketResult;pub use minimum::MinimumBracketer;pub use root::RootBracketResult;pub use root::RootBracketer;
Modules§
Enums§
- Bracket
Error - Invalid initial geometry or a failed bracket-search evaluation.
- Bracket
Termination Reason - Why an automatic bracket search stopped.