A fast and robust mixed-precision solver for the solution of sparse symmetric linear systems

ACM Transactions on Mathematical Software

Volumn 37, Issue 2, 2010, Pages

  Hogg, J D ^a   Scott, J A ^a  

^a RUTHERFORD APPLETON LABORATORY   (United Kingdom)

Author keywords

FGMRES; Fortran 95; Gaussian elimination; Iterative refinement; Mixed precision; Multifrontal method; Sparse symmetric linear systems

Indexed keywords

FORTRAN 95; GAUSSIAN ELIMINATION; ITERATIVE REFINEMENT; MIXED PRECISION; MULTIFRONTAL METHODS;

NUMERICAL ANALYSIS;

LINEAR SYSTEMS;

EID: 77951891411     PISSN: 00983500     EISSN: 15577295     Source Type: Journal    
DOI: 10.1145/1731022.1731027     Document Type: Article

References (35)

1. AMESTOY, P., DAVIS, T., AND DUFF, I. 1996. An approximate minimum degree ordering algorithm. SIAM J. Matrix Anal. Appl. 17, 886-905.
2. AMESTOY, P., DAVIS, T., AND DUFF, I. 2004. Algorithm 837: AMD, an approximate minimum degree ordering algorithm. ACM Trans. Math. Softw. 30, 3, 381-388.
3. AMESTOY, P., DOLLAR, H., REID, J., AND SCOTT, J. 2007. An approximate minimum degree algorithm for matrices with dense rows. Tech. rep. RAL-TR-2007-2020 Rutherford Appleton Laboratory, Chilton, U.K.
4. ARIOLI, M. AND DUFF, I. 2008. FGMRES to obtain backward stability in mixed precision. Tech. rep. RAL-TR-2008-3006 Rutherford Appleton Laboratory, Chilton, U.K.
5. ARIOLI, M., DUFF, I., GRATTON, S., AND PRALET, S. 2007. A note on GMRES preconditioned by a perturbed LDLT decomposition with static pivoting. SIAM J. Sci. Comput. 29, 5, 2024-2044.
6. BUTTARI, A., DONGARRA, J., AND KURZAK, J. 2007a. Limitations of the playstation 3 for high performance cluster computing. Tech. rep. CS-07-594. University of Tennessee Computer Science Department, Knokville, TN.
7. BUTTARI, A., DONGARRA, J., KURZAK, J., LUSZCZEK, P., AND TOMOV, S. 2008. Using mixed precision for sparse matrix computations to enhance the performance while achieving 64-bit accuracy. ACM Trans. Math. Softw. 34, 4.
8. BUTTARI, A., DONGARRA, J., LANGOU, J., LANGOU, J., LUSZCZEK, P., AND KURZAK, J. 2007b. Mixed precision iterative refinement techniques for the solution of dense linear systems. Int. J. High Perform. Comput. Appl. 21, 4, 457-466.
9. CURTIS, A. AND REID, J. 1972. On the automatic scaling of matrices for Gaussian elimination. IMA J. Appl. Math. 10, 1, 118-124.
10. DAVIS, T. 2007. The University of Florida sparse matrix collection. Technical rep. University of Florida, Gaisesville, FL. http://www.cise.ufl.edu/? davis/techreports/matrices.pdf.
11. DEMMEL, J., HIDA, Y., KAHAN, W., LI, X. S., MUKHERJEEK, S., AND RIEDY, E. J. 2006. Error bounds from extra precise iterative refinement. ACM Trans. Math. Softw. 32, 2, 325-351.
12. DEMMEL, J.,HIDA, Y., LI, X. S., AND RIEDY, E. J. 2009. Extra-precise iterative refinement for overdetermined least squares problems. ACM Trans. Math. Softw. 35, 4. (Also LAPACK Working Note 188.)
13. DOLLAR,H. AND SCOTT, J. 2009. Anote on fast approximate minimum degree orderings for matrices with some dense rows. Numer. Lin. Alg. Appl. 17, 1, 43-45.
14. DONGARRA, J., CROZ, J. D., HAMMARLING, S., AND DUFF, I. 1990. A set of level 3 basic linear algebra subprograms. ACM Trans. Math. Softw. 16, 1, 1-17.
15. DUFF, I. 2004. MA57-a new code for the solution of sparse symmetric definite and indefinite systems. ACM Trans. Math. Softw. 30, 118-154.
16. DUFF, I. AND KOSTER, J. 2001. On algorithms for permuting large entries to the diagonal of a sparse matrix. SIAM J. Matrix Anal. Appl. 22, 4, 973-996.
17. DUFF, I. AND PRALET, S. 2005. Strategies for scaling and pivoting for sparse symmetric indefinite problems. SIAM J. Matrix Anal. Appl. 27, 313-340.
18. DUFF, I. AND PRALET, S. 2007. Towards a stable static pivoting strategy for the sequential and parallel solution of sparse symmetric indefinite systems. SIAM J. Matrix Anal. Appl. 29, 1007-1024.
19. DUFF, I. AND REID, J. 1983. The multifrontal solution of indefinite sparse symmetric linear systems. ACM Trans. Math. Softw. 9, 302-325.
20. DUFF, I. AND SCOTT, J. 2005. Towards an automatic ordering for a symmetric sparse direct solver. Tech. rep. RAL-TR-2006-3001 Rutherford Appleton Laboratory, Chilton, U.K.
21. GOTO, K. AND VAN DE GEIJN, R. 2008. High performance implementation of the level-3 BLAS. ACM Trans. Math. Softw. 35, 1.
22. GOULD, N., SCOTT, J., AND HU, Y. 2007. A numerical evaluation of sparse direct solvers for the solution of large sparse symmetric linear systems of equations. ACM Trans. Math. Softw. 33, 2, 10:1-10:32.
23. GRAHAM, S. L., SNIR, M., AND PATTERSON, C. A. 2004. Getting Up to Speed: The Future of Supercomputing. National Academies Press, Washington, DC.
24. HIGHAM, N. 1997. Iterative refinement for linear systems and LAPACK. IMA J. Numer. Anal. 17, 495-509. (Pubitemid 127355542)
25. HOGG, J. D. AND SCOTT, J. A. 2008. The effects of scalings on the performance of a sparse symmetric indefinite solver. Tech. rep. RAL-TR-2008-3007 Rutherford Appleton Laboratory, Chilton, U.K.
26. HSL. 2007. A collection of Fortran codes for large-scale scientific computation. http://www.cse.stfc.ac.uk/nag/hsl.
27. IEEE. 2008. IEEE standard for floating-point arithmetic. IEEE Standard 754-2008. IEEE Standards Committee, Piscataway, NJ, 1-58.
28. KARYPIS, G. AND KUMAR, V. 1999. A fast and high quality multilevel scheme for partitioning irregular graphs. SIAM J. Sci. Comput. 20, 359-392.
29. REID, J. AND SCOTT, J. 2008. An efficient out-of-core sparse symmetric indefinite direct solver. Tech. rep. RAL-TR-2008-2024 Rutherford Appleton Laboratory, Chilton, U.K.
30. REID, J. AND SCOTT, J. 2009a. Algorithm 891: A Fortran virtual memory system. ACMTrans.Math. Softw. 36, 1.
31. REID, J. AND SCOTT, J. 2009b. An out-of-core sparse Cholesky solver. ACMTrans.Math. Softw. 36, 2.
32. RUIZ, D. 2001. A scaling algorithm to equilibrate both rows and columns norms inmatrices. Tech. rep. RAL-TR-2001-2034 Rutherford Appleton Laboratory, Chilton, U.K.
33. SAAD, Y. 1994. A flexible inner-outer preconditioned GMRES algorithm. SIAM J. Sci. Statist. Comput. 14, 461-469.
34. SAAD, Y. 2003. Iterative Methods for Sparse Linear Systems, 2nd ed. SIAM, Philadelphia, PA, 273-275.
35. SKEEL, R. 1980. Iterative refinement implies numerical stability for Gaussian elimination. Math. Computat. 35, 817-832.