The University of Florida Sparse Matrix Collection

ACM Transactions on Mathematical Software

Volumn 38, Issue 1, 2011, Pages

  Davis, Timothy A ^a   Hu, Yifan ^b  

^a UNIVERSITY OF FLORIDA   (United States)

^b AT AND T LABS RESEARCH   (United States)

Author keywords

Graph drawing; Multilevel algorithms; Performance evaluation; Sparse Matrices

Indexed keywords

3D GEOMETRY; CHEMICAL PROCESS SIMULATION; DISCRETIZATIONS; ELECTROMAGNETICS; FINANCIAL MODELING; GRAPH DRAWING; GRAPH VISUALIZATION; MATHEMATICA; MODEL REDUCTION; MULTILEVEL ALGORITHM; NETWORKS AND GRAPHS; NUMERICAL LINEAR ALGEBRA; ONLINE SEARCH; PERFORMANCE EVALUATION; POWER NETWORKS; REAL APPLICATIONS; SPARSE MATRICES; UNIVERSITY OF FLORIDA; WIDE SPECTRUM;

ALGORITHMS; CIRCUIT SIMULATION; COMPUTATIONAL CHEMISTRY; COMPUTATIONAL ELECTROMAGNETICS; COMPUTATIONAL FLUID DYNAMICS; COMPUTATIONAL GEOMETRY; DRAWING (GRAPHICS); MATLAB; QUANTUM CHEMISTRY; SEMICONDUCTOR DEVICE MODELS; SEMICONDUCTOR DEVICES; THERMODYNAMICS; THREE DIMENSIONAL; VISUALIZATION;

MATRIX ALGEBRA;

EID: 81355161778     PISSN: 00983500     EISSN: 15577295     Source Type: Journal    
DOI: 10.1145/2049662.2049663     Document Type: Article

References (74)

1. AMESTOY, P. R.,DAVIS, T. A., AND DUFF, I. S. 1996. An approximate minimum degree ordering algorithm. SIAM J. Matrix Anal. Appl. 17, 4, 886-905.
2. AMESTOY, P. R., DAVIS, T. A., AND DUFF, I. S. 2004. Algorithm 837: AMD, an approximate minimum degree ordering algorithm. ACM Trans. Math. Softw. 30, 3, 381-388.
3. AMESTOY, P. R., LI, X., AND NG, E. G. 2007. Diagonal Markowitz scheme with local symmetrization. SIAM J. Matrix Anal. Appl. 29, 1, 228-244.
4. AMESTOY, P. R. AND PUGLISI, C. 2002. An unsymmetrized multifrontal LU factorization. SIAM J. Matrix Anal. Appl. 24, 553-569. (Pubitemid 36446422)
5. BAI, Z., DAY, D., DEMMEL, J., AND DONGARRA, J. 1996. Test matrix collection (non-Hermitian eigenvalue problems), Release 1. Tech. rep., University of Kentucky. ftp://ftp.ms.uky.edu/pub/misc/bai/Collection.
6. BAI, Z., DAY, D., DEMMEL, J., AND DONGARRA, J. Non-Hermitian eigenvalue problems. http://www.cs.ucdavis .edu/?bai/NEP. (Accessed 2008)
7. BARNES, J. ANDHUT, P. 1986. A hierarchical o(n log n) force-calculation algorithm. Lett. Nature 324, 4, 446-449.
8. BATAGELJ, V. AND MRVAR, A. Pajek networks. http://vlado.fmf.uni-lj.si/ pub/networks/data. (Accessed 2008)
9. BENZI, M. AND TUMA,M. 1998. A sparse approximate inverse preconditioner for nonsymmetric linear systems. SIAM J. Sci. Comput. 19, 968-994. (Pubitemid 128622541)
10. BERGER, A. J.,MULVEY, J. M., ROTHBERG, E., AND VANDERBEI, R. J. 1995. Solving multistage stochastic programs using tree dissection. Tech. rep. SOR-95-07, Department of Civil Engineering and Operations Research, Princeton University, Princeton, NJ.
11. BOISVERT, R. F., POZO, R., REMINGTON, K., BARRETT, R., DONGARRA, J., MILLER, B., AND LIPMAN, B. The Matrix Market. http://math.nist.gov/MatrixMarket. (Accessed 2008)
12. BOISVERT, R. F., POZO, R., REMINGTON, K., BARRETT, R., AND DONGARRA, J. J. 1997. The Matrix Market: A web resource for test matrix collections. In Quality of Numerical Software, Assessment and Enhancement, R. F. Boisvert, Ed., Chapman & Hall, London, 125-137. http://math.nist.gov/MatrixMarket.
13. BOMHOF, C. W. AND VAN DER VORST, H. A. 2000. A parallel linear system solver for circuit simulation problems. Numer. Linear Algebra Appl. 7, 7-8, 649-665.
14. BRAINMAN, I. AND TOLEDO, S. 2002. Nested-dissection orderings for sparse LU with partial pivoting. SIAM J. Matrix Anal. Appl. 23, 998-1012.
15. CHEN, Y., DAVIS, T. A.,HAGER, W. W., AND RAJAMANICKAM, S. 2008. Algorithm 887: Cholmod, supernodal sparse cholesky factorization and update/downdate. ACM Trans. Math. Softw. 35, 3, 1-14.
16. DAVIS, T. A. 2005. Algorithm 849: A concise sparse Cholesky factorization package. ACM Trans. Math. Softw. 31, 4, 587-591.
17. DAVIS, T. A. AND HAGER,W.W. 2009. Dynamic supernodes in sparse cholesky update/downdate and triangular solves. ACM Trans. Math. Softw. 35, 4, 1-23.
18. DEMMEL, J. W., EISENSTAT, S. C., GILBERT, J. R., LI, X. S., AND LIU, J. W. H. 1999a. A supernodal approach to sparse partial pivoting. SIAM J. Matrix Anal. Appl. 20, 3, 720-755. (Pubitemid 129332599)
19. DEMMEL, J. W., GILBERT, J. R., AND LI, X. S. 1999b. An asynchronous parallel supernodal algorithm for sparse Gaussian elimination. SIAM J. Matrix Anal. Appl. 20, 4, 915-952. (Pubitemid 129330051)
20. DUFF, I. S. 1974. Pivot selection and row ordering in Givens reductions on sparse matrices. Comput. 13, 239-248.
21. DUFF, I. S. 2001. YM11 documentation in HSL 2007. http://www.hsl.rl.ac. uk/specs/ym11.pdf.
22. DUFF, I. S.,GRIMES, R. G., AND LEWIS, J. G. 1989. Sparse matrix test problems. ACM Trans. Math. Softw. 15, 1, 1-14.
23. DUFF, I. S., GRIMES, R. G., AND LEWIS, J. G. 1997. The Rutherford-Boeing sparse matrix collection. Tech. rep. RAL-TR-97-031, Rutherford Appleton Laboratory, UK.
24. DUFF, I. S. AND KOSTER, J. 1999. The design and use of algorithms for permuting large entries to the diagonal of sparse matrices. SIAM J. Matrix Anal. Appl. 20, 4, 889-901. (Pubitemid 129330049)
25. DUFF, I. S. AND PRALET, S. 2005. Strategies for scaling and pivoting for sparse symmetric indefinite problems. SIAM J. Matrix Anal. Appl. 27, 2, 313-340.
26. DUFF, I. S. AND REID, J. K. 1979. Performance evaluation of codes for sparse matrix problems. In Performance Evaluation of Numerical Software, L. D. Fosdick, Ed., North-Holland, New York, 121-135.
27. DUFF, I. S. AND REID, J. K. 1996. Exploiting zeros on the diagonal in the direct solution of indefinite sparse symmetric linear systems. ACM Trans. Math. Softw. 22, 2, 227-257. (Pubitemid 126418654)
28. DUMAS, J.-G. Sparse integer matrices collection. http://ljk.imag.fr/ membres/Jean-Guillaume.Dumas/ simc.html. (Accessed 2008)
29. FELDMANN, P., MELVILLE, R., AND LONG, D. 1996. Efficient frequency domain analysis of large nonlinear analog circuits. In Proceedings of the IEEE Custom Integrated Circuits Conference. IEEE.
30. FRUCHTERMAN, T. M. J. AND REINGOLD, E. M. 1991. Graph drawing by force-directed placement. Softw. Pract. Exper. 21, 11, 1129-1164.
31. GAY, D. NETLIB LP test problems. http://www.netlib.org/lp. (Accessed 2008)
32. GEORGE, A., HEATH, M. T., AND NG, E. 1983. A comparison of some methods for solving sparse linear leastsquares problems. SIAM J. Sci. Statist. Comput. 4, 2, 177-187.
33. GEORGE, A. AND LIU, J.W.H. 1981. Computer Solution of Large Sparse Positive Definite Systems. Prentice-Hall, Englewood Cliffs, NJ.
34. GILBERT, J. R.,MOLER, C., AND SCHREIBER, R. 1992. Sparse matrices in MATLAB: design and implementation. SIAM J. Matrix Anal. Appl. 13, 1, 333-356.
35. GILBERT, J. R. AND PEIERLS, T. 1988. Sparse partial pivoting in time proportional to arithmetic operations. SIAM J. Sci. Statist. Comput. 9, 862-874.
36. GORTER, F. AND KASKY, A. 2010. The most intense moments the universe has ever known are the next 15 seconds. http://butdoesitfloat.com/496420/The-most- intense-moments-the-universe-has-ever-knownare- the-next-15.
37. GOULD, N., HU, Y., AND SCOTT, J. Gould/Hu/Scott collection. ftp://ftp.numerical.rl.ac.uk/pub/matrices/symmetric. (Accessed 2008)
38. GUPTA, A. 1996. Fast and effective algorithms for graph partitioning and sparse matrix ordering. Tech. rep. RC 20496 (90799), IBM Research Division, Yorktown Heights, NY.
39. GUPTA, A. 2002. Improved symbolic and numerical factorization algorithms for unsymmetric sparse matrices. SIAM J. Matrix Anal. Appl. 24, 529-552. (Pubitemid 36446421)
40. HACHUL, S. AND JüNGER, M. 2004. Drawing large graphs with a potential field based multilevel algorithm. In Proceedings of the 12th International Symposium on Graph Drawing (GD'04). Lecture Notes in Computer Science, vol. 3383. Springer, 285-295. (Pubitemid 41239571)
41. HIGHAM, N. J. 2002. Accuracy and Stability of Numerical Algorithms, 2nd Ed. SIAM, Philadelphia, PA.
42. HU, Y. F. 2005. Efficient and high-quality force-directed graph drawing. Mathematica J. 10, 37-71.
43. HU, Y. AND DAVIS, T. 2011. Sparse matrices. The Harvard Advocate, 42-43.
44. IEEE SPECTRUM EDITORIAL STAFF. 2010. The big picture: Pretty math problem. IEEE Spectrum 47, 10, 18-19.
45. KAMVAR, S. Stanford-Berkeley web matrices. http://www.stanford.edu/? sdkamvar. (Accessed 2008)
46. KAMVAR, S. D.,HAVELIWALA, T. H., AND GOLUB, G. H. 2004. Adaptive methods for the computation of page rank. Linear Algebra Appl. 386, 51-65.
47. KARYPIS, G. AND KUMAR, V. 1998. A fast and high quality multilevel scheme for partitioning irregular graphs. SIAM J. Sci. Comput. 20, 359-392. (Pubitemid 128689516)
48. KEITER, E., HUTCHINSON, S. A., HOEKSTRA, R., RANKIN, E., RUSSO, T., AND WATERS, L. 2003. Computational algorithms for device-circuit coupling. Tech. rep. SAND2003-0080, Sandia National Laboratories, Albequerque, NM.
49. KEMELMACHER, I. 2005. Indexing with unknown illumination and pose. In IEEE Conference on Computer Vision and Pattern Recognition. IEEE.
50. KISS, G. R., ARMSTRONG, C., MILROY, R., AND PIPER, J. 1973. An associative thesaurus of English and its computer analysis. In The Computer and Literary Studies, A. Aitken, R. Bailey, and N. Hamilton-Smith, Eds., Edinburgh University Press, Edinburgh, UK.
51. LABARRE, S. 2010. Geeky science problems double as works of art. http://www.fastcodesign.com/1662136/ geeky-science-problems-double-as-works-of- art.
52. LESKOVEC, J., CHAKRABARTI, D., KLEINBERG, J., AND FALOUTSOS, C. 2005. Realistic, mathematically tractable graph generation and evolution, using kronecker multiplication. In Knowledge Discovery in Databases (PKDD'05), A. Jorge, L. Torgo, P. Brazdil, R. Camacho, and J. Gama, Eds., Lecture Notes in Computer Science, vol. 3721. Springer, 133-145.
53. MCCONNELL, R.M. AND SPINRAD, J. P. 1999. Modular decomposition and transitive orientation. Discr.Math. 201, 189-241. (Pubitemid 129550415)
54. MÉSZÁROS, C. Linear programming test set. http://www.sztaki.hu/?meszaros/public ftp/lptestset. (Accessed 2008)
55. MILLER, J. J. H. AND WANG, S. 1991. An exponentially fitted finite element method for a stationary convectiondiffusion problem. In Computatioal Methods for Boundary and Interior Layers in Several Dimensions, J. J. H. Miller, Ed., Boole Press, Dublin, 120-137.
56. MITTELMANN, H. Linear programming test set. http://plato.asu.edu/ftp/ lptestset. (Accessed 2008)
57. NG, E. G. AND PEYTON, B. W. 1993. Block sparse Cholesky algorithms on advanced uniprocessor computers. SIAM J. Sci. Comput. 14, 5, 1034-1056.
58. PAGE, L., BRIN, S.,MOTWANI, R., AND WINOGRAD, T. 1998. The PageRank citation ranking: Bringing order to the web. Tech. rep., Stanford Digital Library Tech. Project, Stanford, CA.
59. RESENDE, M. G. C., RAMAKRISHNAN, K. G., AND DREZNER, Z. 1995. Computing lower bounds for the quadratic assignment problem with an interior point algorithm for linear programming. Oper. Res. 43, 781-791.
60. RUDNYI, E. B. Oberwolfach model reduction benchmarks. http://www.imtek.uni-freiburg.de/ simulation/benchmark. (Accessed 2008)
61. RUDNYI, E. B., VAN RIETBERGEN, B., AND KORVINK, J. G. 2006. Model reduction for high dimensional micro-FE models. In Proceedings of the 3rd HPC-Europa Transnational Access Meeting.
62. RUESKEN, A. 2002. Approximation of the determinant of large sparse symmetric positive definite matrices. SIAM J. Matrix Anal. Appl. 23, 3, 799-818.
63. SAAD, Y. 2003. Iterative Methods for Sparse Linear Systems, 2nd Ed. SIAM, Philadelphia, PA.
64. SAAD, Y. SPARSKIT collection. http://math.nist.gov/MatrixMarket/data/ SPARSKIT. (Accessed 2008)
65. SCHENK, O. University of Basel collection. http://www.computational. unibas.ch/computer science/scicomp/ matrices. (Accessed 2008)
66. SCHULZE, J. 2001. Towards a tighter coupling of bottom-up and top-down sparse matrix ordering methods. BIT 41, 4, 800-841. (Pubitemid 33631368)
67. TAYLOR, A. AND HIGHAM, D. J. 2009. CONTEST: A controllable test matrix toolbox for MATLAB. ACM Trans. Math. Softw. 35, 4, 1-17.
68. TREFETHEN, L. N. 2002. A hundred-dollar, hundred-digit challenge. SIAM News 35, 1.
69. VAN HEUKELUM, A., BARKEMA, G. T., AND BISSELING, R. H. 2002. DNA electrophoresis studied with the cage model. J. Comput. Phys. 180, 313-326.
70. WALSHAW, C. 2003. A multilevel algorithm for force-directed graph drawing. J. Graph Algor. Appl. 7, 253-285. (Pubitemid 39064694)
71. WATTS, D. J. AND STROGATZ, S. H. 1998. Collective dynamics of small-world networks. Nature 393, 440-442.
72. WILKINSON, J. H. 1971. Linear algebra; part II: the algebraic eigenvalue problem. In Handbook for Automatic Computation, J. H. Wilkinson and C. Reinsch, Eds., Vol. 2. Springer.
73. ZITNEY, S. E. 1992. Sparse matrix methods for chemical process separation calculations on supercomputers. In Proceedings of the Supercomputing '92 Conference. IEEE Computer Society Press. 414-423.
74. ZITNEY, S. E., MALLYA, J., DAVIS, T. A., AND STADTHERR, M. A. 1996. Multifrontal vs. frontal techniques for chemical process simulation on supercomputers. Comput. Chem. Engin. 20, 6/7, 641-646. (Pubitemid 126666058)