Author:
Clenshaw C. W.,Olver F. W. J.
Publisher
Springer Science and Business Media LLC
Subject
Applied Mathematics,Computational Mathematics,Computer Networks and Communications,Software
Reference11 articles.
1. R. P. Brent,Multiple-precision zero-finding methods and the complexity of elementary function evaluation. InAnalytic Computational Complexity (Edited by J. F. Traub), Academic Press, New York, 1976, pp. 151–176.
2. R. P. Brent,The complexity of multiple-precision arithmetic. InThe Complexity of Computational Problem Solving (Edited by R. S. Anderssen and R. P. Brent), University of Queensland Press, Brisbane, 1976, pp. 126–165.
3. R. P. Brent,A Fortran multiple-precision arithmetic package, ACM Trans. Math. Softw., 4 (1978), pp. 57–70.
4. R. P. Brent,Algorithm 524. MP, A Fortran multiple-precision arithmetic package, ACM Trans. Math. Softw., 4 (1978), pp. 71–81.
5. C. W. Clenshaw and F. W. J. Olver,An unrestricted algorithm for the exponential function, SIAM J. Numer. Anal., 17 (1980), pp. 310–331.
Cited by
3 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献