The NAG Library in a Supercomputing Environment

  • J. J. Du Croz
  • P. J. D. Mayes


In a supercomputing environment the role of a numerical subroutine library is even more important than in a more conventional computing environment. Not only should the library provide accuracy, reliability and robustness in performing standard numerical computations, but it should also — as far as possible — offer the high levels of performance which users of supercomputers may expect. Indeed, users may reasonably look to a subroutine library to relieve them of some of the burden of acquiring the specialised expertise — for example, knowledge of architectural details or of the capabilities of a vectorizing compiler — that may be necessary to use a supercomputer efficiently.


Linear Algebra Singular Value Decomposition Plane Rotation Innermost Loop Numerical Algorithm Group 
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. Branldn, R.W., and Gladwell, I., 1989 Codes for Almost Block Diagonal Systems. NAG Technical Report TR1/89, (to be published in Comp. and Math. with Applics.).Google Scholar
  2. Demmel, J., Dongarra, J.J., Du Croz, J.J., Greenbaum, A., Hammarling, S.J., and Sorensen, D.C., 1987 Prospectus for the Development of Linear Algebra Library for High Performance Computers. Argonne National Laboratory, Mathematics and Computer Science Division, Technical Memorandum No. 97.Google Scholar
  3. Dongarra, J.J., Du Croz, J.J., Duff, I.S. and Hammarling, S.J., 1989 A Set of Level 3 Basic Linear Algebra Subprograms. to be published in ACM Trans. Math. Software.Google Scholar
  4. Dongarra, J.J., Du Croz, J.J., Hammarling, S.J., and Hanson, R.J., 1988 An Extended Set of Fortran Basic Linear Algebra Subprogramo ACM Trans. Math. Software, 14, pp. 1–17.CrossRefGoogle Scholar
  5. Dongarra, J.J., Du Croz, J.J., Hammarling, S.J., and Hanson, R.J., 1988 Algorithm 656: An Extended Set of Basic Linear Algebra Subprograms: Model Implementation and Test Programs ACM Trans. Math. Software, 14, pp. 18–32.CrossRefGoogle Scholar
  6. Dongarra, J.J., and Eisenstat, S.C., 1984 Squeezing the Most out of an Algorithm in Cray Fortran. ACM Trans. Math. Software, 10, pp. 221–230.Google Scholar
  7. Du Croz, J.J.,Mayes, P.J.D., Wasniewski, J., and Wilson, S., 1988 Applications of Level 2 BLAS in the NAG Library. Parallel Comput., 8, pp. 345–350.CrossRefGoogle Scholar
  8. Du Croz, J.J., and Wasniewski, J., 1988 Basic Linear Algebra Computations on the Sperry ISP. Lecture Notes in Computer Science, 297, pp. 629–638.CrossRefGoogle Scholar
  9. Geers, N, 1989 Optimization of Level 2 BLAS for Siemens VP systems, University of Karlsruhe, Computer Centre, Report No. 37. 89.Google Scholar
  10. Genz, A.C., and Malik, A.A., 1980 An adaptive algorithm for numerical integration over an Un“@THdimensional rectangular region J. Comput. Appl. Math., 6, pp. 295–302.CrossRefGoogle Scholar
  11. Gladwell, I., 1986 Vectorization of one-dimensional quadrature codes NAG Technical Report TR 7/86, December.Google Scholar
  12. Lawson, C., Hanson, R.J., Kincaid, D., and Krogh, F.T., 1979 Basic Linear Algebra Subprograms for Fortran Usage. ACM Trans. Math. Software, 5, pp. 308–323.CrossRefGoogle Scholar
  13. Lioen W.M., Louter-Nool, M., and te Ride, H.J.J., 1987 Optimization of the Real Level 2 BLAS on the Cyber 205. In: Algorithms and Applications on Vector and Parallel Computers. Elsevier Science Publishers.Google Scholar
  14. Luecke, G.R., 1988 Performance of the Numerical Algorithms Group (NAG) Mark 12 Library on National Advanced Systems Vector Computers. In: Proceedings of 3rd International Conference on Supercomputing, Volume II, pp. 354–359. International Supercomputing Institute, Inc.Google Scholar
  15. Mayes, P.J.D., and Radicati di Brozolo, G., 1989 Portable and Efficient Factorization Algorithms on the IBM 3090/VF. Proceedings of the 3rd International Conference on Supercomputing, Crete, pp. 263–270 ACM, New York.Google Scholar
  16. Piessens R., E. de Doncker-Kapenga, E., Uberhuber, C.W., and Kahaner, D.K., 1980 QUADPACK-A Subroutine Package for Automatic Integration, Springer-Verlag, Berlin.Google Scholar
  17. Swarztrauber, P.N., 1982 Vectorizing the FFTs. In, Parallel Computations, G. Rodrigue (Ed.). Academic Press.Google Scholar
  18. Swarztrauber, P.N., 1984 FFT algorithms for vector computers. Parallel Comput., 1, pp. 45–63.CrossRefGoogle Scholar
  19. Swarztrauber, P.N., 1984 Fast Poisson Solvers In, Studies in Numerical Analysis, G. H. Golub (Ed.). Mathematical Association of America.Google Scholar
  20. Swarztrauber, P.N., 1986 Symmetric FFT’s Math. Comp., 47, pp. 323–346.CrossRefGoogle Scholar
  21. Swarztrauber, P.N., and Sweet, R.A., 1979 Efficient Fortran subprograms for the solution of elliptic partial differential equations. ACM Trans. Math. Software, 5, pp. 352–364CrossRefGoogle Scholar
  22. Temperton, C. 1983 Self-sorting mixed-radix fast Fourier transforms. J. Comput. Phys., 52, pp. 1–23.CrossRefGoogle Scholar
  23. Temperton, C. 1983 Fast mixed-radix real Fourier transforms. J. Comput. Phys., 52, pp. 340–350.CrossRefGoogle Scholar

Copyright information

© Plenum Press, New York 1990

Authors and Affiliations

  • J. J. Du Croz
    • 1
  • P. J. D. Mayes
    • 1
  1. 1.The Numerical Algorithms Group Ltd.OxfordUK

Personalised recommendations