![]() |
Open CASCADE Technology Reference Manual 8.0.0
|
Algorithms for finding all roots of a function in a given range. More...
#include <MathRoot_MultipleUtils.hxx>Namespaces | |
| namespace | MathRoot |
| Root finding algorithms for scalar functions. | |
Functions | |
| template<typename Function > | |
| MultipleResult | MathRoot::FindAllRoots (Function &theFunc, double theLower, double theUpper, const MultipleConfig &theConfig=MultipleConfig()) |
| Finds all real roots of a function within the range [theLower, theUpper]. Uses uniform sampling to detect sign changes, then refines each root using Brent's method. | |
| template<typename Function > | |
| MultipleResult | MathRoot::FindAllRootsWithDerivative (Function &theFunc, double theLower, double theUpper, const MultipleConfig &theConfig=MultipleConfig()) |
| Finds all real roots of a function with derivative within range [theLower, theUpper]. Can also detect extrema where function touches zero without crossing. | |
| template<typename Function > | |
| MultipleResult | MathRoot::FindAllRoots (Function &theFunc, double theLower, double theUpper, int theNbSamples) |
| Convenience alias using default configuration. | |
Algorithms for finding all roots of a function in a given range.
These algorithms sample the function to find sign changes, then refine each root using Brent's method. They can find multiple roots in a single call.