Machine parameters for numerical analysis

  • W. J. Cody
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 57)


The general acceptance of conventions for basic linear algebra modules suggests that an effort will soon be made to establish similar conventions for machine dependent parameters and constants. This paper suggests basic concepts and principles which might guide such an effort and raises questions which must be adequately addressed if such an effort is to be successful.


Machine Parameter Algorithmic Parameter Fortran Subroutine Basic Linear Algebra Mathematical Constant 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. 1.
    Aird, T. J., The Fortran Converter User's Guide, IMSL, Houston, 1976.Google Scholar
  2. 2.
    American National Standard Fortran, American National Standards Institute, New York, 1966.Google Scholar
  3. 3.
    Anonymous, IFIP Working Group 2.5 on Numerical Software, SIGNUM Newsletter 10, Nos. 2 & 3, November, 1975, p. 16.Google Scholar
  4. 4.
    Anonymous, SIGNUM Basic Linear Algebra Project, SIGNUM Newsletter 10, Nos. 2 & 3, November, 1975, pp. 3–4.Google Scholar
  5. 5.
    Anonymous, X3J3/76 dpANS FORTRAN, February, 1976.Google Scholar
  6. 6.
    Boyle, J. M., Portability Problems and Solutions in NATS, Proceedings of the Software Certification Workshop, W. Cowell, (Ed.), Argonne National Laboratory, 1973, pp. 80–89.Google Scholar
  7. 7.
    Cody, W. J., An Overview of Software Development for Special Functions, Lecture Notes in Mathematics 506, Numerical Analysis Dundee 1975, G. A. Watson, ed., Springer-Verlag, Berlin, 1976, pp. 38–48.Google Scholar
  8. 8.
    Ford, B., Portability of Numerical Software in the NAG Project, to appear.Google Scholar
  9. 9.
    Fox, P. A., Hall, D., and Schryer, N. L., Machine Constants for Portable Fortran Libraries, in Computer Science Technical Report No. 37, Bell Laboratories, Murray Hill, N. J., 1975.Google Scholar
  10. 10.
    Gentleman, W. M., and Marovich, S. B., More on Algorithms That Reveal Properties of Floating-Point Arithmetic Units, CACM 17, 1974, pp. 276–277.Google Scholar
  11. 11.
    George, J. E., Algorithms to Reveal the Representation of Characters, Integers and Floating-Point Numbers, ACM TOMS 1, 1975, pp. 210–216.Google Scholar
  12. 12.
    Hanson, R. J., Krogh, F. T., and Lawson, C. L., A Proposal for Standard Linear Algebra Subprograms, Technical Memorandum 33–660, Jet Propulsion Laboratory, Pasadena, 1973.Google Scholar
  13. 13.
    Knuth, D. E., The Art of Computer Programming, Vol. 2, Seminumerical Algorithms, Addison Wesley, Reading, Mass., 1971.Google Scholar
  14. 14.
    Lawson, C. L., Hanson, R. J., Kincaid D., and Krogh, F. T., Basic Linear Algebra Subprograms for Fortran Usage, unpublished draft, 1976.Google Scholar
  15. 15.
    Malcolm, M. A., Algorithms to Reveal Properties of Floating-Point Arithmetic, CACM 15, 1972, pp. 949–51.Google Scholar
  16. 16.
    Naur, P., Machine Dependent Programming in Common Languages, BIT 7, 1967, pp. 123–131.Google Scholar
  17. 17.
    Redish, K. A., and Ward, W., Environment Enquiries for Numerical Analysis, SIGNUM Newsletter 6, 1971, pp. 10–15.Google Scholar
  18. 18.
    Sterbenz, P. H., Floating-Point Computation, Prentice Hall, Englewood Cliffs, N. J., 1974.Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1977

Authors and Affiliations

  • W. J. Cody

There are no affiliations available

Personalised recommendations