Home | Trees | Indices | Help |
---|
|
The :mod:`parsimony.algorithms.utils` module contains auxiliary algorithms.
Algorithms may not store states. I.e., if they are classes, do not keep references to objects with state in the algorithm objects. It should be possible to copy and share algorithms between e.g. estimators, and thus they should not depend on any state.
Created on Thu Mar 31 17:25:01 2014
Copyright (c) 2013-2014, CEA/DSV/I2BM/Neurospin. All rights reserved.
Author: Tommy Löfstedt
License: BSD 3-clause.
|
|||
Info Enum-like class for information constants. |
|||
Bisection Finds a root of the function assumed to be on the line between two points. |
|||
NewtonRaphson Finds a root of the function assumed to be in the vicinity of a given point. |
|||
BacktrackingLineSearch Finds a step length a that fulfills a given descent criterion. |
|
|||
__package__ =
|
Home | Trees | Indices | Help |
---|
Generated by Epydoc 3.0.1 on Mon Apr 6 23:52:10 2015 | http://epydoc.sourceforge.net |