An optimized sparse approximate matrix multiply for matrices with decay

SIAM Journal on Scientific Computing

Volumn 35, Issue 1, 2013, Pages

  Bock, Nicolas ^a   Challacombe, Matt ^a  

^a LOS ALAMOS NATIONAL LABORATORY   (United States)

Author keywords

Matrices with decay; N body; Quantum chemistry; Reduced complexity algorithm; SpAMM; Sparse approximate matrix multiply; Sparse linear algebra

Indexed keywords

COMPUTATIONAL COMPLEXITY; QUANTUM CHEMISTRY;

COMPLEXITY ALGORITHMS; MATRIX; MATRIX MULTIPLY; MATRIX WITH DECAY; N-BODY; REDUCED COMPLEXITY ALGORITHM; REDUCED-COMPLEXITY; SPARSE APPROXIMATE MATRIX MULTIPLY; SPARSE LINEAR ALGEBRA;

MATRIX ALGEBRA;

EID: 84876211167     PISSN: 10648275     EISSN: 10957200     Source Type: Journal    
DOI: 10.1137/120870761     Document Type: Article

References (154)

1. S. K. Abdali and D. S. Wise, Experiments with quadtree representation of matrices, in Symbolic and Algebraic Computation, P. Gianni, ed., Lecture Notes in Comput. Sci. 358, Springer, Berlin, 1989, pp. 96-108.
2. M. D. Adams and D. S. Wise, Seven at one stroke: Results from a cache-oblivious paradigm for scalable matrix algorithms, in Proceedings of the 2006 Workshop on Memory System Performance and Correctness, MSPC '06, New York, 2006, ACM, pp. 41-50.
3. S. Aluru and F. E. Sevilgen, Parallel domain decomposition and load balancing using space-filling curves, in Proceedings of the 4th IEEE Conference on High Performance Computing, 1997, pp. 230-235.
4. R. R. Amossen and R. Pagh, Faster join-projects and sparse matrix multiplications, in Proceedings of the 12th International Conference on Database Theory, ACM, 2009, pp. 121- 126.
5. Q. Avril, V. Gouranton, and B. Arnaldi, New trends in collision detection performance, in VRIC'09 Proceedings, vol. 11, Laval, France, S. Richir and A. Shirai, ed., 2009, pp. 53-62.
6. A. H. Badawy, A. Aggarwal, D. Yeung, and C. W. Tseng, The efficacy of software prefetching and locality optimizations on future memory systems, J. Instruction-Level Parallelism, 6 (2004).
7. M. Bader, R. Franz, S. Guenther, and A. Heinecke, Hardware-oriented implementation of cache oblivious matrix operations based on space-filling curves, in Parallel Processing and Applied Mathematics, 7th International Conference, PPAM 2007, R. Wyrzykowski, J. Dongarra, K. Karczewski, and J. Wasniewski, eds., Lecture Notes in Comput. Sci. 4967, Springer, Berlin, 2008, p. 628.
8. E. H. Barragan and J. J. Steves, Performance analysis on multicore system using PAPI, in Proceedings of the 6th Colombian Computing Congress (CCC), 2011, pp. 1-5.
9. B. J. C. Baxter and G. Roussos, A new error estimate of the fast Gauss transform, SIAM J. Sci. Comput., 24 (2002), pp. 257-259.
10. P. Beckman, Parallel LU Decomposition for Sparse Matrices Using Quadtrees on a Shared- Heap Multiprocessor, Ph.D. thesis, Indiana University, 1993.
11. J. Bell, M. J. Berger, J. Saltzman, and M. Welcome, Three-dimensional adaptive mesh refinement for hyperbolic conservation laws, SIAM J. Sci. Comput., 15 (1994), pp. 127- 138.
12. M. Benzi, P. Boito, and N. Razouk, Decay Properties of Spectral Projectors with Applications to Electronic Structure, arXiv:1203.3953 [math.NA], 2012.
13. M. Benzi and G. H. Golub, Bounds for the entries of matrix functions with applications to preconditioning, BIT, 39 (1999), pp. 417-438.
14. M. Benzi and N. Razouk, Decay bounds and O(n) algorithms for approximating functions of sparse matrices, Electron. Trans. Numer. Anal., 28 (2007), pp. 16-39.
15. M. Benzi and M. Tuma, Orderings for factorized sparse approximate inverse preconditioners, SIAM J. Sci. Comput., 21 (2000), pp. 1851-1868.
16. M. J. Berger and P. Colella, Local adaptive mesh refinement for shock hydrodynamics, J. Comput. Phys., 82 (1989), pp. 64-84.
17. M. J. Berger and J. Oliger, Adaptive mesh refinement for hyperbolic partial differential equations, J. Comput. Phys., 53 (1984), pp. 484-512.
18. D. Bini and G. Lotti, Stability of fast algorithms for matrix multiplication, Numer. Math., 36 (1980), pp. 63-72.
19. J. Bittner, V. Havran, and P. Slavik, Hierarchical visibility culling with occlusion trees, in Proceedings, Computer Graphics International, 1998, pp. 207-219.
20. N. Bock, M. Challacombe, C. K. Gan, G. Henkelman, K. Nemeth, A. M. N. Niklasson, A. Odell, E. Schwegler, C. J. Tymczak, and V. Weber, FreeON: A Suite of Programs for Linear Scaling Quantum Chemistry, http://www.freeon.org (2011).
21. D. R. Bowler, T. Miyazaki, and M. J. Gillan, Recent progress in linear scaling ab initio electronic structure techniques, J. Phys. Condensed Matter, 14 (2002), pp. 2781-2798.
22. D. R. Bowler and T. Miyazaki, O(N) Methods in Electronic Structure Calculations, arXiv:1108.5976 [cond-mat.mtrl-sci], 2011.
23. A. Buluç and J. R. Gilbert, Challenges and advances in parallel sparse matrix-matrix multiplication, in ICPP '08: Proceedings of the 2008 37th International Conference on Parallel Processing, Washington, DC, IEEE Computer Society, 2008, pp. 503-510.
24. A. Buluç and J. R. Gilbert, On the representation and multiplication of hypersparse matrices, in IEEE International Symposium on Parallel and Distributed Processing, 2008, pp. 1-11.
25. A. Buluç and J. R. Gilbert, Parallel Sparse Matrix-Matrix Multiplication and Indexing: Implementation and Experiments, arXiv:1109.3739, 2011.
26. J. C. Burant, G. E. Scuseria, and M. J. Frisch, A linear scaling method for Hartree-Fock exchange calculations of large molecules, J. Chem. Phys., 105 (1996), pp. 8969-8972.
27. P. M. Campbell, K. D. Devine, J. E. Flaherty, L. G. Gervasio, and J. D. Teresco, Dynamic Octree Load Balancing Using Space-Filling Curves, Technical report, Department of Computer Science, Williams College, 2003.
28. L. E. Cannon, A Cellular Computer to Implement the Kaiman Filter Algorithm, Ph.D. dissertation, Montana State University, 1969.
29. M. Challacombe and N. Bock, Fast multiplication of matrices with decay, arXiv:1011.3534 [cs.DS], 2010.
30. M. Challacombe, E. Schwegler, and J. Almlöf, Computational Chemistry: Review of Current Trends, World Scientific, Singapore, 1996, pp. 53-107.
31. M. Challacombe, E. Schwegler, and J. Almlöf, Fast assembly of the Coulomb matrix: A quantum chemical tree code, J. Chem. Phys., 104 (1996), pp. 4685-4698.
32. M. Challacombe, E. Schwegler, and J. Almlöf, Modern Developments in Hartree-Fock Theory: Fast Methods for Computing the Coulomb Matrix, in Computational Chemistry: Reviews of Current Trends, J. Leszczynski, ed., Computational Chemistry: Reviews of Current Trends, vol. 1, World Scientific, Singapore, 1996, pp. 53-107.
33. M. Challacombe and E. Schwegler, Linear scaling computation of the Fock matrix, J. Chem. Phys., 106 (1997), pp. 5526-5536.
34. M. Challacombe, A simplified density matrix minimization for linear scaling self-consistent field theory, J. Chem. Phys., 110 (1999), pp. 2332-2342.
35. M. Challacombe, A general parallel sparse-blocked matrix multiply for linear scaling SCF theory, Comput. Phys. Comm., 128 (2000), pp. 93-107.
36. M. Challacombe, Linear scaling computation of the Fock matrix. V. Hierarchical cubature for numerical integration of the exchange-correlation matrix, J. Chem. Phys., 113 (2000), p. 10037.
37. S. Chandrasekaran, M. Gu, and W. Lyons, A fast adaptive solver for hierarchically semiseparable representations, Calcolo, 42 (2005), pp. 171-185.
38. S. Chandrasekaran, M. Gu, and T. Pals, A Fast ULV Decomposition Solver for Hierarchically Semiseparable Representations, SIAM J. Matrix Anal. Appl., 28 (2006), pp. 603- 622.
39. H. Cheng, L. Greengard, and V. Rokhlin, A fast adaptive multipole algorithm in three dimensions, J. Comput. Phys., 155 (1999), pp. 468-498.
40. S. Chen, A. Ailamaki, P. B. Gibbons, and T. C. Mowry, Improving hash join performance through prefetching, ACM Trans. Database Syst., 32 (2007), pp. 1-36.
41. T. M. Chilimbi, M. D. Hill, and J. R. Larus, Making pointer-based data structures cache conscious, Computer, 33 (2000), pp. 67-74.
42. M. G. Choi, E. Ju, J.-W. Chang, J. Lee, and Y. J. Kim, Linkless octree using multi-level perfect hashing, Computer Graphics Forum, 28 (2009), pp. 1773-1780.
43. D. Coppersmith and S. Winograd, Matrix multiplication via arithmetic progressions, J. Symbolic Comput., 9 (1990), pp. 251-280.
44. A. D. Daniels, J. M. Millam, and G. E. Scuseria, Semiempirical methods with conjugate gradient density matrix search to replace diagonalization for molecular systems containing thousands of atoms, J. Chem. Phys., 107 (1997), pp. 425-431.
45. S. Demko, W. F. Moss, and P. W. Smith, Decay rates for inverses of band matrices, Math. Comp., 43 (1984), pp. 491-499.
46. J. W. Demmel, I. Dumitriu, O. Holtz, and R. Kleinberg, Fast matrix multiplication is stable, Numer. Math., 106 (2007), pp. 199-224.
47. J. W. Demmel and N. J. Higham, Stability of block algorithms with fast level-3 blas, ACM Trans. Math. Software, 18 (1992), pp. 274-291.
48. K. D. Devine, E. G. Boman, R. T. Heaphy, B. A. Hendrickson, J. D. Teresco, J. Faik, J. E. Flaherty, and L. G. Gervasio, New challenges in dynamic load balancing, Appl. Numer. Math., 52 (2005), pp. 133-152.
49. J. L. Finkel and R. A. Bentley, Quad trees a data structure for retrieval on composite keys, Acta Inform., 4 (1974), pp. 1-9.
50. J. D. Frens and D. S. Wise, Auto-blocking matrix-multiplication or tracking blas3 performance from source code, SIGPLAN Not., 32 (1997), pp. 206-216.
51. M. Frigo, C. E. Leiserson, H. Prokop, and S. Ramachandran, Cache-oblivious algorithms, in Proceedings of the 40th Annual Symposium on Foundations of Computer Science, FOCS '99, Washington, DC, IEEE Computer Society, 1999, pp. 285-297.
52. S. T. Gabriel and D. S. Wise, The opie compiler from row-major source to morton-ordered matrices, in Proceedings of the 3rd Workshop on Memory Performance Issues: In Conjunction with the 31st International Symposium on Computer Architecture, WMPI '04, New York, ACM, 2004, pp. 136-144.
53. G. Galli, Linear scaling methods for electronic structure calculations and quantum molecular-dynamics simulations, Current Opinion in Solid State & Materials Science, 1 (1996), pp. 864-874.
54. C. K. Gan and M. Challacombe, Linear scaling computation of the Fock matrix. VI. Data parallel computation of the exchange-correlation matrix, J. Comput. Phys., 118 (2003), pp. 9128-9135.
55. I. Gargantini, An effective way to represent quadtrees, Commun. ACM, 25 (1982), pp. 905- 910.
56. G. Gaydadjiev and S. Vassiliadis, Sad prefetching for mpeg4 using flux caches, in Embedded Computer Systems: Architectures, Modeling, and Simulation, Lecture Notes in Comput. Sci. 4017, Springer, Berlin, 2006, pp. 248-258.
57. GNU compiler collection, http://gcc.gnu.org/.
58. A special flavor of Linux that can be automatically optimized and customized for just about any application or need, http://www.gentoo.org.
59. S. Goedecker and G. Scuseria, Linear scaling electronic structure methods in chemistry and physics, Comput. Sci. Engrg., 5 (2003), pp. 14-21.
60. S. Goedecker, Electronic Structure Methods Exhibiting Linear Scaling of the Computational Effort with Respect to the Size of the System, arXiv:9806073 [cond-mat], 1998.
61. S. Goedecker, Linear scaling electronic structure methods, Rev. Mod. Phys., 71 (1999), pp. 1085-1123.
62. K. Goto and R. A. van de Geijn, On Reducing TLB Misses in Matrix Multiplication, Technical report CS-TR-02-55, Department of Computer Sciences, University of Texas at Austin, 2002.
63. K. Goto and R. A. van de Geijn, Anatomy of high-performance matrix multiplication, ACM Trans. Math. Software, 34 (2008), pp. 12:1-12:25.
64. K. Goto and R. A. van de Geijn, High-performance implementation of the level-3 blas, ACM Trans. Math. Software, 35 (2008), pp. 4:1-4:14.
65. P. Gottschling, D. S. Wise, and M. D. Adams, Representation-transparent matrix algorithms with scalable performance, in Proceedings of the 21st Annual International Conference on Supercomputing, ICS '07, New York, ACM, 2007, pp. 116-125.
66. L. Grasedyck and W. Hackbusch, Construction and arithmetics of H-matrices, Computing, 70 (2003), pp. 295-334.
67. A. G. Gray and A. W. Moore, N-Body' Problems in Statistical Learning, in Advances in Neural Information Processing Systems, vol. 4, MIT Press, Cambridge, MA, 2001, pp. 521-527.
68. A. Gray, Bringing Tractability to Generalized N-Body Problems in Statistical and Scientific Computation, Ph.D. thesis, CMU-CS-04-189, School of Computer Science, Carnegie Mellon University, 2003.
69. L. Greengard and V. Rokhlin, A fast algorithm for particle simulations, J. Comput. Phys., 73 (1987), pp. 325-348.
70. L. Greengard and V. Rokhlin, The rapid evaluation of potential fields in three dimensions, in Vortex Methods, C. Anderson and C. Greengard, eds., Lecture Notes in Math. 1360, Springer, Berlin, 1988, pp. 121-141.
71. L. Greengard and V. Rokhlin, A new version of the fast multipole method for the Laplace equation in three dimensions, Acta Numer., (1997), pp. 229-269.
72. L. Greengard and J. Strain, The fast Gauss transform, SIAM J. Sci. Statist. Comput., 12 (1991), pp. 79-94.
73. J. Gunnels, F. G. Gustavson, K. Pingali, and K. Yotov, Is cache-oblivious dgemm viable?, in Proceedings of the 8th International Conference on Applied Parallel Computing: State of the Art in Scientific Computing, Springer-Verlag, Berlin, 2007, pp. 919-928.
74. F. G. Gustavson, L. Karlsson, and B. Ka°gström, Parallel and cache-efficient in-place matrix storage format conversion, ACM Trans. Math. Software, 38 (2012), pp. 1-32.
75. W. Hackbusch and S. Börm, Data-sparse approximation by adaptive H2-matrices, Computing, 69 (2002), pp. 1-35.
76. P. J. Hanlon, D. Chung, S. Chatterjee, D. Genius, A. R. Lebeck, and E. Parker, The combinatorics of cache misses during matrix multiplication, J. Comput. Systems Sci., 63 (2001), pp. 80-126.
77. L. Hernquist, Hierarchical n-body methods, Comput. Phys. Commun., 48 (1988), pp. 107- 115.
78. D. Hilbert, Über die stetige Abbildung einer Linie auf ein Flächenstück, Math. Ann. (1891), p. 459.
79. E. G. Hoel and H. Samet, Data-parallel spatial join algorithms, in International Conference on Parallel Processing, vol. 3, 1994, pp. 227-234.
80. Y. Huang and Z. Gu, Performance comparison of data prefetching for pointer-chasing applications, in 1st International Conference on Information Science and Engineering (ICISE), IEEE, 2009, pp. 307-310.
81. Intel 64 and IA-32 Architectures Optimization Reference Manual, 2009; available online from Intel, http://www.intel.com/content/www/us/en/ architecture-and-technology/64- ia-32-architectures-optimization-manual.html.
82. A. Iserles, How large is the exponential of a banded matrix?, J. New Zealand Math. Soc., 29 (2000), pp. 177-192.
83. E. H. Jacox and H. Samet, Iterative spatial join, ACM Trans. Database Syst., 28 (2003), pp. 230-256.
84. B. Jenkins, 32-Bit Hashes for Hash Table Lookup, http://burtleburtle.net/ bob/c/lookup3.c (2006).
85. G. Jin and J. Mellor-Crummey, Using space-filling curves for computation reordering, in Proceedings of the Los Alamos Computer Science Institute, 2005.
86. L. V. Kale and S. Krishnan, Charm++: Parallel programming with message-driven objects, in Parallel Programming Using C++, G. V. Wilson and P. Lu, eds., MIT Press, Cambridge, MA, 1996, pp. 175-213.
87. M. Karlsson, F. Dahlgren, and P. Stenström, A prefetching technique for irregular accesses to linked data structures, in Proceedings of the Sixth International Symposium on High-Performance Computer Architecture, IEEE, 2000, pp. 206-217.
88. C. Kim, T. Kaldewey, V. W. Lee, E. Sedlar, A. D. Nguyen, N. Satish, J. Chhugani, A. Di Blas, and P. Dubey, Sort vs. hash revisited: Fast join implementation on modern multi-core cpus, Proc. VLDB Endow., 2 (2009), pp. 1378-1389.
89. T. S. Lee, J. P. Lewis, and W. Yang, Linear-scaling quantum mechanical calculations of biological molecules: The divide-and-conquer approach, Comput. Materials Sci., 12 (1998), pp. 259-277.
90. S. Lefebvre and H. Hoppe, Perfect spatial hashing, ACM Trans. Graph., 25 (2006), pp. 579- 588.
91. S. Lefebvre and H. Hoppe, Perfect spatial hashing, in Proceedings of SIGGRAPH '06, New York, ACM, 2006, p. 579.
92. D. Levinthal, Performance Analysis Guide for Intel Core i7 Processor and Intel Xeon 5500 Processors, Intel, 2009.
93. T. Lewiner, V. Mello, A. Peixoto, S. Pesco, and H. Lopes, Fast generation of pointerless octree duals, Computer Graphics Forum, 29 (2010), p. 1661.
94. M. D. Lieberman, J. Sankaranarayanan, and H. Samet, A fast similarity join algorithm using graphics processing units, in Proceedings of the 2008 IEEE 24th International Conference on Data Engineering, Washington, DC, IEEE Computer Society, 2008, pp. 1111- 1120.
95. J. Lifflander, S. Krishnamoorthy, and L. Kale, Work stealing and persistence-based load balancers for iterative overdecomposed applications, in Proceedings of the 21st International Symposium on High-Performance Parallel and Distributed Computing, ACM, 2012, pp. 137-148.
96. W. F. Lin, S. K. Reinhardt, and D. Burger, Reducing dram latencies with an integrated memory hierarchy design, in Proceedings of the Seventh International Symposium on High-Performance Computer Architecture, IEEE, 2001, pp. 301-312.
97. P. Liu and S. Bhatt, Experiences with parallel n-body simulation, in Proceedings of the Sixth Annual ACM Symposium on Parallel Algorithms and Architectures, ACM, 1994, pp. 122-131.
98. Z. Y. Li, W. He, and J. L. Yang, Recent progress in density functional theory and its numerical methods, Progress in Chemistry, 17 (2005), pp. 192-202.
99. K. P. Lorton and D. S. Wise, Analyzing block locality in morton-order and morton-hybrid matrices, in Proceedings of the 2006 Workshop on Memory Performance: Dealing with Applications, Systems and Architectures, MEDEA '06, New York, ACM, 2006, pp. 5-12.
100. W. Ma and S. Krishnamoorthy, Data-driven fault tolerance for work stealing computations, in Proceedings of the 26th ACM International Conference on Supercomputing, ACM, 2012, pp. 79-90.
101. R. McWeeny, The density matrix in self-consistent field theory. I. Iterative construction of the density matrix, Proc. Roy. Soc. London A Mat., 235 (1956), pp. 496-509.
102. J. Mellor-Crummey, D. Whalley, and K. Kennedy, Improving memory hierarchy performance for irregular applications using data and computation reorderings, Internat. J. Parallel Programming, 29 (2001), pp. 217-247.
103. J. M. Millam and G. E. Scuseria, Linear scaling conjugate gradient density matrix search as an alternative to diagonalization for first principles electronic structure calculations, J. Chem. Phys., 106 (1997), pp. 5569-5577.
104. P. Mishra and M. H. Eich, Join processing in relational databases, ACM Comput. Surv., 24 (1992), pp. 63-113.
105. G. M. Morton, A Computer Oriented Geodetic Data Base and a New Technique in File Sequencing, Technical report, IBM, Ottawa, 1966.
106. P. J. Mucci, S. Browne, C. Deane, and G. Ho, PAPI: A portable interface to hardware performance counters, in Proceedings of the Department of Defense HPCMP Users Group Conference, 1999, pp. 7-10.
107. A. Nakano, R. K. Kalia, K.-I. Nomura, A. Sharma, P. Vashishta, F. Shimojo, A. C. T. van Duin, W. A. Goddard, R. Biswas, and D. Srivastava, A divideand- conquer/cellular-decomposition framework for million-to-billion atom simulations of chemical reactions, Comput. Materials Sci., 38 (2007), pp. 642-652.
108. A. M. N. Niklasson and M. Challacombe, Density matrix perturbation theory, Phys. Rev. Lett., 92 (2004), 193001.
109. A. M. N. Niklasson, C. J. Tymczak, and M. Challacombe, Trace resetting density matrix purification in O(N) self-consistent-field theory, J. Chem. Phys., 118 (2003), pp. 8611- 8620.
110. C. Ochsenfeld, C. A. White, and M. Head-Gordon, Linear and sublinear scaling formation of Hartree-Fock-type exchange matrices, J. Chem. Phys., 109 (1998), pp. 1663-1669.
111. J. H. Olsen and S. C. Skov, Cache-Oblivious Algorithms in Practice, Master's thesis, Department of Computer Science, University of Copenhagen, Denmark, 2002.
112. A. H. R. Palser and D. E. Manolopoulos, Canonical purification of the density matrix in electronic-structure theory, Phys. Rev. B, 58 (1998), pp. 12704-12711.
113. S. Pan, C. Cherng, K. Dick, and R. E. Ladner, Algorithms to take advantage of hardware prefetching, in Proceedings of the 9th Workshop on Algorithm Engineering and Experiments (ALENEX), 2007, pp. 91-98.
114. Performance Application Programming Interface, http://icl.cs.utk.edu/ papi/.
115. G. Peano, Sur une courbe, qui remplit toute une aire plane, Math. Ann., 36 (1890), pp. 157- 160.
116. H. Samet, The Design and Analysis of Spatial Data Structures, Addison-Wesley Longman, Boston, MA, 1990.
117. H. Samet, Foundations of Multidimensional and Metric Data Structures, Morgan Kaufmann, San Francisco, 2006.
118. D. A. Schneider and D. J. DeWitt, Tradeoffs in processing complex join queries via hashing in multiprocessor database machines, in Proceedings of the 16th International Conference on Very Large Databases, San Francisco, Morgan Kaufmann, 1990, pp. 469-480.
119. E. Schwegler, M. Challacombe, and M. Head-Gordon, Linear scaling computation of the Fock matrix. II. Rigorous bounds on exchange integrals and incremental Fock build, J. Chem. Phys., 106 (1997), pp. 9708-9717.
120. E. Schwegler, M. Challacombe, and M. Head-Gordon, A multipole acceptability criterion for electronic structure theory, J. Chem. Phys., 109 (1998), pp. 8764-8769.
121. G. Stitt, G. Chaudhari, and J. Coole, Traversal caches: A first step towards FPGA acceleration of pointer-based data structures, in Proceedings of the 6th IEEE/ACM/IFIP International Conference on Hardware/Software Codesign and System Synthesis, ACM, 2008, pp. 61-66.
122. G. Stitt and J. Villarreal, Recursion flattening, in Proceedings of the 18th ACM Great Lakes Symposium on VLSI, GLSVLSI '08, New York, ACM, 2008, pp. 131-134.
123. J. Strain, The fast Gauss transform with variable scales, SIAM J. Sci. Statist. Comput., 12 (1991), pp. 1131-1139.
124. V. Strassen, Gaussian elimination is not optimal, Numer. Math., 13 (1969), pp. 354-356.
125. A. Szabo and N. Ostlund, Modern Quantum Chemistry: Introduction to Advanced Electronic Structure Theory, Dover, New York, 1996.
126. P. Tang, Complete inlining of recursive calls: Beyond tail-recursion elimination, in Proceedings of the 44th Annual Southeast Regional Conference, ACM-SE 44, New York, ACM, 2006, pp. 579-584.
127. J. Thiyagalingam, O. Beckmann, and P. H. J. Kelly, Improving the performance of Morton layout by array alignment and loop unrolling: Reducing the price of naivety, in Proceedings of 16th International Workshop on Languages and Compilers for Parallel Computing, Lecture Notes in Comput. Sci. 2958, Springer-Verlag, Berlin, 2003, pp. 241- 257.
128. J. VandeVondele, U. Borštnik, and J. Hutter, Linear scaling self-consistent field calculations with millions of atoms in the condensed phase, J. Chem. Theory Comput., (2012).
129. R. A. van de Geijn and J. Watts, Summa: Scalable universal matrix multiplication algorithm, Concurrency Practice and Experience, 9 (1997), pp. 255-274.
130. V. Vassilevska Williams, Multiplying matrices faster than Coppersmith-Winograd, in Proceedings of the 44th Symposium on Theory of Computing, STOC '12, New York, ACM, 2012, pp. 887-898.
131. Z. Wang, D. Burger, K. S. McKinley, S. K. Reinhardt, and C. C. Weems, Guided region prefetching: A cooperative hardware/software approach, in ACM SIGARCH Computer Architecture News 31, ACM, New York, 2003, pp. 388-398.
132. X. Wan and G. E. Karniadakis, A sharp error estimate for the fast Gauss transform, J. Comput. Phys., 219 (2006), pp. 7-12.
133. M. S. Warren and J. K. Salmon, Astrophysical N-body simulations using hierarchical tree data structures, in Supercomputing '92, Los Alamitos, IEEE, 1992, pp. 570-576.
134. M. S. Warren and J. K. Salmon, Astrophysical n-body simulations using hierarchical tree data structures, in Proceedings of SC Conference, 1992, pp. 570-576.
135. M. S. Warren and J. K. Salmon, A parallel hashed oct-tree n-body algorithm, in Proceedings of the ACM/IEEE Conference on Supercomputing, New York, ACM, 1993, pp. 12-21.
136. M. S. Warren and J. K. Salmon, A Parallel, Portable and Versatile Treecode, SIAM, Philadelphia, 1995.
137. M. S. Warren and J. K. Salmon, A portable parallel particle program, Comput. Phys. Comm., 87 (1995), p. 266.
138. V. M. Weaver and S. A. McKee, Can hardware performance counters be trusted?, in Proceedings of the IEEE International Symposium on Workload Characterization, 2008, p. 141.
139. D. S. Wise and J. Franco, Costs of quadtree representation of nondense matrices, J. Parallel Distributed Computing, 9 (1990), pp. 282-296.
140. D. S. Wise, J. D. Frens, Y. Gu, and G. A. Alexander, Language support for Morton-order matrices, SIGPLAN Not., 36 (2001), pp. 24-33.
141. D. S. Wise, Representing matrices as quadtrees for parallel processors: Extended abstract, SIGSAM Bull., 18 (1984), pp. 24-25.
142. D. S. Wise, Ahnentafel indexing into Morton-ordered arrays, or matrix locality for free, in Euro-Par 2000 Parallel Processing, A. Bode, T. Ludwig, W. Karl, and R. Wismüller, eds., Lecture Notes in Comput. Sci. 1900, Springer, Berlin, 2000, pp. 774-783.
143. C. L. Yang and A. R. Lebeck, Push vs. pull: Data movement for linked data structures, in Proceedings of the 14th International Conference on Supercomputing, ACM, 2000, pp. 176-186.
144. C. Yang, R. Duraiswami, and N. Gumerov, Improved Fast Gauss Transform, Technical rep. CS-TR-4495, Department of Computer Science, University of Maryland, College Park, 2003.
145. W. Yang and T. S. Lee, A density-matrix divide-and-conquer approach for electronic structure calculations of large molecules, J. Chem. Phys., 103 (1995), p. 5674.
146. W. Yang, Direct calculation of electron density in density-functional theory, Phys. Rev. Lett, 66 (1991), pp. 1438-1441.
147. K. Yotov, T. Roeder, K. Pingali, J. Gunnels, and F. Gustavson, An experimental comparison of cache-oblivious and cache-conscious programs, in Proceedings of the 19th Annual ACM Symposium on Parallel Algorithms and Architectures, ACM, 2007, pp. 93- 104.
148. R. Yuster and U. Zwick, Fast sparse matrix multiplication, ACM Trans. Algorithms, 1 (2005), pp. 2-13.
149. Y.-S. Zou, G.-F. Ding, M.-H. Xu, and Y. He, Survey on real-time collision detection algorithms, Appl. Res. Comput., 25 (2008), pp. 8-12.
150. AMD Core Math Library (ACML), http://developer.amd.com/libraries/acml/.
151. Intel Cilk Plus, http://software.intel.com/en-us/articles/intel-cilk- plus/.
152. Intel Math Kernel Library (MKL), http://www.intel.com/software/products/ mkl/.
153. Intel SPMD Program Compiler, http://ispc.github.com/.
154. OpenMP, http://openmp.org/.