TOPICS
Search

Search Results for ""


321 - 330 of 1788 for Finite_difference_methodSearch Results
Given two paired sets X_i and Y_i of n measured values, the paired t-test determines whether they differ from each other in a significant way under the assumptions that the ...
The term "recursive function" is often used informally to describe any function that is defined with recursion. There are several formal counterparts to this informal ...
The truncated octahedral graph is the cubic Archimedean graph on 24 nodes and 36 edges that is the skeleton of the truncated octahedron. It is isomorphic to the Bruhat graph ...
In an integral domain R, the decomposition of a nonzero noninvertible element a as a product of prime (or irreducible) factors a=p_1...p_n, (1) is unique if every other ...
A generalized continued fraction is an expression of the form b_0+(a_1)/(b_1+(a_2)/(b_2+(a_3)/(b_3+...))), (1) where the partial numerators a_1,a_2,... and partial ...
Transfinite induction, like regular induction, is used to show a property P(n) holds for all numbers n. The essential difference is that regular induction is restricted to ...
Probability and Statistics
The simple first-order difference equation y_(t+1)-Ay_t=B, (1) where A = -(m_s)/(m_d) (2) B = (b_d-b_s)/(m_d) (3) and D_t = -m_dp_t+b_d (4) S_(t+1) = m_sp_t+b_s (5) are the ...
The base-4 method of counting in which only the digits 0, 1, 2, and 3 are used. The illustration above shows the numbers 0 to 63 represented in quaternary, and the following ...
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 ...
1 ... 30|31|32|33|34|35|36 ... 179 Previous Next

...