About the Project
NIST

nodes

AdvancedHelp

(0.001 seconds)

6 matching pages

1: 3.5 Quadrature
§3.5(v) Gauss Quadrature
In adaptive algorithms the evaluation of the nodes and weights may cause difficulties, unless exact values are known. … The nodes x k and weights w k are known explicitly: … The complex Gauss nodes ζ k have positive real part for all s > 0 . … Extensive tables of quadrature nodes and weights can be found in Krylov and Skoblya (1985). …
2: 9.19 Approximations
  • Corless et al. (1992) describe a method of approximation based on subdividing into a triangular mesh, with values of Ai ( z ) , Ai ( z ) stored at the nodes. Ai ( z ) and Ai ( z ) are then computed from Taylor-series expansions centered at one of the nearest nodes. The Taylor coefficients are generated by recursion, starting from the stored values of Ai ( z ) , Ai ( z ) at the node. Similarly for Bi ( z ) , Bi ( z ) .

  • 3: 3.3 Interpolation
    §3.3(i) Lagrange Interpolation
    The nodes or abscissas z k are real or complex; function values are f k = f ( z k ) . … If f , x ( = z ), and the nodes x k are real, and f ( n + 1 ) is continuous on the smallest closed interval I containing x , x 0 , x 1 , , x n , then the error can be expressed …
    §3.3(ii) Lagrange Interpolation with Equally-Spaced Nodes
    where the nodes x k = x 0 + k h ( h > 0 ) and function f are real, …
    4: 3.4 Differentiation
    §3.4(i) Equally-Spaced Nodes
    For formulas for derivatives with equally-spaced real nodes and based on Sinc approximations (§3.3(vi)), see Stenger (1993, §3.5). …
    5: 18.38 Mathematical Applications
    If the nodes in a quadrature formula with a positive weight function are chosen to be the zeros of the n th degree OP with the same weight function, and the interval of orthogonality is the same as the integration range, then the weights in the quadrature formula can be chosen in such a way that the formula is exact for all polynomials of degree not exceeding 2 n - 1 . …
    6: 3.11 Approximation Techniques
    Given n + 1 distinct points x k in the real interval [ a , b ] , with ( a = ) x 0 < x 1 < < x n - 1 < x n ( = b ), on each subinterval [ x k , x k + 1 ] , k = 0 , 1 , , n - 1 , a low-degree polynomial is defined with coefficients determined by, for example, values f k and f k of a function f and its derivative at the nodes x k and x k + 1 . …