Search Results for ""
171 - 180 of 454 for Numerical_stabilitySearch Results
![](/common/images/search/spacer.gif)
Clairaut's difference equation is a special case of Lagrange's equation (Sokolnikoff and Redheffer 1958) defined by u_k=kDeltau_k+F(Deltau_k), (1) or in "x notation," ...
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 approximation of a piecewise monotonic function f by a polynomial with the same monotonicity. Such comonotonic approximations can always be accomplished with nth degree ...
An implicit method for solving an ordinary differential equation that uses f(x_n,y_n) in y_(n+1). In the case of a heat equation, for example, this means that a linear system ...
An exponential moving average, also known as an exponentially weighted moving average and abbreviated EMA or EWMA, is a moving filter that applied weights to older values in ...
Let T_n(x) be an arbitrary trigonometric polynomial T_n(x)=1/2a_0+{sum_(k=1)^n[a_kcos(kx)+b_ksin(kx)]} (1) with real coefficients, let f be a function that is integrable over ...
The forward difference is a finite difference defined by Deltaa_n=a_(n+1)-a_n. (1) Higher order differences are obtained by repeated operations of the forward difference ...
A root-finding algorithm which makes use of a third-order Taylor series f(x)=f(x_n)+f^'(x_n)(x-x_n)+1/2f^('')(x_n)(x-x_n)^2+.... (1) A root of f(x) satisfies f(x)=0, so 0 ...
A root-finding algorithm also known as the tangent hyperbolas method or Halley's rational formula. As in Halley's irrational formula, take the second-order Taylor series ...
A matrix H with elements H_(ij)=(i+j-1)^(-1) (1) for i,j=1, 2, ..., n. Hilbert matrices are implemented in the Wolfram Language by HilbertMatrix[m, n]. The figure above shows ...
![](/common/images/search/spacer.gif)
...