TOPICS
Search

Search Results for ""


2451 - 2460 of 2945 for Pie charts and circle graphsSearch Results
The case of the Weierstrass elliptic function with invariants g_2=1 and g_3=0. In this case, the half-periods are given by (omega_1,omega_2)=(omega,iomega), where omega is ...
Formulas obtained from differentiating Newton's forward difference formula, where R_n^'=h^nf^((n+1))(xi)d/(dp)(p; n+1)+h^(n+1)(p; n+1)d/(dx)f^((n+1))(xi), (n; k) is a ...
This problem is NP-complete (Garey and Johnson 1983).
An algorithm for finding roots which retains that prior estimate for which the function value has opposite sign from the function value at the current best estimate of the ...
If p>1, then Minkowski's integral inequality states that Similarly, if p>1 and a_k, b_k>0, then Minkowski's sum inequality states that [sum_(k=1)^n|a_k+b_k|^p]^(1/p) ...
The second-order ordinary differential equation x^2(d^2y)/(dx^2)+x(dy)/(dx)-(x^2+n^2)y=0. (1) The solutions are the modified Bessel functions of the first and second kinds, ...
The modified spherical Bessel differential equation is given by the spherical Bessel differential equation with a negative separation constant, ...
The multinomial coefficients (n_1,n_2,...,n_k)!=((n_1+n_2+...+n_k)!)/(n_1!n_2!...n_k!) (1) are the terms in the multinomial series expansion. In other words, the number of ...
Multivariate analysis is the simultaneous statistical consideration of relationships among many measured properties of a given system (Gould 1996, p. 42).
A problem which is both NP (verifiable in nondeterministic polynomial time) and NP-hard (any NP-problem can be translated into this problem). Examples of NP-hard problems ...
1 ... 243|244|245|246|247|248|249 ... 295 Previous Next

...