Skip to main content
SpringerLink
Log in

Level-index arithmetic: An introductory survey

  • Conference paper
  • First Online:
Book cover Numerical Analysis and Parallel Processing

Part of the book series: Lecture Notes in Mathematics ((LNM,volume 1397))

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 34.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 46.00
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. E.H. Bareiss, Resultant procedure and the mechanization of the Graeffe process, J.Assoc. Comput. Mach., 7 (1960), pp. 346–386.

    Article  MathSciNet  MATH  Google Scholar 

  2. J.L. Barlow and E.H. Bareiss, On roundoff error distributions in floating-point and logarithmic arithmetic, Computing, 34 (1985), pp. 325–341.

    Article  MathSciNet  MATH  Google Scholar 

  3. F. Benford, The law of anomalous numbers, Proc. Am. Phil. Soc., 78 (1938), pp. 551–572.

    MATH  Google Scholar 

  4. J.L. Blue, A portable Fortran program to find the Euclidean norm of a vector, ACM Trans. Math. Software, 4 (1978), pp. 15–23.

    Article  MathSciNet  Google Scholar 

  5. C.W. Clenshaw, A note on the summation of Chebyshev series, Math. Comp., 9 (1955), pp. 118–120.

    Article  MathSciNet  MATH  Google Scholar 

  6. C.W. Clenshaw, D.W. Lozier, F.W.J. Olver and P.R. Turner, Generalized exponential and logarithmic functions, Comput. Math. Appl., 12B (1986), pp. 1091–1101.

    Article  MathSciNet  MATH  Google Scholar 

  7. C.W. Clenshaw and F.W.J. Olver, An unrestricted algorithm for the exponential function, SIAM J. Numer. Anal., 17 (1980), pp. 310–331.

    Article  MathSciNet  MATH  Google Scholar 

  8. C.W. Clenshaw and F.W.J. Olver, Beyond floating-point, J. Assoc. Comput. Mach., 31 (1984), pp. 319–328.

    Article  MathSciNet  MATH  Google Scholar 

  9. C.W. Clenshaw and F.W.J. Olver, Level-index arithmetic operations, SIAM J. Numer. Anal., 24 (1987) pp. 470–485.

    Article  MathSciNet  MATH  Google Scholar 

  10. C.W.Clenshaw and P.R.Turner, The symmetric level-index system, IMA J. Numer. Anal. [In press].

    Google Scholar 

  11. C.W.Clenshaw and P.R.Turner, Root-squaring using level-index arithmetic, [Manuscript].

    Google Scholar 

  12. W.J. Cody Jr., and W. Waite, Software Manual for the Elementary Functions, Prentice-Hall, Englewood Cliffs, N.J., 1980.

    MATH  Google Scholar 

  13. M.G. Cox, The numerical evaluation of B-splines, J. Inst. Maths Applics., 10 (1972), pp. 134–149.

    Article  MathSciNet  MATH  Google Scholar 

  14. P.J. Davis, Leonhard Euler's integral: a historical profile of the Gamma function, Amer. Math. Monthly, 66 (1959), pp. 849–869.

    Article  MathSciNet  MATH  Google Scholar 

  15. J.W. Demmel, Underflow and the reliability of numerical software, SIAM J. Sci. Statist. Comp., 5 (1984), pp. 887–919.

    Article  MathSciNet  MATH  Google Scholar 

  16. J.W. Demmel, On error analysis in arithmetic with varying relative precision, Proc. 8th Symposium on Computer Arithmetic, M.J. Irwin and R. Stefanelli, eds., IEEE Computer Society Press, Washington, D.C., 1987, pp. 148–152.

    Google Scholar 

  17. A. Feldstein and R. Goodman, Loss of significance in floating-point subtraction and addition, IEEE Trans. Comp., 31 (1982), pp. 328–335.

    Article  MATH  Google Scholar 

  18. A. Feldstein and J.F. Traub, Asymptotic behavior of vector recurrences with applications, Math. Comp., 31 (1977), pp. 180–192.

    Article  MathSciNet  MATH  Google Scholar 

  19. A. Feldstein and P.R. Turner, Overflow, underflow, and severe loss of significance in floating-point addition and subtraction, IMA J. Numer. Anal., 6 (1986), pp. 241–251.

    Article  MathSciNet  MATH  Google Scholar 

  20. B.J. Flehinger, On the probability that a random number has leading digit A, Amer. Math. Monthly, 73 (1966), pp. 1056–1061.

    Article  MathSciNet  MATH  Google Scholar 

  21. R. Goodman, Some models of error in floating-point multiplication. Computing, 27 (1981), pp. 227–236.

    Article  MATH  Google Scholar 

  22. R. Goodman and A. Feldstein, Effect of guard digits and normalisation options on floating-point multiplication, Computing, 18 (1977), pp. 93–106.

    Article  MathSciNet  MATH  Google Scholar 

  23. R. Goodman, A. Feldstein and J. Bustoz, Relative error in floating-point multiplication, Computing, 35 (1985), pp. 137–139.

    Article  MathSciNet  MATH  Google Scholar 

  24. J.B. Gosling, Design of arithmetic units for digital computers, MacMillan, London, 1980.

    Book  Google Scholar 

  25. H. Hamada, URR: Universal representation of real numbers, New Gencration Computing, OHM-Sha, Springer-Verlag 1 (1983), pp. 205–209.

    Google Scholar 

  26. H. Hamada, A new real number representation and its operation, Proc. 8th Symposium on Computer Arithmetic, M.J. Irwin and R. Stefanelli, eds., IEEE Computer Society Press, Washington D.C., 1987, pp. 153–157.

    Google Scholar 

  27. J.M. Hammersley, Probability and arithmetic in science, IMA Bulletin, 21 (1985), pp. 114–120.

    Google Scholar 

  28. R.W. Hamming, On the distribution of numbers, Bell Systems Tech. J., 49 (1970), pp. 1609–1625.

    Article  MathSciNet  MATH  Google Scholar 

  29. J.G. Hayes, Curved knot lines and surfaces with ruled segments, Numerical Analysis: Proceedings of the 9th Biennial Conference, Dundee 1981, G.A. Watson, ed., Lecture Notes in Mathematics No. 912, Springer-Verlag, Berlin, 1982, pp. 140–156.

    Google Scholar 

  30. P. Henrici, Applied and Computational Complex Analysis, Vol. 3, J. Wiley and Sons, New York, 1986.

    MATH  Google Scholar 

  31. F.B. Hildebrand, Introduction to Numerical Analysis, McGraw-Hill, New York, 1956.

    MATH  Google Scholar 

  32. T.E. Hull, Precision control, exception handling and a choice of numerical algorithms, Lecture Notes in Mathematics No. 912, Numerical Analysis, G.A. Watson ed., Springer-Verlag, Berlin, pp. 169–178, 1982.

    Chapter  Google Scholar 

  33. T.E. Hull and M.S. Cohen, Toward an ideal computer arithmetic, Proc. 8th Symposium on Computer Arithmetic, M.J. Irwin and R. Stefanelli, eds. IEEE Computer Society Press, Washington, D.C., 1987, pp. 131–138.

    Google Scholar 

  34. T.E. Hull et al, Numerical Turing, ACM SIGNUM Newsletters, 20, No. 3 (1985), pp. 26–32.

    Article  Google Scholar 

  35. K. Hwang and F.A. Briggs, Computer Architecture and Parallel Processing, McGraw-Hill, New York, 1984.

    MATH  Google Scholar 

  36. IBM, High-accuracy arithmetic, General Information Manual, GC33-6163-1, second edition, IBM Corporation, Mechanicsburg, PA, 1984.

    Google Scholar 

  37. IEEE Standard 754, Binary floating-point arithmetic, The Institute of Electrical and Electronic Engineers, New York, 1985.

    Google Scholar 

  38. M.J. Irwin and R. Stefanelli, eds., Proc. 8th Symposium on Computer Arithmetic, IEEE Computer Society, Washington D.C., 1987.

    Google Scholar 

  39. H. Kneser, Reelle analytische Lösungen der Gleichung φ(φ(x))=e x und verwandte Funktionalgleichungen, J.Reine Angew. Math., 187 (1950) pp. 56–67.

    MathSciNet  Google Scholar 

  40. D.E. Knuth, The art of computer programming: Volume 2, Semi numerical algorithms, Addison-Wesley, Reading, Mass., 1969.

    Google Scholar 

  41. P. Kornerup and D.W. Matula, Finite precision lexicographic continued fraction number systems, Proc. 7th Symposium on Computer Arithmetic, K. Hwang, ed., IEEE Computer Society Press, Washington, D.C., 1985, pp. 207–214.

    Google Scholar 

  42. P. Kornerup and D.W. Matula, A bit-serial arithmetic unit for rational arithmetic, Proc. 8th Symposium on Computer Arithmetic, M.J. Irwin and R. Stenanelli, eds., IEEE Computer Society Press, Washington, D.C., 1987, pp. 204–211.

    Google Scholar 

  43. U.W. Kulisch and W.L. Miranker, The arithmetic of the digital computer: a new approach, SIAM Review, 28 (1986), pp. 1–40.

    Article  MathSciNet  MATH  Google Scholar 

  44. D.W.Lozier and F.W.J.Olver, Closure and precision in level-index arithmetic, [Manuscript].

    Google Scholar 

  45. S. Matsui and M. Iri, An overflow/underflow-free floating-point representation of numbers, J.Inform. Process., 4 (1981), pp. 123–133.

    Google Scholar 

  46. D.W. Matula and P. Kornerup, Foundations of finite precision rational arithmetic, Foundations of Numerical Computation (Computer-Orientated Numerical Analysis), G. Alefeld and R.D. Grigorieff, eds., Computing, Suppl., 2 (1980), pp. 85–111.

    Google Scholar 

  47. F.W.J. Olver, The evaluation of zeros of high-degree polynomials, Phil. Trans. Royal Soc. A, 244 (1952), pp. 385–415.

    Article  MathSciNet  MATH  Google Scholar 

  48. F.W.J. Olver, A new approach to error arithmetic, SIAM J. Numer. Anal. 15 (1978), pp. 368–393.

    Article  MathSciNet  MATH  Google Scholar 

  49. F.W.J. Olver, Further developments of rp and ap error analysis, IMA J. Numer. Anal., 2 (1982), pp. 249–274.

    Article  MathSciNet  MATH  Google Scholar 

  50. F.W.J. Olver, A closed computer arithmetic, Proc. 8th Symposium on Computer Arithmetic, M.J. Irwin and R. Stefanelli, eds., IEEE Computer Society Press, Washington, D.C., 1987, pp. 139–143.

    Google Scholar 

  51. F.W.J.Olver, Roundings errors in algebraic processes — in level-index arithmetic, Proceedings of a Conference on Reliable Numerical Computation (in memoriam of J.H.Wilkinson), M.G.Cox and S.Hammarling, eds., Oxford University Press. [In press].

    Google Scholar 

  52. F.W.J. Olver and P.R. Turner, Implementation of level-index using partial table look-up, Proc. 8th Symposium on Computer Arithmetic, M.J. Irwin and R. Stefanelli, eds., IEEE Computer Society Press, Washington, D.C., 1987, pp. 144–147.

    Google Scholar 

  53. R.S. Pinkham, On the distribution of first significant digits, Ann. Math. Stat., 32 (1981), pp. 1223–1230.

    Article  MathSciNet  MATH  Google Scholar 

  54. R.A. Raimi, On the distribution of first significant figures, Amer. Math. Monthly, 76 (1969), pp. 342–348.

    Article  MathSciNet  MATH  Google Scholar 

  55. A. Ralston, A first course in numerical analysis, McGraw-Hill, New York, 1965.

    MATH  Google Scholar 

  56. C.W. Schelin, Calculator function approximation, Amer. Math. Monthly 90 (1983), pp. 317–325.

    Article  MathSciNet  MATH  Google Scholar 

  57. P.H. Sterbenz, Floating-point Computation, Prentice-Hall, Englewood Cliffs, N.J., 1974.

    Google Scholar 

  58. D.W. Sweeney, An analysis of floating-point addition, IBM Systems J., 4(1965), pp. 31–42.

    Article  Google Scholar 

  59. P.R. Turner, The distribution of leading significant digits, IMA J. Numer. Anal. 2 (1982), pp. 407–412.

    Article  MathSciNet  MATH  Google Scholar 

  60. P.R. Turner, Further revelations on l.s.d., IMA J. Numer. Anal. 4 (1984), pp. 225–231.

    Article  MathSciNet  MATH  Google Scholar 

  61. P.R. Turner, Towards a fast implementation of level-index arithmetic, Bull. Inst. Math. Appl., 22 (1986), pp. 188–191.

    MathSciNet  MATH  Google Scholar 

  62. P.R. Turner, The use of level-index arithmetic to avoid overflow/underflow in floating-point computation, University of Lancaster, Tech. Rep., 1986.

    Google Scholar 

  63. J. Volder, The CORDIC computing technique, IRE Trans. Computers EC8 (1959), pp. 330–334.

    Article  Google Scholar 

  64. J.S. Walther, A unified algorithm for elementary functions, AFIPS Conference Proc., 38 (1971), pp. 379–395.

    Google Scholar 

  65. S. Waser and M.J. Flynn, Introduction to Arithmetic for Digital Systems Designers, Holt, Rinehart and Winston, New York, 1982.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Mathematics Department, University of Lancaster, LA1 4YL, Lancaster, UK

    C. W. Clenshaw

  2. Institute for Physical Science and Technology, University of Maryland, 20742, MD, USA

    F. W. J. Olver

  3. Mathematics Department, University of Lancaster, LA1 4YL, Lancaster, UK

    P. R. Turner

  4. Mathematics Department, US Naval Academy, 21402, Annapolis, MD, USA

    P. R. Turner

Authors
  1. C. W. Clenshaw
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. F. W. J. Olver
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. P. R. Turner
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Peter R. Turner

Rights and permissions

Reprints and permissions

Copyright information

© 1989 Springer-Verlag

About this paper

Cite this paper

Clenshaw, C.W., Olver, F.W.J., Turner, P.R. (1989). Level-index arithmetic: An introductory survey. In: Turner, P.R. (eds) Numerical Analysis and Parallel Processing. Lecture Notes in Mathematics, vol 1397. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0085718

Download citation

  • DOI: https://doi.org/10.1007/BFb0085718

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-51645-3

  • Online ISBN: 978-3-540-46732-8

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation