What people are saying - Write a review
We haven't found any reviews in the usual places.
Computer Number Representation
9 other sections not shown
Other editions - View all
accuracy algorithm ARRAY bisection bisection method calculation CALL SEQUENCE calling program Chapter coefficients computed solution convergence data points defined denote derived system diagonal differential equation DIMENSION discrete Fourier transform double precision eigenvalue ENDPOINT error bound estimate Euler's method evaluate EXAMPLE EXTERNAL FUNCTIONS/SUBROUTINES f(xk Figure formula Fourier transform function f(x functional values Gaussian elimination given in Table illustrated INPUT integrand integration interpolating points interpolation polynomial interpolatory interval iteration Lagrange least-squares polynomial linear equations LINPRO LU decomposition machine epsilon matrix Newton Newton-Cotes Newton's method nonlinear equation notation obtained orthogonal polynomial OUTPUT PARAMETERS polynomial approximation polynomial p(x quadratic quadrature points recursively representation residual root roundoff error Runge-Kutta method secant method Section significant decimals Simpson's rule solving step size h subintervals SUBROUTINE SUBROUTINE COMPUTES Szidarovszky and Yakowitz Taylor's polynomial Taylor's series techniques trapezoidal rule truncation error variables vector zero