Mathemathics Framework

<?xml version="1.0"?>
<doc>
<assembly>
<name>
MathUtilities
</name>
</assembly>
<members>
<member name="P:MathUtilities.FindComplexRootUtil.KnownAreas">
	<summary>
 Areas conocidas donde al menos hay una raiz
 </summary>
	<value></value>
	<returns></returns>
	<remarks></remarks>
</member><member name="M:MathUtilities.FindComplexRootUtil.FRNewtonRaphsonSafe(BV.Math.Areaf,BV.Math.OperDelegateUU,BV.Math.OperDelegateDependentUAcc)">
	<summary>
 Busca la raiz mas cercana utilizando Newton Raphson en 2D
 </summary>
	<param name="Area"></param>
	<param name="Calc"></param>
	<param name="Derivade"></param>
	<returns></returns>
	<remarks></remarks>
</member><member name="M:MathUtilities.FindComplexRootUtil.BrackedOut(BV.Math.ComplexUndefinied,BV.Math.ComplexUndefinied,BV.Math.OperDelegateUU)">
	<summary>
 Given a function func and an initial guessed range x1 to x2, the routine expands the range
 geometrically until a root is bracketed by the returned values x1 and x2 (in which case zbrac
 returns 1) or until the range becomes unacceptably large (in which case zbrac returns 0).
 false si hay un error
 </summary>
	<param name="X1"></param>
	<param name="X2"></param>
	<param name="Calc"></param>
	<returns></returns>
	<remarks></remarks>
</member><member name="M:MathUtilities.BVMathDelegate.CalcImaginary(System.Single)">
	<summary>
 calcula el valor de Y=f(x) para el valor indicado de x
 devuelve la parte Imaginaria
 28/10
 </summary>
	<param name="s"></param>
	<returns></returns>
	<remarks></remarks>
</member><member name="P:MathUtilities.FindRootUtil.Accuracy">
	<summary>
 Nivel de exactitud utilizado para el cálculo de la raíz
 </summary>
	<value></value>
	<returns></returns>
	<remarks></remarks>
</member><member name="P:MathUtilities.FindRootUtil.Iterations">
	<summary>
 Número de iteraciones realizadas para obtener el valor deseado de la raíz
 </summary>
	<value></value>
	<returns></returns>
	<remarks></remarks>
</member><member name="P:MathUtilities.FindRootUtil.RootValue">
	<summary>
 Valor encontrado de la Raíz
 </summary>
	<value></value>
	<returns></returns>
	<remarks></remarks>
</member><member name="P:MathUtilities.FindRootUtil.RootFounded">
	<summary>
 Es True si la raíz fue encontrada en el intervalo dado
 con las condiciones dadas
 </summary>
	<value></value>
	<returns></returns>
	<remarks></remarks>
</member><member name="P:MathUtilities.FindRootUtil.Range">
	<summary>
 Límites entre los cuales se buscará la raíz de la función especificada
 </summary>
	<value></value>
	<returns></returns>
	<remarks></remarks>
</member><member name="P:MathUtilities.FindRootUtil.KnownRanges">
	<summary>
 Intervalos conocidos donde al menos hay una raíz
 </summary>
	<value></value>
	<returns></returns>
	<remarks></remarks>
</member><member name="P:MathUtilities.FindRootUtil.KnownRangesCount">
	<summary>
 Número de intervalos conocidos donde al menos hay una raíz
 </summary>
	<value></value>
	<returns></returns>
	<remarks></remarks>
</member><member name="P:MathUtilities.FindRootUtil.BracketIterations">
	<summary>
 Máximo numero de iteraciones permitidas en la búsqueda de intervalos con raices
 </summary>
	<value></value>
	<returns></returns>
	<remarks></remarks>
</member><member name="P:MathUtilities.FindRootUtil.BracketsNumber">
	<summary>
 Número de intervalos con raíces a buscar
 </summary>
	<value></value>
	<returns></returns>
	<remarks></remarks>
</member><member name="P:MathUtilities.FindRootUtil.BracketStep">
	<summary>
 Paso utilizado en la determinación de los intervalos que contienen raices
 </summary>
	<value></value>
	<returns></returns>
	<remarks></remarks>
</member><member name="M:MathUtilities.FindRootUtil.BrackedIn(BV.Math.RangeF[],BV.Math.OperSingleDelegate)">
	<summary>
 Busca intervalos que contienen raíces en la función dada, utilizando 
 el rango y especificaciones internas de la instancia
 </summary>
	<param name="Ranges"></param>
	<param name="Calc"></param>
	<remarks></remarks>
</member><member name="M:MathUtilities.FindRootUtil.BrackedIn(BV.Math.RangeF[],System.Int32,System.Int32,BV.Math.OperSingleDelegate)">
	<summary>
 Given a function fx defined on the interval from x1-x2 subdivide the interval into n equally
 spaced segments, and search for zero crossings of the function. nb is input as the maximum number
 of roots sought, and is reset to the number of bracketing pairs xb1[1..nb], xb2[1..nb]
 that are found.
 retorna 1 si acota a la singularidad  
 </summary>
	<param name="Ranges"></param>
	<param name="Steps"></param>
	<param name="MaxIterations"></param>
	<param name="Calc"></param>
	<remarks></remarks>
</member><member name="M:MathUtilities.FindRootUtil.BrackedOut(System.Single,System.Single,BV.Math.OperSingleDelegate)">
	<summary>
 Given a function func and an initial guessed range x1 to x2, the routine expands the range
 geometrically until a root is bracketed by the returned values x1 and x2 (in which case zbrac
 returns 1) or until the range becomes unacceptably large (in which case zbrac returns 0).
 false si hay un error
 </summary>
	<param name="X1"></param>
	<param name="X2"></param>
	<param name="Calc"></param>
	<returns></returns>
	<remarks></remarks>
</member><member name="T:MathUtilities.FindRootUtil">
	<summary>
 Permite mediante diversos métodos hallar Raices de funciones
 que pueden ser de variable compleja
 </summary>
	<remarks></remarks>
</member>
</members>
</doc>