keel.Algorithms.Preprocess.NoiseFilters.ANR

Class LinearSearchBrent

java.lang.Object

keel.Algorithms.Preprocess.NoiseFilters.ANR.LinearSearchBrent

public class LinearSearchBrent
extends java.lang.Object

 Brent's method is a complicated but popular root-finding algorithm combining the bisection method, 
 the secant method and inverse quadratic interpolation.
 
 In detail in:
 
  Brent (1973). Algorithms for Minimization without Derivatives. Prentice-Hall, Englewood Cliffs, NJ.
  

Since:

JDK1.4

Version:

1.0

Author:

Written by Luciano Sánchez (University of Oviedo) 27/02/2004, Modified by Enrique A. de la Cal (University of Oviedo) 13/12/2008

Constructor Summary

Constructors

Constructor and Description
LinearSearchBrent(FUN vf, double[][][] vdbus, double[][][] vxbus) Constructor for linear search based on Brent's method.

Method Summary

Modifier and Type	Method and Description
double	g(double alpha) Returns the error of the weights dSearch.
double	minimumSearch(Randomize r)

Methods inherited from class java.lang.Object

clone, equals, finalize, getClass, hashCode, notify, notifyAll, toString, wait, wait, wait

Constructor Detail

LinearSearchBrent

public LinearSearchBrent(FUN vf,
                         double[][][] vdbus,
                         double[][][] vxbus)

Constructor for linear search based on Brent's method.

Parameters:

vf - evaluation function.

vdbus - search direction matrix.

vxbus - start point matrix.

Method Detail

g

public double g(double alpha)

Returns the error of the weights dSearch.

Parameters:

alpha - the factor of modification of dSearch

Returns:

the error of the neural network xSearch

minimumSearch

public double minimumSearch(Randomize r)