About the Project
NIST

backward

AdvancedHelp

(0.000 seconds)

1—10 of 20 matching pages

1: 5.21 Methods of Computation
An effective way of computing Γ ( z ) in the right half-plane is backward recurrence, beginning with a value generated from the asymptotic expansion (5.11.3). …For the left half-plane we can continue the backward recurrence or make use of the reflection formula (5.5.3). …
2: 16.25 Methods of Computation
In these cases integration, or recurrence, in either a forward or a backward direction is unstable. …
3: Browsers
Although we have attempted to follow standards and maintain backwards compatibility with older browsers, you will generally get the best results by upgrading to the latest version of your preferred browser.
4: 11.13 Methods of Computation
The solution K ν ( x ) needs to be integrated backwards for small x , and either forwards or backwards for large x depending whether or not ν exceeds 1 2 . For M ν ( x ) both forward and backward integration are unstable, and boundary-value methods are required (§3.7(iii)). … In consequence forward recurrence, backward recurrence, or boundary-value methods may be necessary. …
5: 3.6 Linear Difference Equations
Because the recessive solution of a homogeneous equation is the fastest growing solution in the backward direction, it occurred to J. …A “trial solution” is then computed by backward recursion, in the course of which the original components of the unwanted solution g n die away. … Then w n is generated by backward recursion from … Thus in the inhomogeneous case it may sometimes be necessary to recur backwards to achieve stability. …
6: 18.1 Notation
Backward differences:
x ( f ( x ) ) = f ( x ) - f ( x - 1 ) ,
x n + 1 ( f ( x ) ) = x ( x n ( f ( x ) ) ) .
7: 7.22 Methods of Computation
See Gautschi (1977a), where forward and backward recursions are used; see also Gautschi (1961). …
8: 18.22 Hahn Class: Recurrence Relations and Differences
18.22.20 x ( ( α + 1 ) x ( β + 1 ) N - x x ! ( N - x ) ! Q n ( x ; α , β , N ) ) = N + 1 β ( α ) x ( β ) N + 1 - x x ! ( N + 1 - x ) ! Q n + 1 ( x ; α - 1 , β - 1 , N + 1 ) .
18.22.22 x ( ( N x ) p x ( 1 - p ) N - x K n ( x ; p , N ) ) = ( N + 1 x ) p x ( 1 - p ) N - x K n + 1 ( x ; p , N + 1 ) .
18.22.24 x ( ( β ) x c x x ! M n ( x ; β , c ) ) = ( β - 1 ) x c x x ! M n + 1 ( x ; β - 1 , c ) .
18.22.26 x ( a x x ! C n ( x ; a ) ) = a x x ! C n + 1 ( x ; a ) .
9: 10.74 Methods of Computation
In the interval 0 < x < ν , J ν ( x ) needs to be integrated in the forward direction and Y ν ( x ) in the backward direction, with initial values for the former obtained from the power-series expansion (10.2.2) and for the latter from asymptotic expansions (§§10.17(i) and 10.20(i)). … Similarly, to maintain stability in the interval 0 < x < the integration direction has to be forwards in the case of I ν ( x ) and backwards in the case of K ν ( x ) , with initial values obtained in an analogous manner to those for J ν ( x ) and Y ν ( x ) . … Then J n ( x ) and Y n ( x ) can be generated by either forward or backward recurrence on n when n < x , but if n > x then to maintain stability J n ( x ) has to be generated by backward recurrence on n , and Y n ( x ) has to be generated by forward recurrence on n . …
10: 29.20 Methods of Computation
Subsequently, formulas typified by (29.6.4) can be applied to compute the coefficients of the Fourier expansions of the corresponding Lamé functions by backward recursion followed by application of formulas typified by (29.6.5) and (29.6.6) to achieve normalization; compare §3.6. …