Numerical Methods For Scientific And Engineering ComputationNew Age International, 2003 - 844 pages |
Contents
HIGH SPEED COMPUTATION | 1 |
TRANSCENDENTAL AND POLYNOMIAL EQUATIONS | 18 |
SYSTEM OF LINEAR ALGEBRAIC EQUATIONS | 109 |
INTERPOLATION AND APPROXIMATION | 217 |
DIFFERENTIATION AND INTEGRATION | 328 |
ANSWERS AND HINTS TO THE PROBLEMS | 659 |
825 | |
Other editions - View all
Common terms and phrases
a₁ a₂ b₁ b₂ boundary conditions boundary value problem c₁ c₂ characteristic equation Chebyshev coefficients Compute convergence decimal determine difference equation differential equation eigenvalues eigenvectors elements equation f(x Euler method evaluations exact solution Example f(xo formula fprintf(fp function f(x given gives Hence initial approximation initial value problem integral interpolating polynomial interval iteration method K₁ K₂ linear matrix multistep method N₁ Newton-Raphson method NUMBER OF ITERATIONS O(h² obtain P₁(x polynomial of degree quadratic root Runge-Kutta method secant method second order method Simpson's rule solve spline stability step length subintervals Substituting Sweden system of equations t₁ T₂ Taylor series Taylor series method Tj+1 trapezoidal rule tridiagonal truncation error u₁ u₂ Uj+1 v₁ vector W₂ write WRITE(6 x₁ xk+1 xn+1 y₁ zero