C# 클래스 Accord.Math.Optimization.BinarySearch

Binary search root finding algorithm.
파일 보기 프로젝트 열기: accord-net/framework 1 사용 예제들

공개 메소드들

메소드 설명
BinarySearch ( double>.Func function, int a, int b ) : System

Constructs a new Binary search algorithm.
Find ( double>.Func function, int lowerBound, int upperBound, double value ) : int

Finds a value of a function in the interval [a;b]
Find ( double value ) : int

Attempts to find a root in the interval [a;b]
FindRoot ( ) : int

Attempts to find a root in the interval [a;b]

메소드 상세

BinarySearch() 공개 메소드

Constructs a new Binary search algorithm.
public BinarySearch ( double>.Func function, int a, int b ) : System
function double>.Func The function to be searched.
a int Start of search region.
b int End of search region.
리턴 System

Find() 공개 정적인 메소드

Finds a value of a function in the interval [a;b]
public static Find ( double>.Func function, int lowerBound, int upperBound, double value ) : int
function double>.Func The function to have its root computed.
lowerBound int Start of search region.
upperBound int End of search region.
value double The value to be looked for in the function.
리턴 int

Find() 공개 메소드

Attempts to find a root in the interval [a;b]
public Find ( double value ) : int
value double
리턴 int

FindRoot() 공개 메소드

Attempts to find a root in the interval [a;b]
public FindRoot ( ) : int
리턴 int