Numerical Methods for High Speed Computers |
Contents
INTRODUCTION | 1 |
1965 | 10 |
SOLUTION OF ORDINARY DIFFERENTIAL | 51 |
Copyright | |
7 other sections not shown
Other editions - View all
Common terms and phrases
a₁ a₂ accuracy applied approximation arithmetic automatic computers b₁ Bernoulli's method Bessel functions binary boundary conditions calculation Chebyshev polynomials coefficients column continued fraction convergence decimal defined derivative described in Section diagonal digital computer elements elliptic Equation 17 Equation 21 Equation 30 error evaluated example factor finite difference first-order floating-point follows formula function given hand machines high-speed computers integration interpretive scheme inverse iterative method iterative process Jacobian elliptic functions k₁ latent roots latent vectors linear matrix method of Section method of solution modulus necessary non-zero notation numerical methods obtained operations ordinary differential equations partial differential equations Poisson's Equation possible power series programme punched quantities range recurrence relation result roots and vectors Runge-Kutta method second-order solved stage step length storage space sub-routine suitable Table tan-¹x technique tion transformations unity variable written Xn+1 y₁ zero