TOPICS
Search

Search Results for ""


71 - 80 of 521 for Logarithmic ExpressionSearch Results
Angle addition formulas express trigonometric functions of sums of angles alpha+/-beta in terms of functions of alpha and beta. The fundamental formulas of angle addition in ...
The Weingarten equations express the derivatives of the normal vector to a surface using derivatives of the position vector. Let x:U->R^3 be a regular patch, then the shape ...
If a is an arbitrary integer relatively prime to n and g is a primitive root of n, then there exists among the numbers 0, 1, 2, ..., phi(n)-1, where phi(n) is the totient ...
A generalization of the binomial coefficient whose notation was suggested by Knuth, |_n; k]=(|_n]!)/(|_k]!|_n-k]!), (1) where |_n] is a Roman factorial. The above expression ...
The "natural exponential function" is the name sometimes given in elementary contexts to the function f(x)=e^x, where e =2.718... is the base of the natural logarithm. While ...
B-trees were introduced by Bayer (1972) and McCreight. They are a special m-ary balanced tree used in databases because their structure allows records to be inserted, ...
The number of binary bits necessary to represent a number, given explicitly by BL(n) = 1+|_lgn_| (1) = [lg(n+1)], (2) where [x] is the ceiling function, |_x_| is the floor ...
The ratio C of the largest to smallest singular value in the singular value decomposition of a matrix. The base-b logarithm of C is an estimate of how many base-b digits are ...
The elliptic exponential function eexp_(a,b)(u) gives the value of x in the elliptic logarithm eln_(a,b)(x)=1/2int_infty^x(dt)/(sqrt(t^3+at^2+bt)) for a and b real such that ...
The fast Fourier transform (FFT) is a discrete Fourier transform algorithm which reduces the number of computations needed for N points from 2N^2 to 2NlgN, where lg is the ...
1 ... 5|6|7|8|9|10|11 ... 53 Previous Next

...