Свойство | Type | Description | |
---|---|---|---|
BernoulliNumbers | Double[] | ||
LanczosD | Double[] | ||
LogPI | Double | ||
LogTwo | Double | ||
SqrtPI | Double | ||
SqrtThree | Double | ||
SqrtTwo | Double | ||
SqrtTwoPI | Double | ||
TwoPIpow | Double[] |
Méthode | Description | |
---|---|---|
BinomialCoefficient ( Double n, Double k ) : Double |
Computes the real binomial coefficient (almost general) given two values, n choose k.
|
|
BinomialCoefficient ( ScalarValue n, ScalarValue k ) : ScalarValue |
Computes the complex binomial coefficient (very general) given two values, n choose k.
|
|
ChebEval ( ChebSeries cs, Double x ) : Double |
Evaluate a real Chebyshev polynomial on an interval, given the coefficients.
|
|
ChebEval ( |
Evaluate a real Chebyshev polynomial on an interval, given the coefficients.
|
|
ChebEval ( ChebSeries cs, ScalarValue z ) : ScalarValue |
Evaluate a complex Chebyshev polynomial on an interval, given the coefficients.
|
|
ComputeRoots ( |
computes the N-th roots of unity, which are the factors in a length-N Fourier transform.
|
|
Factorial ( |
Computes the factorial of an integer and returns a double with the result.
|
|
GCD ( |
Computes the greatest common divisor of two numbers.
|
|
Hypot ( Double a, Double b ) : Double |
Computes the length of a right triangle's hypotenuse.
|
|
IsPrimeNumber ( |
Returns a boolean if the given integer is a prime number.
|
|
PowMod ( |
Computes a power of an integer in modular arithmetic.
|
|
Power ( ScalarValue z, |
Takes the power of z to an integer n.
|
Méthode | Description | |
---|---|---|
IsProbablyPrime ( |
public static BinomialCoefficient ( Double n, Double k ) : Double | ||
n | Double | We have n elements. |
k | Double | We choose k elements. |
Résultat | Double |
public static BinomialCoefficient ( ScalarValue n, ScalarValue k ) : ScalarValue | ||
n | ScalarValue | We have n elements. |
k | ScalarValue | We choose k elements. |
Résultat | ScalarValue |
public static ChebEval ( ChebSeries cs, Double x ) : Double | ||
cs | ChebSeries | The coefficients to consider. |
x | Double | The real evaluation argument. |
Résultat | Double |
public static ChebEval ( |
||
n | The order for the summation of the polynomial. | |
coefficients | Double | The coefficients to consider. |
x | Double | The real evaluation argument. |
Résultat | Double |
public static ChebEval ( ChebSeries cs, ScalarValue z ) : ScalarValue | ||
cs | ChebSeries | The coefficients to consider. |
z | ScalarValue | The complex evaluation argument. |
Résultat | ScalarValue |
public static ComputeRoots ( |
||
N | What number of roots. | |
sign | The sign to take. | |
Résultat | ScalarValue[] |
public static Factorial ( |
||
n | The argument to take the factorial. | |
Résultat | Double |
public static GCD ( |
||
A | The first number. | |
B | The second number. | |
Résultat |
public static Hypot ( Double a, Double b ) : Double | ||
a | Double | The length of one side. |
b | Double | The length of another side. |
Résultat | Double |
public static IsPrimeNumber ( |
||
n | The integer to examine. | |
Résultat | System.Boolean |
public static PowMod ( |
||
b | The base, which must be positive. | |
e | The exponent, which must be positive. | |
m | The modulus, which must be positive. | |
Résultat |
public static Power ( ScalarValue z, |
||
z | ScalarValue | The complex value z in C. |
n | The power n in N. | |
Résultat | ScalarValue |
public static Double[] BernoulliNumbers | ||
Résultat | Double[] |