NMath includes classes for finding roots of univariate functions. A root-finding algorithm finds a value x for a given function f, such that f(x) = 0.
All NMath root-finding classes derive from the abstract base class RootFinderBase. The interface and behavior is the same as for MinimizerBase (Section 24.1)-iteration stops when either the decrease in function value is less than a specified error tolerance, or the specified maximum number of iterations is reached. The root-finding classes also implement one of the following interfaces:
This chapter describes how to use the root-finding classes.
TOC | Previous | Next | Index