| Name : perl-Math-Brent
| |
| Version : 0.01
| Vendor : obs://build_opensuse_org/devel:languages:perl
|
| Release : 10.1
| Date : 2015-06-06 01:31:21
|
| Group : Development/Libraries/Perl
| Source RPM : perl-Math-Brent-0.01-10.1.src.rpm
|
| Size : 0.01 MB
| |
| Packager : (none)
| |
| Summary : Math::Brent perl module
|
Description :
This is an implementation of Brents method for One-Dimensional minimisation
of a function without using derivatives. This algorithm cleverly uses both
the Golden Section Search and parabolic interpolation.
The main function *Brent*, given a function reference *\\&func* and a
bracketing triplet of abcissas *$ax*, *$bx*, *$cx* (such that *$bx* is
between *$ax* and *$cx* and *func($bx)* is less than both *func($ax)* and
*func($cx)*), isolates the minimum to a fractional precision of about
*$tol* using Brents method. A maximum number of iterations *$itmax* may be
specified for this search - it defaults to 100. Returned is an array
consisting of the abcissa of the minum and the function value there.
The function *BracketMinimum*, given a function *\\&func* and distinct
initial points *$ax* and *$bx* searches in the downhill direction (defined
by the function as evaluated at the initial points) and returns an array of
the three points *$ax*, *$bx*, *$cx* which bracket the minimum of the
function and the function values at those points.
The function *Minimise1D* provides a simple interface to the above two
routines. Given a function *\\&func*, an initial guess for its minimum, and
its scaling (*$guess*,*$scale*) this routine isolates the minimum to a
fractional precision of about *$tol* using Brents method. A maximum number
of iterations *$itmax* may be specified for this search - it defaults to
100. It returns an array consisting of the abcissa of the minum and the
function value there.
|
RPM found in directory: /packages/linux-pbone/ftp5.gwdg.de/pub/opensuse/repositories/devel:/languages:/perl:/CPAN-M/openSUSE_Tumbleweed/noarch |
