/**
 * Brent's root finding and minimization algorithm.
 *
 * In numerical analysis, Brent's method is a complicated but popular root-finding
 * algorithm combining the bisection method, the secant method and inverse quadratic
 * interpolation. It has the reliability of bisection but it can be as quick as some
 * of the less reliable methods. The idea is to use the secant method or inverse quadratic
 * interpolation if possible, because they converge faster, but to fall back to the more
 * robust bisection method if necessary. Brent's method is due to Richard Brent (1973)
 * and builds on an earlier algorithm of Theodorus Dekker (1969).
 *
 * The algorithms implemented in this class are based on the original C source code
 * available in Netlib (http://www.netlib.org/c/brent.shar) by Oleg Keselyov, 1991.
 *
 * References:
 *     R.P. Brent (1973). Algorithms for Minimization without Derivatives, Chapter 4.
 *     Prentice-Hall, Englewood Cliffs, NJ. ISBN 0-13-022335-2.
 *
 * Searches the interval from *lowerLimit* to *upperLimit*
 * for a root (i.e., zero) of the function *func* with respect to
 * its first argument using Brent's method root-finding algorithm.
 *
 * Translated from zeroin.c in http://www.netlib.org/c/brent.shar.
 *
 * Copyright (c) 2012 Borgar Thorsteinsson <borgar@borgar.net>
 * MIT License, http://www.opensource.org/licenses/mit-license.php
 *
 * @returns an estimate for the root within accuracy.
 */
export declare function uniroot(
/** function for which the root is sought */
func: (n: number) => number, 
/** the lower point of the interval to be searched */
lowerLimit: number, 
/** the upper point of the interval to be searched */
upperLimit: number, 
/** the desired accuracy (convergence tolerance) */
errorTol?: number | undefined, 
/** the maximum number of iterations */
maxIter?: number | undefined): number;
//# sourceMappingURL=uniroot.d.ts.map