Numerical Computation |
Contents
in a computer 5 1 4 Errors in arithmetic operations 6 1 5 Errors of compu | 14 |
2 9 Systems of nonlinear equations 34 Bibliographic notes | 35 |
3 4 Complete solution of a polynomial 43 3 5 Methods | 51 |
Copyright | |
8 other sections not shown
Common terms and phrases
a₁ A₂ accuracy algorithm analysis arithmetic b₁ b₂ binary calculation Chapter Chebyshev polynomials coefficients column consider decimal derivative difference table discussed divided difference eigenvalues eigenvector error term evaluated finite finite-difference formula function values Gauss-Seidel Gauss-Seidel method gaussian elimination given in Example instability integration interpolation interval involved Isaacson and Keller iterative methods k₁ large number linear mathematical matrix McCracken and Dorn multiplication Newton's method nomial nonzero obtained orthogonal polynomials orthogonality property over-relaxation pivotal poly polynomial of degree possible problem quadratic factor R₁ Ralston range rate of convergence reader relative error right-hand side roots round-off error Runge-Kutta methods scheme set of equations shown simple Simpson's rule simultaneous equations solved stability step stiff equations Sturm sequence subtraction suitable Taylor series tridiagonal true solution vector x₁ Xn+1 y₁ zero