## Computer ApproximationsPublisher description: "This handbook is intended to acquaint users with methods for designing function subroutines and, in the case of the most commonly needed functions, to provide them with the necessary tables to do so efficiently." |

### What people are saying - Write a review

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

### Contents

The Design of a Function Subroutine | 1 |

Abel transformation 35 | 8 |

General Methods of Computing Functions | 10 |

Copyright | |

21 other sections not shown

### Other editions - View all

### Common terms and phrases

absolute error accuracy addition algorithm Analytic Behavior arcsin ARCTN argument arithmetic operations asymptotic Bessel functions best approximation CBRT Chebyshev polynomials Chebyshev series coefficients computing constant continued fraction convergence cosh cube root decimal defined Design of Subroutines differential equation digits efficient ERFC error criterion evaluation example EXPB EXPBC EXPD EXPDC exponential formulas Fourier series function values GAMMA gamma function given ill-conditioned Index Tables integral interval inverse Inverse Trigonometric Functions iterated division JZERO LGAM logarithm LOGE loss of significance machine method multiplication N M Index obtained P03 POO parameters polynomials of degree POO l+ POO P01 power series Precision N Index PZERO QONE QOO Q01 QZERO Range Precision N M range reduction rational approximations rational function recurrence relation relative error rhombus routine Section sequence sin2 SINH SQRT square root subroutine tanh theorem transformation trigonometric functions ui ui ui variable YZERO zero