About the Project

chain rule

AdvancedHelp

(0.001 seconds)

31—39 of 39 matching pages

31: Bibliography S
  • V. P. Spiridonov (2002) An elliptic incarnation of the Bailey chain. Int. Math. Res. Not. 2002 (37), pp. 1945–1977.
  • 32: Software Index
    Please see our Software Indexing Policy for rules that govern the indexing of software in the DLMF. …
    33: 1.10 Functions of a Complex Variable
    The function f 1 ( z ) on D 1 is said to be analytically continued along the path z ( t ) , a t b , if there is a chain ( f 1 , D 1 ) , ( f 2 , D 2 ) , , ( f n , D n ) . …
    34: 3.3 Interpolation
    and compute an approximation to a 1 by using Newton’s rule3.8(ii)) with starting value x = 2.5 . …Then by using x 3 in Newton’s interpolation formula, evaluating [ x 0 , x 1 , x 2 , x 3 ] f = 0.26608 28233 and recomputing f ( x ) , another application of Newton’s rule with starting value x 3 gives the approximation x = 2.33810 7373 , with 8 correct digits. …
    35: 3.2 Linear Algebra
    Because of rounding errors, the residual vector 𝐫 = 𝐛 𝐀 𝐱 is nonzero as a rule. …
    36: 3.6 Linear Difference Equations
    or for systems of k first-order inhomogeneous equations, boundary-value methods are the rule rather than the exception. …
    37: Bibliography O
  • M. L. Overton (2001) Numerical Computing with IEEE Floating Point Arithmetic. Society for Industrial and Applied Mathematics (SIAM), Philadelphia, PA.
  • 38: 1.9 Calculus of a Complex Variable
    A domain D , say, is an open set in that is connected, that is, any two points can be joined by a polygonal arc (a finite chain of straight-line segments) lying in the set. …
    39: 1.2 Elementary Algebra
    This is the row times column rule. …