## Numerical Methods for High Speed Computers |

### What people are saying - Write a review

We haven't found any reviews in the usual places.

### Contents

Appendix FLOATINGPOINT ARITHMETIC | 1 |

EVALUATION OF FUNCTIONS | 13 |

SOLUTION OF ORDINARY DIFFERENTIAL | 51 |

Copyright | |

5 other sections not shown

### Other editions - View all

### Common terms and phrases

accuracy applied arithmetic automatic computers Bernoulli's method boundary conditions calculation Chebyshev polynomials chosen coefficients continued fraction convergence decimal defined denoted derivative described in Section elliptic Equation 17 Equation 21 Equation 30 error evaluated example factor finite difference first-order floating point follows formula fourth-order given gives hand machines high-speed computers hyperbolic integration inverse iterative method Jacobian elliptic functions large number latent roots latent vectors leading diagonal linear main store method of Section method of solution methods described modulus necessary node non-zero notation numerical methods obtained off-diagonal elements operator ordinary differential equation orthogonal partial differential equations performed Poisson's Equation possible power series programme punched quantities range recurrence relation reduced result roots and vectors Runge-Kutta method second-order series expansion simple solved square stage step length storage space sub-routine suitable Suppose symmetric Table tape technique tion Tn(x transformations transpose unity usually variable written zero