+ Complex32 x = new Complex32(1f,2f);
+ Complex32 y = Complex32.FromPolarCoordinates(1f, Math.Pi);
+ Complex32 z = (x + y) / (x - y);
+
+
+ // a, b of type Complex32
+ a.Conjugate = b;
+
+ is equivalent to
+
+ // a, b of type Complex32
+ a = b.Conjugate
+
+
+ long x,y,d;
+ d = Fn.GreatestCommonDivisor(45,18,out x, out y);
+ -> d == 9 && x == 1 && y == -2
+
+ The
+ long x,y,d;
+ d = Fn.GreatestCommonDivisor(45,18,out x, out y);
+ -> d == 9 && x == 1 && y == -2
+
+ The + 1, 2, 3 + 4, 5, 6 will be returned as 1, 4, 7, 2, 5, 8, 3, 6, 9 + 7, 8, 9 +
+ 1, 2, 3 + 4, 5, 6 will be returned as 1, 2, 3, 4, 5, 6, 7, 8, 9 + 7, 8, 9 +
+ 1, 2, 3 + 4, 5, 6 will be returned as 1, 4, 7, 2, 5, 8, 3, 6, 9 + 7, 8, 9 +
+ 1, 2, 3 + 4, 5, 6 will be returned as 1, 2, 3, 4, 5, 6, 7, 8, 9 + 7, 8, 9 +
Xn = a * Xn−3 + c mod 2^32
+ http://www.jstatsoft.org/v08/i14/paper
+ x -> exp(x)-1
+ exp(power)-1
.(a,b) -> sqrt(a^2 + b^2)
+ sqrt(a2 + b2)
without underflow/overflow.(a,b) -> sqrt(a^2 + b^2)
+ sqrt(a2 + b2)
without underflow/overflow.(a,b) -> sqrt(a^2 + b^2)
+ sqrt(a2 + b2)
without underflow/overflow.(a,b) -> sqrt(a^2 + b^2)
+ sqrt(a2 + b2)
without underflow/overflow.+ N-1 + - ' + y = > coef[i] T (x/2) + - i + i=0 ++ Coefficients are stored in reverse order, i.e. the zero + order term is last in the array. Note N is the number of + coefficients, not the order. + + If coefficients are for the interval a to b, x must + have been transformed to x -> 2(2x - b - a)/(b-a) before + entering the routine. This maps x from (a, b) to (-1, 1), + over which the Chebyshev polynomials are defined. + + If the coefficients are for the inverted interval, in + which (a, b) is mapped to (1/b, 1/a), the transformation + required is x -> 2(2ab/x - b - a)/(b-a). If b is infinity, + this becomes x -> 4a/x - 1. + + SPEED: + + Taking advantage of the recurrence properties of the + Chebyshev polynomials, the routine requires one more + addition per loop than evaluating a nested polynomial of + the same degree. +