TOPICS
Search

Search Results for ""


1191 - 1200 of 1340 for Root Finding AlgorithmSearch Results
The elliptic lambda function lambda(tau) is a lambda-modular function defined on the upper half-plane by lambda(tau)=(theta_2^4(0,q))/(theta_3^4(0,q)), (1) where tau is the ...
Let E_1(x) be the En-function with n=1, E_1(x) = int_1^infty(e^(-tx)dt)/t (1) = int_x^infty(e^(-u)du)/u. (2) Then define the exponential integral Ei(x) by E_1(x)=-Ei(-x), (3) ...
Gaussian elimination is a method for solving matrix equations of the form Ax=b. (1) To perform Gaussian elimination starting with the system of equations [a_(11) a_(12) ... ...
The unique (modulo rotations) scalene triangle formed from three vertices of a regular heptagon, having vertex angles pi/7, 2pi/7, and 4pi/7. There are a number of amazing ...
A hex number, also called a centered hexagonal number, is given by H_n = 1+6T_n (1) = 3n^2+3n+1, (2) where T_n=n(n+1)/2 is the nth triangular number and the indexing with ...
The hyperbolic cosine is defined as coshz=1/2(e^z+e^(-z)). (1) The notation chx is sometimes also used (Gradshteyn and Ryzhik 2000, p. xxix). This function describes the ...
An idoneal number, also called a suitable number or convenient number, is a positive integer D for which the fact that a number is a monomorph (i.e., is expressible in only ...
The Jacobi polynomials, also known as hypergeometric polynomials, occur in the study of rotation groups and in the solution to the equations of motion of the symmetric top. ...
Replacing the logistic equation (dx)/(dt)=rx(1-x) (1) with the quadratic recurrence equation x_(n+1)=rx_n(1-x_n), (2) where r (sometimes also denoted mu) is a positive ...
The mean deviation (also called the mean absolute deviation) is the mean of the absolute deviations of a set of data about the data's mean. For a sample size N, the mean ...
1 ... 117|118|119|120|121|122|123 ... 134 Previous Next

...