text:
% This file was created with JabRef 2.7b.
% Encoding: UTF-8

@article{Fornberg2013,
abstract = {Traditional finite difference (FD) methods are designed to be exact for low degree polynomials. They can be highly effective on Cartesian-type grids, but may fail for unstructured node layouts. Radial basis function-generated finite difference (RBF-FD) methods overcome this problem and, as a result, provide a much improved geometric flexibility. The calculation of RBF-FD weights involves a shape parameter ??. Small values of ?? (corresponding to near-flat RBFs) often lead to particularly accurate RBF-FD formulas. However, the most straightforward way to calculate the weights (RBF-Direct) becomes then numerically highly ill-conditioned. In contrast, the present algorithm remains numerically stable all the way into the ?????0 limit. Like the RBF-QR algorithm, it uses the idea of finding a numerically well-conditioned basis function set in the same function space as is spanned by the ill-conditioned near-flat original Gaussian RBFs. By exploiting some properties of the incomplete gamma function, it transpires that the change of basis can be achieved without dealing with any infinite expansions. Its strengths and weaknesses compared with the Contour-Pad??, RBF-RA, and RBF-QR algorithms are discussed. ?? 2012 Elsevier B.V. All rights reserved.},
author = {Fornberg, Bengt and Lehto, Erik and Powell, Collin},
doi = {10.1016/j.camwa.2012.11.006},
file = {:home/m/Desktop/Mendeley/Fornberg, Lehto, Powell/Fornberg, Lehto, Powell - 2013.pdf:pdf},
issn = {08981221},
journal = {Comput. Math. with Appl.},
keywords = {Gaussians,Ill-conditioning,RBF,RBF-FD,RBF-GA,Radial basis functions},
number = {4},
pages = {627--637},
title = {{Stable calculation of Gaussian-based RBF-FD stencils}},
volume = {65},
year = {2013}
}

@incollection{Rothlisberger2002,
year={2002},
booktitle={Bridging Time Scales: Molecular Simulations for the Next Decade},
volume={605},
series={Lecture Notes in Physics},
editor={Nielaba, Peter and Mareschal, Michel and Ciccotti, Giovanni},
title={Time and Length Scales in ab initio Molecular Dynamics},
publisher={Springer Berlin Heidelberg},
author={R\"{o}thlisberger, Ursula and Sprik, Michiel and Hutter, Jürg},
pages={413-442},
language={English}
}

@article{schaback2006kernel,
  title={Kernel techniques: from machine learning to meshless methods},
  author={Schaback, Robert and Wendland, Holger},
  journal={Acta Numerica},
  volume={15},
  pages={543--639},
  year={2006},
  publisher={Cambridge University Press}
}

@article{Schaback1995,
author = {Schaback, R},
journal = {Adv. Comput. Math.},
pages = {251--264},
title = {{Error estimates and condition numbers for radial basis function interpolants}},
volume = {3},
year = {1995}
}

@book{helgaker2008molecular,
  title={Molecular Electronic-structure Theory},
  author={Helgaker, T. and J{\o}rgensen, P. and Olsen, J.},
  year={2008},
  publisher={Wiley}
}

@article{Fornberg2014,
author = {Bengt Fornberg  and Natasha Flyer},
journal = {Acta Numerica},
title = {{Solving PDEs with Radial Basis Functions}},
note = {{Solving PDEs with Radial Basis Functions}},
year = {2015}
}

@article{Schaback2007,
author = {Schaback, Robert},
file = {:home/m/Desktop/Mendeley/Schaback/Schaback - 2007.pdf:pdf},
journal = {Electron. Resour.},
pages = {1--58},
title = {{A practical guide to Radial Basis Functions}},
year = {2007}
}

@article{sarra2014,
  title={Regularized symmetric positive definite matrix factorizations for linear systems arising from RBF interpolation and differentiation},
  author={Sarra, Scott A},
  journal={Engineering Analysis with Boundary Elements},
  volume={44},
  pages={76--86},
  year={2014},
  publisher={Elsevier}
}

@article{neumaier1998solving,
  title={Solving ill-conditioned and singular linear systems: A tutorial on regularization},
  author={Neumaier, Arnold},
  journal={SIAM review},
  volume={40},
  number={3},
  pages={636--666},
  year={1998},
  publisher={SIAM}
}

@ARTICLE{van1997summa,
  author = {{van de Geijn}, Robert A. and Watts, J.},
  title = {{SUMMA: Scalable universal matrix multiplication algorithm}},
  journal = {Concurrency Practice and Experience},
  year = {1997},
  volume = {9},
  pages = {255--274},
  number = {4}
}

@INCOLLECTION{springerlink:10.1007/3-540-51084-2_9,
  author = {Abdali, S. Kamal and Wise, David S.},
  title = {Experiments with quadtree representation of matrices},
  booktitle = {Symbolic and Algebraic Computation},
  publisher = {Springer Berlin / Heidelberg},
  year = {1989},
  editor = {Gianni, P.},
  volume = {358},
  series = {Lecture Notes in Computer Science},
  pages = {96-108},
  affiliation = {Tektronix Labs MS 50-662 P.O. Box 500 97077 Beaverton Oregon USA MS
	50-662 P.O. Box 500 97077 Beaverton Oregon USA},
  keyword = {Computer Science}
}

@INPROCEEDINGS{Adams:2006:SOS,
  author = {Adams, Michael D. and Wise, David S.},
  title = {Seven at one stroke: results from a cache-oblivious paradigm for scalable matrix algorithms},
  booktitle = {Proceedings of the 2006 workshop on Memory system performance and
	correctness},
  year = {2006},
  series = {MSPC '06},
  pages = {41--50},
  address = {New York, NY, USA},
  publisher = {ACM},
  acmid = {1178604},
  keywords = {Cholesky factorization, Morton-hybrid, TLB, cache misses, paging,
	parallel processing, quadtrees},
  location = {San Jose, California},
  numpages = {10}
}

@ARTICLE{JCC:JCC540030314,
  author = {Alml\"{o}f, Jan and Faegri, K. and Korsell, K.},
  title = {{Principles for a direct SCF approach to LICAO \emph{ab-initio} calculations}},
  journal = {Journal of Computational Chemistry},
  year = {1982},
  volume = {3},
  pages = {385--399},
  number = {3},
  publisher = {John Wiley \& Sons, Inc.}
}

@inproceedings{Sarje2010a,
abstract = {The emergence of cloud computing and Google's MapReduce paradigm is renewing interest in the development of broadly applicable high level abstractions as a means to deliver easy programmability and cyber resources to the user, while hiding complexities of system architecture, parallelism and algorithms, heterogeneity, and fault-tolerance. In this paper, we present a high-level framework for computations on tree structures. Despite the diversity and types of tree structures, and the algorithmic ways in which they are utilized, our abstraction provides sufficient generality to be broadly applicable. We show how certain frequently used operations on tree structures can be cast in terms of our framework. We further demonstrate the applicability of our framework by solving two applications -- k-nearest neighbors and fast multipole method (FMM) based simulations -- by merely using our framework in multiple ways. We developed a generic programming based implementation of the framework using C++ and MPI, and demonstrate its performance on the aforementioned applications using homogeneous multi-core clusters.},
author = {Sarje, Abhinav and Aluru, Srinivas},
booktitle = {Proc. Int. Conf. Parallel Process.},
file = {:home/m/Desktop/Mendeley/Sarje, Aluru/Sarje, Aluru - 2009.pdf:pdf},
pages = {343--352},
title = {{A MapReduce style framework for computations on trees}},
year = {2010}
}

@article{Gonzalez-Velez:2010:SAS:1890754.1890757,
 author = {Gonz\'{a}lez-V{\'e}lez, Horacio and Leyton, Mario},
 title = {A Survey of Algorithmic Skeleton Frameworks: High-level Structured Parallel Programming Enablers},
 journal = {Softw. Pract. Exper.},
 issue_date = {November 2010},
 volume = {40},
 number = {12},
 month = nov,
 year = {2010},
  pages = {1135--1160},
 numpages = {26},
  publisher = {John Wiley \& Sons, Inc.},
 address = {New York, NY, USA},
 keywords = {algorithmic skeletons, concurrent programming structures, parallel computing, parallel constructs, software patterns, structured parallelism},
}

@article {CPE:CPE3087,
author = {Totoo, Prabhat and Loidl, Hans-Wolfgang},
title = {Parallel Haskell implementations of the N-body problem},
journal = {Concurrency and Computation: Practice and Experience},
volume = {26},
number = {4},
pages = {987--1019},
keywords = {high-level parallel programming models, functional programming, n-body problem},
year = {2014},
}

@inproceedings{rodrigues2014triolet,
  title={Triolet: A programming system that unifies algorithmic skeleton interfaces for high-performance cluster computing},
  author={Rodrigues, Christopher and Jablin, Thomas and Dakkak, Abdul and Hwu, Wen-Mei},
  booktitle={ACM SIGPLAN Notices},
  volume={49},
  number={8},
  pages={247--258},
  year={2014},
  organization={ACM}
}

@INPROCEEDINGS{Aluru:1997:SFC,
  author = {Aluru, Srinivas and Sevilgen, Fatih E.},
  title = {{Parallel Domain Decomposition and Load Balancing Using Space-Filling Curves}},
  booktitle = {Proceedings of the 4th {IEEE} Conference on High Performance Computing},
  year = {1997},
  pages = {230--235}
}

@INPROCEEDINGS{Amossen09,
  author = {Amossen, R.~R. and Pagh, R.},
  title = {{Faster join-projects and sparse matrix multiplications}},
  booktitle = {Proceedings of the 12th International Conference on Database Theory},
  year = {2009},
  pages = {121--126},
  publisher = {ACM},
  keywords = {collapsing join-project,matrix multiplication,relational}
}

@ARTICLE{Anselin2003,
  author = {Anselin, Luc},
  title = {{Spatial Externalities, Spatial Multipliers, And Spatial Econometrics}},
  journal = {Int. Reg. Sci. Rev.},
  year = {2003},
  volume = {26},
  pages = {153--166},
  number = {2},
  month = apr,
  keywords = {model specification,spatial econometrics,spatial externalities,spatial
	multiplier},
}

@INPROCEEDINGS{AVRIL:2009:HAL-00412870:1,
  author = {Avril, Quentin and Gouranton, Val{\'e}rie and Arnaldi, Bruno},
  title = {{New trends in collision detection performance}},
  booktitle = {{VRIC'09 Proceedings}},
  year = {2009},
  editor = {Simon Richir \& Akihiko Shirai},
  volume = {11},
  pages = {53},
  address = {Laval, France},
  month = {Apr},
  affiliation = {BUNRAKU - INRIA - IRISA - CNRS : UMR6074 - INRIA - Institut National
	des Sciences Appliqu{\'e}es de Rennes - {\'E}cole normale sup{\'e}rieure
	de Cachan - ENS Cachan - Universit{\'e} de Rennes I},
  audience = {internationale},
  language = {Anglais}
}

@ARTICLE{badawy2004efficacy,
  author = {Badawy, A.~H. and Aggarwal, A. and Yeung, D. and Tseng, C.~W.},
  title = {The efficacy of software prefetching and locality optimizations on
	future memory systems},
  journal = {Journal of Instruction-Level Parallelism},
  year = {2004},
  volume = {6},
  number = {7}
}

@INPROCEEDINGS{bader08hardware-oriented,
  author = {Bader, Michael and Franz, Robert and G\"{u}nther, Stephan and Heinecke,
	Alexander},
  title = {{Hardware-oriented Implementation of Cache Oblivious Matrix Operations
	Based on Space-filling Curves}},
  booktitle = {Parallel Processing and Applied Mathematics, 7th International Conference,
	PPAM 2007},
  year = {2008},
  editor = {Wyrzykowski, Roman and Dongarra, Jack and Karczewski, Konrad and
	Wasniewski, Jerzy},
  volume = {4967},
  series = {Lecture Notes in Computer Science},
  pages = {628},
  month = {May},
  publisher = {Springer}
}

@ARTICLE{Bader:2006:SFC,
  author = {Bader, M. and Zenger, C.},
  title = {{A Cache Oblivious Algorithm for Matrix Multiplication Based on Peano's
	Space Filling Curve}},
  journal = {Lecture Notes in Computer Science},
  year = {2006},
  volume = {3911},
  pages = {1042--1049}
}

@ARTICLE{Bai98usingthe,
  author = {Zhaojun Bai and James Demmel},
  title = {Using The Matrix Sign Function To Compute Invariant Subspaces},
  journal = {SIAM J. Matrix Anal. Appl},
  year = {1998},
  volume = {19},
  pages = {205--225}
}

@INPROCEEDINGS{Ballard2013,
  author = {Ballard, Grey and Bulu\c{c}, Ayd\i{}n and Demmel, James and Grigori,
	Laura and Lipshitz, Benjamin and Schwartz, Oded and Toledo, Sivan},
  title = {{Communication Optimal Parallel Multiplication of Sparse Random Matrices}},
  booktitle = {Proceedings of the Twenty-fifth Annual ACM Symposium on Parallelism
	in Algorithms and Architectures},
  year = {2013},
  series = {SPAA '13},
  pages = {222--231},
  address = {New York, NY, USA},
  publisher = {ACM},
  acmid = {2486196},
  doi = {10.1145/2486159.2486196},
  isbn = {978-1-4503-1572-2},
  keywords = {communication-avoiding algorithms, communication-cost lower bounds,
	random graphs, sparse matrix multiplication},
  location = {Montr\&\#233;al, Qu\&\#233;bec, Canada},
  numpages = {10},
}

@INCOLLECTION{Ballard2012,
  author = {Ballard, Grey and Demmel, James and Holtz, Olga and Lipshitz, Benjamin
	and Schwartz, Oded},
  title = {{Graph Expansion Analysis for Communication Costs of Fast Rectangular
	Matrix Multiplication}},
  booktitle = {Design and Analysis of Algorithms},
  publisher = {Springer Berlin Heidelberg},
  year = {2012},
  editor = {Even, Guy and Rawitz, Dror},
  volume = {7659},
  series = {Lecture Notes in Computer Science},
  pages = {13-36},
  doi = {10.1007/978-3-642-34862-4_2},
  isbn = {978-3-642-34861-7},
  language = {English},
  owner = {nbock},
  timestamp = {2015.03.24}
}

@ARTICLE{Ballard2014,
  author = {Ballard, Grey and Demmel, James and Holtz, Olga and Schwartz, Oded},
  title = {{Communication costs of Strassen's matrix multiplication}},
  journal = {Communications of the ACM},
  year = {2014},
  volume = {57},
  pages = {107--114},
  number = {2},
  owner = {nbock},
  publisher = {ACM},
  timestamp = {2015.03.24}
}

@INPROCEEDINGS{Ballard2011,
  author = {Ballard, Grey and Demmel, James and Holtz, Olga and Schwartz, Oded},
  title = {{Graph Expansion and Communication Costs of Fast Matrix Multiplication}},
  booktitle = {Proceedings of the Twenty-third Annual ACM Symposium on Parallelism
	in Algorithms and Architectures},
  year = {2011},
  series = {SPAA '11},
  pages = {1--12},
  address = {New York, NY, USA},
  publisher = {ACM},
  acmid = {1989495},
  doi = {10.1145/1989493.1989495},
  isbn = {978-1-4503-0743-7},
  keywords = {communication avoiding algorithms, fast matrix multiplication, i/o-complexity},
  location = {San Jose, California, USA},
  numpages = {12}
}

@INPROCEEDINGS{5936277,
  author = {Barragan, E.~H. and Steves, J.~J.},
  title = {Performance analisys on multicore system using {PAPI}},
  booktitle = {Computing Congress (CCC), 2011 6th Colombian},
  year = {2011},
  pages = {1 -5},
  month = {may},
  doi = {10.1109/COLOMCC.2011.5936277},
  keywords = {AMD processor;Intel processor;commodity hardware;multicore system
	performance analysis;performance application programming interface;processor
	consumer market;supercomputers;application program interfaces;multiprocessing
	systems;performance evaluation;}
}

@ARTICLE{baxter:257,
  author = {Baxter, B.~J.~C. and Roussos, George},
  title = {{A New Error Estimate of the Fast Gauss Transform}},
  journal = {SIAM Journal on Scientific Computing},
  year = {2002},
  volume = {24},
  pages = {257-259},
  number = {1},
  doi = {10.1137/S1064827501396920},
  keywords = {fast Gauss transform; fast algorithms},
  publisher = {SIAM}
}

@ARTICLE{B3LYP:Becke,
  author = {Becke, Axel D.},
  title = {{Density-Functional thermochemistry. III. The role of exact exchange}},
  journal = {The Journal of Chemical Physics},
  year = {1993},
  volume = {98},
  pages = {5649-5652},
  number = {7},
  doi = {http://dx.doi.org/10.1063/1.464913}
}

@PHDTHESIS{beckman1993parallel,
  author = {Beckman, P.H.},
  title = {{Parallel LU decomposition for sparse matrices using quadtrees on
	a shared-heap multiprocessor}},
  school = {Indiana University},
  year = {1993}
}

@ARTICLE{bell:127,
  author = {Bell, John and Berger, Marsha J. and Saltzman, Jeff and Welcome,
	Mike},
  title = {{Three-Dimensional Adaptive Mesh Refinement for Hyperbolic Conservation
	Laws}},
  journal = {SIAM Journal on Scientific Computing},
  year = {1994},
  volume = {15},
  pages = {127-138},
  number = {1},
  doi = {10.1137/0915008},
  keywords = {adaptive methods; mesh refinement},
  publisher = {SIAM}
}

@ARTICLE{Benzi14,
  author = {Benzi, Michele},
  title = {{Lecture IV : Decay in Functions of Sparse Matrices}},
  year = {2014},
  pages = {15--20}
}

@ARTICLE{Benzi02,
  author = {Benzi, Michele},
  title = {{Preconditioning Techniques for Large Linear Systems: A Survey}},
  journal = {J. Comput. Phys.},
  year = {2002},
  volume = {182},
  pages = {418--477},
  number = {2},
  month = {Nov}
}

@ARTICLE{Benzi13,
  author = {Benzi, Michele and Boito, Paola and Razouk, N},
  title = {{Decay properties of spectral projectors with applications to electronic
	structure}},
  journal = {SIAM Rev.},
  year = {2013},
  volume = {55},
  pages = {3--64},
  number = {1}
}

@ARTICLE{Benzi2013,
  author = {Benzi, Michele and Boito, Paolo and Razouk, Nader},
  title = {{Decay Properties of Spectral Projectors with Applications to Electronic
	Structure}},
  journal = {SIAM Review},
  year = {2013},
  volume = {55},
  pages = {3-64},
  number = {1},
  doi = {10.1137/100814019},
  owner = {nbock},
  timestamp = {2014.04.21}
}

@ARTICLE{BenziDecay2012,
  author = {Benzi, Michele and Boito, Paolo and Razouk, Nader},
  title = {Decay properties of spectral projectors with applications to electronic
	structure},
  journal = {arXiv:math.NA},
  year = {2012},
  volume = {1203.3953}
}

@ARTICLE{Benzi1999,
  author = {Benzi, Michele and Golub, Gene H.},
  title = {Bounds for the entries of matrix functions with applications to preconditioning},
  journal = {BIT},
  year = {1999},
  volume = {39},
  pages = {417--438}
}

@ARTICLE{Benzi07,
  author = {Benzi, Michele and Razouk, Nader},
  title = {{DECAY BOUNDS AND O(n) ALGORITHMS FOR APPROXIMATING FUNCTIONS OF
	SPARSE MATRICES}},
  journal = {Electron. Trans. Numer. Anal.},
  year = {2007},
  volume = {28},
  pages = {16--39}
}

@ARTICLE{Benzi:2007:Decay,
  author = {Benzi, Michele and Razouk, Nader},
  title = {{Decay Bounds and $\mathcal{O}(n)$ Algorithms for Approximating Functions
	of Sparse Matrices}},
  journal = {Electron.~T.~Numer.~Ana.},
  year = {2007},
  volume = {28},
  pages = {16},
  abstract = {We establish decay bounds for the entries of f(A), where A is a sparse
	(in particular, banded) n x n diagonalizable matrix and f is smooth
	on a subset of the complex plane containing the spectrum of A. Combined
	with techniques from approximation theory, the bounds are used to
	compute sparse (or banded) approximations to f(A), resulting in algorithms
	that under appropriate conditions have linear complexity in the matrix
	dimension. Applications to various types of problems are discussed
	and illustrated by numerical examples.}
}

@ARTICLE{Benzi:2000:Inv,
  author = {Benzi, Michele and Tuma, Miroslav},
  title = {{Orderings for factorized sparse approximate inverse preconditioners}},
  journal = {SIAM J.~Sci.~Comput.},
  year = {2000},
  volume = {21},
  pages = {1851--1868},
  number = {5},
  publisher = {Philadelphia, PA: SIAM, c1993-}
}

@ARTICLE{Benzi99,
  author = {Benzi, Michele and Tuma, M},
  title = {{A comparative study of sparse approximate inverse preconditioners}},
  journal = {Appl. Numer. Math.},
  year = {1999},
  volume = {30},
  pages = {305--340},
  number = {2030706}
}

@ARTICLE{Berger198964,
  author = {Berger, Marsha J. and Colella, P.},
  title = {Local adaptive mesh refinement for shock hydrodynamics},
  journal = {Journal of Computational Physics},
  year = {1989},
  volume = {82},
  pages = {64 - 84},
  number = {1},
  doi = {10.1016/0021-9991(89)90035-1}
}

@ARTICLE{Berger1984484,
  author = {Berger, Marsha J. and Oliger, Joseph},
  title = {Adaptive mesh refinement for hyperbolic partial differential equations},
  journal = {Journal of Computational Physics},
  year = {1984},
  volume = {53},
  pages = {484 - 512},
  number = {3},
  doi = {10.1016/0021-9991(84)90073-1}
}

@MISC{MADNESS:2010,
  author = {Beylkin, Gregory and Fann,George and Gan, Zhenting and Harrison,
	Robert and Mohlenkamp, Martin and Perez , Fernando and Yanai, Takeshi},
  title = {{MADNESS: Multiresolution ADaptive NumErical Scientific Simulation}},
  year = {2010}
}

@TECHREPORT{NamdSC07,
  author = {Abhinav Bhatele and Sameer Kumar and Chao Mei and James C. Phillips
	and Gengbin Zheng and Laxmikant V. Kal\'{e}},
  title = {{NAMD: A Portable and Highly Scalable Program for Biomolecular Simulations}},
  institution = {Department of Computer Science, University of Illinois at Urbana-Champaign},
  year = {2009},
  number = {UIUCDCS-R-2009-3034},
  month = {February}
}

@ARTICLE{Bini:1980:FastMM,
  author = {Bini, Dario and Lotti, Grazia},
  title = {Stability of fast algorithms for matrix multiplication},
  journal = {Numerische Mathematik},
  year = {1980},
  volume = {36},
  pages = {63-72},
  affiliation = {Institute of Mathematics University of Pisa Pisa Italy},
  issue = {1},
  keyword = {Mathematics and Statistics},
  publisher = {Springer Berlin / Heidelberg}
}

@INPROCEEDINGS{694268,
  author = {Bittner, J. and Havran, V. and Slavik, P.},
  title = {Hierarchical visibility culling with occlusion trees},
  booktitle = {Computer Graphics International, 1998. Proceedings},
  year = {1998},
  pages = {207 -219},
  month = {jun},
  doi = {10.1109/CGI.1998.694268},
  keywords = {hierarchical visibility culling;high depth complexity;occlusion tree
	occlusion volumes;occlusion trees;output-sensitive algorithms;polygonal
	occluders;rendering;spatial hierarchy;viewpoint-to-region visibility;visible
	graphic primitives;computational complexity;rendering (computer graphics);virtual
	reality;}
}

@MISC{charmbug_445,
  author = {Nicolas Bock},
  title = {{Bug \#445: Communication aware load balancers fail on chare arrays
	that are not full}},
  owner = {nbock},
  timestamp = {2014.05.14},
  url = {https://charm.cs.illinois.edu/redmine/issues/445}
}

@ARTICLE{Bock2013,
  author = {Bock, Nicolas and Challacombe, Matt},
  title = {{An Optimized Sparse Approximate Matrix Multiply for Matrices with
	Decay}},
  journal = {SIAM Journal on Scientific Computing},
  year = {2013},
  volume = {35},
  pages = {C72--C98},
  number = {1},
  month = {January},
  abstract = {{{We present an optimized single-precision implementation of the sparse
	approximate matrix multiply (SpAMM\}) [M. Challacombe and N. Bock,
	arXiv 1011.3534, 2010], a fast algorithm for matrix-matrix multiplication
	for matrices with decay that achieves an \$\backslash mathcal\{O\}
	( n \backslash log n )\$ computational complexity with respect to
	matrix dimension \$n\$. We find that the max norm of the error achieved
	with a SpAMM tolerance below \$2 \backslash times 10\^{}\{-8\}\$
	is lower than that of the single-precision general matrix-matrix
	multiply (SGEMM\}) for dense quantum chemical matrices, while outperforming
	SGEMM with a cross-over already for small matrices (\$n \backslash
	sim 1000\$). Relative to naive implementations of SpAMM using Intel's
	Math Kernel Library or AMD's Core Math Library, our optimized version
	is found to be significantly faster. Detailed performance comparisons
	are made for quantum chemical matrices with differently structured
	sub-blocks. Finally, we discuss the potential of improved hardware
	prefetch to yield 2x to 3x speedups.},
  doi = {10.1137/120870761},
  keywords = {\$N\$-body,15-04,65-04,65F15,65Z15,SpAMM,matrices with decay,quantum
	chemistry,reduced complexity algorithm,sparse approximate matrix
	multiply,sparse linear algebra},
  language = {en},
  publisher = {Society for Industrial and Applied Mathematics},
  timestamp = {2014.01.24}
}

@MISC{spammpack,
  author = {Bock, Nicolas and Challacombe, Matt},
  title = {{spammpack, A High-Performance Implemenation of SpAMM}},
  year = {2011},
  note = {\url{http://www.freeon.org/spammpack}},
  url = {http://www.freeon.org/spammpack}
}

@MISC{FreeON,
  author = {Bock, Nicolas and Challacombe, Matt and Gan, Chee~Kwan and Henkelman,
	Graeme and Nemeth, Karoly and Niklasson, Anders M.~N. and Odell,
	Anders and Schwegler, Eric and Tymczak, C.~J. and Weber, Valery},
  title = {{{\sc FreeON}: A suite of programs for linear scaling quantum chemistry}},
  year = {2011},
  note = {\url{http://www.freeon.org/}}
}

@MISC{FreeON:2010,
  author = {Bock, Nicolas and Challacombe, Matt and Gan, Chee~Kwan and Henkelman,
	Graeme and Nemeth, Karoly and Niklasson, Anders M.~N. and Odell,
	Anders and Schwegler, Eric and Tymczak, C.~J. and Weber, Valery},
  title = {{FreeON}: A linear scaling suite of quantum chemistry programs in
	the common domain.},
  year = {2010},
  note = {\url{http://en.wikipedia.org/wiki/FreeON}},
  timestamp = {2010.07.03},
  url = {http://en.wikipedia.org/wiki/FreeON}
}

@ARTICLE{Bodewig57,
  author = {Bodewig, E.},
  title = {{Matrix Calculus}},
  year = {1957},
  volume = {10},
  pages = {52},
  number = {3}
}

@ARTICLE{Borstnik201447,
  author = {Urban Bor\v{s}tnik and Joost {VandeVondele} and Val\'{e}ry Weber
	and J\"{u}rg Hutter},
  title = {{Sparse matrix multiplication: The distributed block-compressed sparse
	row library}},
  journal = {Parallel Computing},
  year = {2014},
  volume = {40},
  pages = {47 - 58},
  number = {5–6},
  keywords = {Sparse matrix}
}

@ARTICLE{Bowler1999,
  author = {D.R. Bowler and M.J. Gillan},
  title = {Density matrices in $\mathcal{O}(N)$ electronic structure calculations:
	theory and applications },
  journal = {Computer Physics Communications },
  year = {1999},
  volume = {120},
  pages = {95 - 108},
  number = {2–3},
  doi = {http://dx.doi.org/10.1016/S0010-4655(99)00221-0},
  issn = {0010-4655},
  owner = {nbock},
  timestamp = {2015.03.26}
}

@ARTICLE{Bowler00,
  author = {D. R. Bowler and T. Miyazakia andM. J. Gillan},
  title = {Parallel sparse matrix multiplication for linear scaling electronic
	structure calculations},
  journal = {Comp. Phys. Comm.},
  year = {2000},
  volume = {137},
  pages = {255--273},
  number = {2}
}

@ARTICLE{bowler12,
  author = {Bowler, D R and Miyazaki, T},
  title = {{$\mathcal \{O\}(N)$ methods in electronic structure calculations}},
  journal = {Reports Prog. Phys.},
  year = {2012},
  volume = {75},
  pages = {36503},
  number = {3}
}

@ARTICLE{Bowler2012,
  author = {Bowler, David R. and Miyazaki, T.},
  title = {$\mathcal{O}(N)$ methods in electronic structure calculations},
  journal = {Reports on Progress in Physics},
  year = {2012},
  volume = {75},
  pages = {036503},
  number = {3}
}

@ARTICLE{Bowler2010,
  author = {Bowler, David R. and Miyazaki, T.},
  title = {Calculations for millions of atoms with density functional theory:
	linear scaling shows its potential},
  journal = {Journal of Physics: Condensed Matter},
  year = {2010},
  volume = {22},
  pages = {074207},
  number = {7},
  abstract = {An overview of the CONQUEST linear scaling density functional theory
	(DFT) code is given, focusing particularly on the scaling behaviour
	on modern high-performance computing platforms. We demonstrate that
	essentially perfect linear scaling and weak parallel scaling (with
	fixed number of atoms per processor core) can be achieved, and that
	DFT calculations on millions of atoms are now possible.}
}

@ARTICLE{Bowler2002,
  author = {Bowler, David R. and Miyazaki, T. and Gillan, M.~J.},
  title = {Recent progress in linear scaling ab initio electronic structure
	techniques},
  journal = {Journal of Physics: Condensed Matter},
  year = {2002},
  volume = {14},
  pages = {2781},
  number = {11},
  abstract = {We describe recent progress in developing linear scaling ab initio
	electronic structure methods, referring in particular to our highly
	parallel code CONQUEST. After reviewing the state of the field, we
	present the basic ideas underlying almost all linear scaling methods,
	and discuss specific practical details of the implementation. We
	also note the connection between linear scaling methods and embedding
	techniques.}
}

@ARTICLE{Bowler2001,
  author = {Bowler, David R. and Miyazaki, T. and Gillan, M.~J.},
  title = {Parallel sparse matrix multiplication for linear scaling electronic
	structure calculations },
  journal = {Computer Physics Communications },
  year = {2001},
  volume = {137},
  pages = {255 - 273},
  number = {2},
  doi = {http://dx.doi.org/10.1016/S0010-4655(01)00164-3}
}

@ARTICLE{Bowler2014:comment,
  author = {Bowler, David R. and Miyazaki, Tsuyoshi and Truflandier, Lionel A.
	and Gillan, Michael J.},
  title = {{Comment on "Accurate and Scalable O(N) Algorithm for First-Principles
	Molecular-Dynamics Computations on Large Parallel Computers"}},
  journal = {arXiv:cont-mat.mtrl-sci},
  year = {2014},
  volume = {1402.6828}
}

@ARTICLE{Brazdova2008,
  author = {Br\'{a}zdov\'{a}, V. and Bowler, David R.},
  title = {{Automatic data distribution and load balancing with space-filling
	curves: implementation in CONQUEST}},
  journal = {Journal of Physics: Condensed Matter},
  year = {2008},
  volume = {20},
  pages = {275223},
  number = {27},
  abstract = {We present an automatic, spatially local data distribution and load
	balancing scheme applicable to many-body problems running on parallel
	architectures. The particle distribution is based on spatial decomposition
	of the simulation cell. A one-dimensional Hilbert curve is mapped
	onto the three-dimensional real space cell, which reduces the dimensionality
	of the problem and provides a way to assign different spatially local
	parts of the cell to each processor. The scheme is independent of
	the number of processors. It can be used for both ordered and disordered
	structures and does not depend on the dimensionality or shape of
	the system. Details of implementation in the linear-scaling density
	functional code CONQUEST, as well as several case studies of systems
	of various complexity, containing up to 55,755 particles, are given.},
  doi = {10.1088/0953-8984/20/27/275223}
}

@ARTICLE{buluc2011parallel,
  author = {Bulu\c{c}, Ayd\i{}n and Gilbert, John R.},
  title = {{Parallel Sparse Matrix-Matrix Multiplication and Indexing: Implementation
	and Experiments}},
  journal = {Arxiv preprint arXiv:1109.3739},
  year = {2011}
}

@TECHREPORT{Buluc2010,
  author = {Bulu\c{c}, Ayd\i{}n and Gilbert, John R.},
  title = {Highly parallel sparse matrix-matrix multiplication},
  institution = {University of California},
  year = {2010},
  type = {Technical Report},
  number = {UCSB-CS-2010-10},
  owner = {nbock},
  timestamp = {2014.04.21}
}

@INPROCEEDINGS{4536313,
  author = {Bulu\c{c}, Ayd\i{}n and Gilbert, John R.},
  title = {On the representation and multiplication of hypersparse matrices},
  booktitle = {Parallel and Distributed Processing, 2008. IPDPS 2008. IEEE International
	Symposium on},
  year = {2008},
  pages = {1-11},
  month = {April},
  doi = {10.1109/IPDPS.2008.4536313},
  keywords = {microcomputers;multiprocessing systems;sparse matrices;SpGEMM;data
	structure;hypersparse matrices;massive parallelism;multicore processors;multiplication
	algorithms;parallel sparse matrix multiplication;polyalgorithm;sequential
	kernel;single processor;Algorithm design and analysis;Arithmetic;Computer
	science;Concurrent computing;Kernel;Multicore processing;Numerical
	analysis;Partitioning algorithms;Sparse matrices;Transmission line
	matrix methods}
}

@INPROCEEDINGS{Buluc2008,
  author = {Bulu\c{c}, Ayd\i{}n and Gilbert, John R.},
  title = {{On the representation and multiplication of hypersparse matrices}},
  booktitle = {2008 IEEE International Symposium on Parallel and Distributed Processing},
  year = {2008},
  pages = {1--11},
  month = apr,
  publisher = {IEEE},
  keywords = {Algorithm design and analysis,Arithmetic,Computer science,Concurrent
	computing,Kernel,Multicore processing,Numerical analysis,Partitioning
	algorithms,SpGEMM,Sparse matrices,Transmission line matrix methods,data
	structure,hypersparse matrices,massive parallelism,microcomputers,multicore
	processors,multiplication algorithms,multiprocessing systems,parallel
	sparse matrix multiplication,polyalgorithm,sequential kernel,single
	processor},
  language = {English}
}

@INPROCEEDINGS{Buluc:2008:SpMM,
  author = {Bulu\c{c}, Ayd\i{}n and Gilbert, John R.},
  title = {{Challenges and Advances in Parallel Sparse Matrix-Matrix Multiplication}},
  booktitle = {{ICPP} '08: Proceedings of the 2008 37th International Conference
	on Parallel Processing},
  year = {2008},
  pages = {503--510},
  address = {Washington, DC, USA},
  publisher = {IEEE Computer Society}
}

@ARTICLE{burant:8969,
  author = {Burant, John C. and Scuseria, Gustavo E. and Frisch, Michael J.},
  title = {{A linear scaling method for Hartree--Fock exchange calculations
	of large molecules}},
  journal = {The Journal of Chemical Physics},
  year = {1996},
  volume = {105},
  pages = {8969-8972},
  number = {19},
  doi = {10.1063/1.472627},
  keywords = {HARTREE-FOCK METHOD; MOLECULAR CLUSTERS; GLYCINE; WATER; SCALING;
	EXCHANGE INTERACTIONS; DIAMONDS; CALCULATION METHODS; DENSITY FUNCTIONAL
	METHOD; ALGORITHMS; CHARGE DISTRIBUTION},
  publisher = {AIP}
}

@ARTICLE{Bylaska2009,
  author = {Eric J Bylaska and Kevin Glass and Doug Baxter and Scott B Baden
	and John H Weare},
  title = {{Hard scaling challenges for ab initio molecular dynamics capabilities
	in NWChem: Using 100,000 CPUs per second}},
  journal = {Journal of Physics: Conference Series},
  year = {2009},
  volume = {180},
  pages = {012028},
  number = {1},
  abstract = {An overview of the parallel algorithms for ab initio molecular dynamics
	(AIMD) used in the NWChem program package is presented, including
	recent developments for computing exact exchange. These algorithms
	make use of a two-dimensional processor geometry proposed by Gygi
	et al. for use in AIMD algorithms. Using this strategy, a highly
	scalable algorithm for exact exchange has been developed and incorporated
	into AIMD. This new algorithm for exact exchange employs an incomplete
	butterfly to overcome the bottleneck associated with exact exchange
	term, and it makes judicious use of data replication. Initial testing
	has shown that this algorithm can scale to over 20,000 CPUs even
	for a modest size simulation.},
  doi = {10.1088/1742-6596/180/1/012028}
}

@misc{Kahan2013,
author = {Kahan},
title = {{A Tutorial Overview of Vector and Matrix Norms}},
url="www.cs.berkeley.edu/~wkahan/MathH110/NormOvrv.pdf",
year = {2013}
}

@TECHREPORT{Campbell:2003:SFC,
  author = {Campbell, P.~M. and Devine, K.~D. and Flaherty, J.~E. and Gervasio,
	L.~G. and Teresco, J.~D.},
  title = {Dynamic octree load balancing using space-filling curves},
  institution = {Williams College Department of Computer Science},
  year = {2003},
  timestamp = {2010.07.03}
}

@PHDTHESIS{cannon1969cellular,
  author = {Cannon, L.~E.},
  title = {{A Cellular Computer to Implement the Kaiman Filter Algorithm}},
  school = {Ph. D. Dissertation, Montana State University},
  year = {1969}
}

@ARTICLE{Canuto2014,
  author = {Canuto, Claudio and Simoncini, Valeria and Verani, Marco},
  title = {{On the decay of the inverse of matrices that are sum of Kronecker
	products}},
  journal = {Linear Algebra Appl.},
  year = {2014},
  pages = {1--17},
  archiveprefix = {arXiv},
  arxivid = {arXiv:1312.6631v1},
  eprint = {arXiv:1312.6631v1}
}

@ARTICLE{Canuto2014a,
  author = {Canuto, Claudio and Simoncini, Valeria and Verani, Marco},
  title = {{On the decay of the inverse of matrices that are sum of Kronecker
	products}},
  journal = {Linear Algebra Appl.},
  year = {2014},
  pages = {1--17},
  archiveprefix = {arXiv},
  arxivid = {arXiv:1312.6631v1},
  eprint = {arXiv:1312.6631v1}
}

@ARTICLE{Challacombe2014,
  author = {Challacombe, Matt},
  title = {{Linear Scaling Solution of the Time-Dependent Self-Consistent-Field
	Equations}},
  journal = {Computation},
  year = {2014},
  volume = {2},
  pages = {1--11},
  number = {1},
  __markedentry = {[nbock:]},
  doi = {10.3390/computation2010001},
  issn = {2079-3197},
  owner = {nbock},
  timestamp = {2014.05.12}
}

@ARTICLE{Challacombe:2010:TDSCF,
  author = {Matt Challacombe},
  title = {{Linear Scaling Solution of the Time-Dependent Self-Consistent-Field
	Equations}},
  journal = {arXiv:quant-ph},
  year = {2010},
  volume = {1001.2586}
}

@ARTICLE{challacombe00,
  author = {Challacombe, Matt},
  title = {{A general parallel sparse-blocked matrix multiply for linear scaling
	SCF theory}},
  journal = {Comput. Phys. Commun.},
  year = {2000},
  volume = {128},
  pages = {93--107},
  number = {1},
  publisher = {Elsevier}
}

@article{challacombe1999simplified,
  title={A simplified density matrix minimization for linear scaling self-consistent field theory},
  author={Challacombe, Matt},
  journal={The Journal of chemical physics},
  volume={110},
  number={5},
  pages={2332--2342},
  year={1999},
  publisher={AIP Publishing}
}

@ARTICLE{Challacombe:2000:HiCu,
  author = {Matt Challacombe},
  title = {Linear scaling computation of the {F}ock matrix. {V}. Hierarchical
	Cubature for numerical integration of the exchange-correlation matrix},
  journal = {J.~Chem.~Phys.},
  year = {2000},
  volume = {113},
  pages = {10037},
  timestamp = {2010.07.03}
}

@article{DDH07,
year={2007},
journal={Numerische Mathematik},
volume={108},
number={1},
title={Fast linear algebra is stable},
publisher={Springer-Verlag},
keywords={65F05; 65F15; 65F25; 65F30; 65F35; 65F40; 65G30; 65G50; 65Y20; 68Q25; 68W20; 68W40; 15A52},
author={Demmel, James and Dumitriu, Ioana and Holtz, Olga},
pages={59-91},
language={English}
}

@ARTICLE{Challacombe:2000:SpMM,
  author = {Matt Challacombe},
  title = {{A} general parallel sparse-blocked matrix multiply for linear scaling{SCF}
	theory.},
  journal = {Comp.~Phys.~Comm.},
  year = {2000},
  volume = {128},
  pages = {93}
}

@ARTICLE{Challacombe:1999:DMM,
  author = {Matt Challacombe},
  title = {A simplified density matrix minimization for linear scaling self-consistent
	field theory},
  journal = {J.~Chem.~Phys.},
  year = {1999},
  volume = {110},
  pages = {2332--2342}
}

@ARTICLE{Challacombe2015,
  author = {Challacombe, Matt and Bock, Nicolas},
  title = {{On the scalibility of Newton Schulz Iterations in an Approximate
	Linear Algebra}},
  journal = {in preparation},
  year = {2015},
  owner = {nbock},
  timestamp = {2014.04.22}
}

@ARTICLE{challacombe2014n,
  author = {Challacombe, Matt and Bock, Nicolas},
  title = {{An $N$-Body Solution to the Problem of Fock Exchange}},
  journal = {arXiv preprint arXiv:1401.6961},
  year = {2014}
}

@article{BockCK14,
  author    = {Nicolas Bock and
               Matt Challacombe and
               Laxmikant V. Kal{\'{e}}},
  title     = {Solvers for {\textdollar}{\textbackslash}mathcal\{O\} (N){\textdollar}
               Electronic Structure in the Strong Scaling Limit},
  year      = {2014},
  url       = {http://arxiv.org/abs/1403.7458},
}

@ARTICLE{Challacombe2010,
  author = {Challacombe, Matt and Bock, Nicolas},
  title = {{Fast Multiplication of Matrices with Decay}},
  journal = {arXiv:cs.DS},
  year = {2010},
  volume = {1011.3534},
  month = nov,
  abstract = {A fast algorithm for the approximate multiplication of matrices with
	decay is introduced; the Sparse Approximate Matrix Multiply (SpAMM)
	reduces complexity in the product space, a different approach from
	current methods that economize within the matrix space through truncation
	or rank reduction. Matrix truncation (element dropping) is compared
	to SpAMM for quantum chemical matrices with approximate exponential
	and algebraic decay. For matched errors in the electronic total energy,
	SpAMM is found to require fewer to far fewer floating point operations
	relative to dropping. The challenges and opportunities afforded by
	this new approach are discussed, including the potential for high
	performance implementations.},
  archiveprefix = {arXiv},
  arxivid = {1011.3534},
  keywords = {Data Structures and Algorithms,Materials Science,Mathematical Software,Numerical
	Analysis},
  timestamp = {2014.01.24}
}

@ARTICLE{Challacombe:1997:QCTC,
  author = {Matt Challacombe and Eric Schwegler},
  title = {Linear scaling computation of the {F}ock matrix},
  journal = {J.~Chem.~Phys.},
  year = {1997},
  volume = {106},
  pages = {5526}
}

@INCOLLECTION{Challacombe:Review,
  author = {Challacombe, Matt and Schwegler, Eric and Alml\"{o}f, Jan},
  title = {{M}odern {D}evelopments in {H}artree-{F}ock {T}heory: {F}ast {M}ethods
	for {C}omputing the {C}oulomb {M}atrix},
  booktitle = {{C}omputational {C}hemistry: {R}eviews of {C}urrent {T}rends},
  publisher = {World Scientific, Singapore},
  year = {1996},
  editor = {Leszczynski, J.},
  volume = {1},
  series = {{C}omputational {C}hemistry: {R}eviews of {C}urrent {T}rends},
  pages = {53--107}
}

@INBOOK{Challacombe:1996:QCTCa,
  pages = {53--107},
  title = {{Computational Chemistry: Review of Current Trends}},
  publisher = {World Scientific},
  year = {1996},
  author = {Challacombe, Matt and Schwegler, Eric and Alml\"{o}f, Jan},
  address = {Singapore},
  alteditor = {J. Leczszynski}
}

@ARTICLE{Challacombe:1996:QCTCb,
  author = {Challacombe, Matt and Schwegler, Eric and Alml\"{o}f, Jan},
  title = {Fast assembly of the {C}oulomb matrix: A quantum chemical tree code},
  journal = {J.~Chem.~Phys.},
  year = {1996},
  volume = {104},
  pages = {4685-4698},
  number = {11}
}

@ARTICLE{Challacombe:1997:PFMM,
  author = {Challacombe, Matt and White, C. and Head-Gordon, Martin},
  title = {Periodic boundary conditions and the fast multipole method},
  journal = {J.~Chem.~Phys.},
  year = {1997},
  volume = {107},
  pages = {10131}
}

@ARTICLE{10.1109/IPDPSW.2012.303,
  author = {Aparna Chandramowlishwaran and Richard W. Vuduc},
  title = {{Communication-Optimal Parallel N-body Solvers}},
  journal = {2013 IEEE International Symposium on Parallel \& Distributed Processing,
	Workshops and Phd Forum},
  year = {2012},
  volume = {0},
  pages = {2462-2465},
  address = {Los Alamitos, CA, USA},
  doi = {http://doi.ieeecomputersociety.org/10.1109/IPDPSW.2012.303},
  isbn = {978-1-4673-0974-5},
  publisher = {IEEE Computer Society}
}

@ARTICLE{Chandrasekaran2005,
  author = {Chandrasekaran, S. and Gu, M. and Lyons, W.},
  title = {{A fast adaptive solver for hierarchically semiseparable representations}},
  journal = {Calcolo},
  year = {2005},
  volume = {42},
  pages = {171--185},
  number = {3-4},
  month = dec,
  doi = {10.1007/s10092-005-0103-3},
  isbn = {1009200501033}
}

@ARTICLE{Chandrasekaran2006,
  author = {Chandrasekaran, S. and Gu, M. and Pals, T.},
  title = {{A Fast \$ULV\$ Decomposition Solver for Hierarchically Semiseparable
	Representations}},
  journal = {SIAM Journal on Matrix Analysis and Applications},
  year = {2006},
  volume = {28},
  pages = {603},
  number = {3},
  month = aug,
  abstract = {We consider an algebraic representation that is useful for matrices
	with off-diagonal blocks of low numerical rank. A fast and stable
	solver for linear systems of equations in which the coefficient matrix
	has this representation is presented. We also present a fast algorithm
	to construct the hierarchically semiseparable representation in the
	general case.},
  keywords = {65F05,fast algorithms,fast multipole method,hierarchically semiseparable,orthogonal
	factorizations},
  language = {en},
  publisher = {Society for Industrial and Applied Mathematics}
}

@INCOLLECTION{Chang2013,
  author = {Chang, Chen-Ting and Chen, Yu-Sheng and Wu, I-Wei and Shann, Jyh-Jiun},
  title = {{A Translation Framework for Automatic Translation of Annotated LLVM
	IR into OpenCL Kernel Function}},
  booktitle = {Advances in Intelligent Systems and Applications - Volume 2},
  publisher = {Springer Berlin Heidelberg},
  year = {2013},
  editor = {Pan, Jeng-Shyang and Yang, Ching-Nung and Lin, Chia-Chen},
  volume = {21},
  series = {Smart Innovation, Systems and Technologies},
  pages = {627-636},
  doi = {10.1007/978-3-642-35473-1_62},
  isbn = {978-3-642-35472-4},
  keywords = {OpenCL; LLVM; heterogeneous multi-core},
  language = {English},
  owner = {nbock},
  timestamp = {2015.03.27}
}

@INPROCEEDINGS{Gray01,
    author = {Alexander Gray and Andrew Moore},
    title = {`N-Body' Problems in Statistical Learning},
    booktitle = {Advances in Neural Information Processing Systems 13},
    year = {2000},
    pages = {521--527},
    publisher = {MIT Press}
}
@phdthesis{Gray2003,
author = {A. G. Gray},
title = {{Bringing Tractability to Generalized N-Body Problems in Statistical and Scientific Computation}},
year = {2003}
}

@article{March,
author = {March, William B and Xiao, Bo and Biros, George},
journal = {SIAM J. Sci. Comput.},
keywords = {approximations,kernel independent fast multipole,kernel methods,machine learning,methods,multiscale matrix,n-body problems,randomized matrix approximations,treecodes},
month = jan,
number = {2},
pages = {A1089--A1110},
title = {{ASKIT: Approximate Skeletonization Kernel-Independent Treecode in High Dimensions}},
volume = {37},
year = {2015}
}

@proceedings{genericityindata,
editor={Kuper, Gabriel and Libkin, Leonid and Paredaens, Jan},
booktitle={Genericity in Spatial Databases},
title={Genericity in Spatial Databases},
ublisher={Springer Berlin Heidelberg},
year={2000},
language={English}
}

@incollection{Geerts2002,
year={2002},
booktitle={Database Programming Languages},
volume={2397},
series={Lecture Notes in Computer Science},
editor={Ghelli, Giorgio and Grahne, Gösta},
title={A Theory of Spatio-temporal Database Queries},
publisher={Springer Berlin Heidelberg},
author={Geerts, Floris and Haesevoets, Sofie and Kuijpers, Bart},
pages={198-212},
language={English}
}

@article{Drineas2006,
author = {Drineas, Petros and Kannan, Ravi and Mahoney, Michael W.},
journal = {SIAM Journal on Computing},
keywords = {10,1137,68w20,ams subject classification,doi,els,massive data sets,matrix multiplication,monte carlo methods,randomized algorithms,s0097539704442684,streaming mod-},
number = {1},
pages = {132},
title = {{Fast Monte Carlo Algorithms for Matrices I: Approximating Matrix Multiplication}},
volume = {36},
year = {2006}
}

@article{Sarlos2006,
author = {Sarlos, Tamas},
journal = {In Proceedings of the 47th Annual IEEE Symposium on Foundations of Computer Science (FOCS)},
title = {{Improved Approximation Algorithms for Large Matrices via Random}},
year = {2006}
}
@article{Woodruff2015,
archivePrefix = {arXiv},
arxivId = {arXiv:1411.4357v3},
author = {Woodruff, David P},
eprint = {arXiv:1411.4357v3},
number = {1},
pages = {1--139},
title = {{Sketching as a Tool for Numerical Linear Algebra ∗}},
volume = {10},
year = {2015}
}
@article{Sivertsen2014,
author = {Sivertsen, Johan Von Tangen},
title = {{Scalable learning through linearithmic time kernel approximation techniques}},
year = {2014}
}
@article{Sarlos2006a,
author = {Sarl\'{o}s, Tam\'{a}s},
journal = {2006 47th Annual IEEE Symposium on Foundations of Computer Science (FOCS'06)},
pages = {143--152},
title = {{Improved Approximation Algorithms for Large Matrices via Random Projections}},
year = {2006}
}
@article{Mahoney2012,
archivePrefix = {arXiv},
arxivId = {arXiv:1502.03032v1},
author = {Mahoney, Michael W},
eprint = {arXiv:1502.03032v1},
file = {:home/matcha/.local/share/data/Mendeley Ltd./Mendeley Desktop/Downloaded/Mahoney - 2012 - Implementing Randomized Matrix Algorithms in Parallel and Distributed Environments.pdf:pdf},
number = {July},
pages = {1--53},
title = {{Implementing Randomized Matrix Algorithms in Parallel and Distributed Environments}},
year = {2012}
}

@TECHREPORT{chen2014,
  author = {Chen, Jie and Chow, Edmond},
  title = {{A Newton-Schulz Variant for Improving the Initial Convergence in
	Matrix Sign Computation}},
  institution = {Mathematics and Computer Science Division, Argonne National Laboratory,
	Argonne, IL 60439},
  year = {2014},
  type = {Preprint},
  number = {ANL/MCS-P5059-0114}
}

@ARTICLE{Chen07,
  author = {Chen, Shimin and Ailamaki, Anastassia and Gibbons, Phillip B. and
	Mowry, Todd C.},
  title = {Improving hash join performance through prefetching},
  journal = {ACM Trans.~Database Syst.},
  year = {2007},
  volume = {32},
  month = {August},
  acmid = {1272747},
  address = {New York, NY, USA},
  articleno = {17},
  issue = {3},
  issue_date = {August 2007},
  keywords = {CPU cache performance, CPU cache prefetching, Hash join, group prefetching,
	software-pipelined prefetching},
  publisher = {ACM}
}

@ARTICLE{Cheng1999468,
  author = {Cheng, H. and Greengard, L. and Rokhlin, V.},
  title = {{A Fast Adaptive Multipole Algorithm in Three Dimensions}},
  journal = {Journal of Computational Physics},
  year = {1999},
  volume = {155},
  pages = {468 - 498},
  number = {2},
  doi = {10.1006/jcph.1999.6355}
}

@ARTICLE{Chi2014,
  author = {Chi, Yuejie},
  title = {{Subspace Learning From Bits}},
  year = {2014},
  pages = {1--19},
  month = jul,
  abstract = {This paper proposes a simple sensing and estimation framework to faithfully
	recover the principal subspace of high-dimensional datasets or data
	streams from a collection of one-bit measurements from distributed
	sensors based on comparing accumulated energy projections of their
	data samples of dimension n over pairs of randomly selected directions.
	By leveraging low-dimensional structures, the top eigenvectors of
	a properly designed surrogate matrix is shown to recover the principal
	subspace of rank \$r\$ as soon as the number of bit measurements
	exceeds the order of \$nr\^{}2 \backslash log n\$, which can be much
	smaller than the ambient dimension of the covariance matrix. The
	sample complexity to obtain reliable comparison outcomes is also
	obtained. Furthermore, we develop a low-complexity online algorithm
	to track the principal subspace that allows new bit measurements
	arrive sequentially. Numerical examples are provided to validate
	the proposed approach.},
  archiveprefix = {arXiv},
  arxivid = {1407.6288},
  eprint = {1407.6288},
  file = {:home/m/Desktop/RESEARCH/PAPERS/1407.6288v2.pdf:pdf},
  url = {http://arxiv.org/abs/1407.6288}
}

@ARTICLE{chilimbi2000making,
  author = {Chilimbi, T.~M. and Hill, M.~D. and Larus, J.~R.},
  title = {Making pointer-based data structures cache conscious},
  journal = {Computer},
  year = {2000},
  volume = {33},
  pages = {67--74},
  number = {12},
  publisher = {IEEE}
}

@ARTICLE{CGF:CGF1554,
  author = {Choi, Myung Geol and Ju, Eunjung and Chang, Jung-Woo and Lee, Jehee
	and Kim, Young J.},
  title = {{Linkless Octree Using Multi-Level Perfect Hashing}},
  journal = {Computer Graphics Forum},
  year = {2009},
  volume = {28},
  pages = {1773--1780},
  number = {7},
  publisher = {Blackwell Publishing Ltd}
}

@ARTICLE{chow2015parallel,
  author = {Chow, Edmond and Liu, Xing and Smelyanskiy, Mikhail and Hammond,
	Jeff R},
  title = {{Parallel scalability of Hartree--Fock calculations}},
  journal = {The Journal of Chemical Physics},
  year = {2015},
  volume = {142},
  pages = {104103},
  number = {10},
  owner = {nbock},
  publisher = {AIP Publishing},
  timestamp = {2015.03.26}
}

@ARTICLE{Christ2013,
  author = {Christ, Michael and Demmel, James and Knight, Nicholas and Scanlon,
	Thomas and Yelick, Katherine},
  title = {{Communication Lower Bounds and Optimal Algorithms for Programs that
	Reference Arrays -- Part 1}},
  journal = {arXiv preprint arXiv:1308.0068},
  year = {2013}
}

@ARTICLE{Coppersmith1990251,
  author = {Don Coppersmith and Shmuel Winograd},
  title = {Matrix multiplication via arithmetic progressions},
  journal = {J.~Symb.~Comput.},
  year = {1990},
  volume = {9},
  pages = {251 - 280},
  number = {3}
}

@ARTICLE{JCC:JCC540070305,
  author = {Cremer, Dieter and Gauss, J\"{u}rgen},
  title = {{An unconventional SCF method for calculations on large molecules}},
  journal = {Journal of Computational Chemistry},
  year = {1986},
  volume = {7},
  pages = {274--282},
  number = {3},
  publisher = {John Wiley \& Sons, Inc.}
}

@ARTICLE{daniels:425,
  author = {Daniels, Andrew D. and Millam, John M. and Scuseria, Gustavo E.},
  title = {Semiempirical methods with conjugate gradient density matrix search
	to replace diagonalization for molecular systems containing thousands
	of atoms},
  journal = {The Journal of Chemical Physics},
  year = {1997},
  volume = {107},
  pages = {425-431},
  number = {2},
  doi = {10.1063/1.474404},
  keywords = {molecular electronic states; orbital calculations},
  publisher = {AIP}
}

@INPROCEEDINGS{David:2005:SFC,
  author = {Tiankai Tu David and David R. O'hallaron and Omar Ghattas},
  title = {{S}calable {P}arallel {O}ctree {M}eshing For {T}erascale {A}pplications},
  booktitle = {in SC2005},
  year = {2005}
}

@ARTICLE{Daw1993,
  author = {Daw, Murray S.},
  title = {Model for energetics of solids based on the density matrix},
  journal = {Phys. Rev. B},
  year = {1993},
  volume = {47},
  pages = {10895--10898},
  month = {Apr},
  doi = {10.1103/PhysRevB.47.10895},
  issue = {16},
  numpages = {0},
  publisher = {American Physical Society}
}

@ARTICLE{demkomosssmith,
  author = {Demko, S. and Moss, W.~F. and Smith, P.~W.},
  title = {Decay rates for inverses of band matrices},
  journal = {Math.~Comp.},
  year = {1984},
  volume = {43},
  pages = {491--499}
}

@TECHREPORT{Demmel2013,
  author = {Demmel, James and Ballard, Grey and Bulu\c{c}, Ayd\i{}n and Grigori,
	Laura and Lipshitz, Benjamin and Schwartz, Oded and Toledo, Sivan},
  title = {{Communication Optimal Parallel Multiplication of Sparse Random Matrices}},
  institution = {University of California Berkeley, Department of Electrical Engineering
	and Computer Science},
  year = {2013},
  publisher = {CALIFORNIA UNIV BERKELEY DEPT OF ELECTRICAL ENGINEERING AND COMPUTER
	SCIENCE}
}

@ARTICLE{Demmel:2007:FastMM,
  author = {Demmel, James W. and Dumitriu, Ioana and Holtz, Olga and Kleinberg,
	Robert},
  title = {Fast matrix multiplication is stable},
  journal = {Numer.~Math.},
  year = {2007},
  volume = {106},
  pages = {199--224},
  number = {2},
  address = {Secaucus, NJ, USA},
  publisher = {Springer-Verlag New York, Inc.}
}

@ARTICLE{Demmel:1992:FastMM,
  author = {Demmel, James W. and Higham, Nicholas J.},
  title = {{Stability of block algorithms with fast level-3 BLAS}},
  journal = {ACM T.~Math.~Software},
  year = {1992},
  volume = {18},
  pages = {274--291},
  number = {3},
  address = {New York, NY, USA},
  publisher = {ACM}
}

@ARTICLE{Devine:2005:SFC,
  author = {Karen D. Devine and Erik G. Boman and Robert T. Heaphy and Bruce
	A. Hendrickson and James D. Teresco and Jamal Faik and Joseph E.
	Flaherty and Luis G. Gervasio},
  title = {New challenges in dynamic load balancing},
  journal = {Applied Numerical Mathematics},
  year = {2005},
  volume = {52},
  pages = {133 - 152},
  number = {2-3},
  note = {{ADAPT} '03: Conference on Adaptive Methods for Partial Differential
	Equations and Large-Scale Computation}
}

@INPROCEEDINGS{Dick2007,
  author = {Dick, Kevin},
  title = {{A Mathematical Model of Hardware Prefetching}},
  booktitle = {39th Symposium on Theory of Computing},
  year = {2007},
  pages = {1}
}

@INPROCEEDINGS{Dongarra:1991:GBP,
  author = {Dongarra, J.~J. and Karp, A. and Miura, K. and Simon, H. D.},
  title = {{Gordon Bell prize lectures}},
  booktitle = {Supercomputing '91: Proceedings of the 1991 ACM/IEEE conference on
	Supercomputing},
  year = {1991},
  pages = {328--337},
  address = {New York, NY, USA},
  publisher = {ACM},
  location = {Albuquerque, New Mexico, United States}
}

@INPROCEEDINGS{Driscoll2013,
  author = {Driscoll, Michael and Georganas, Evangelos and Koanantakool, Penporn
	and Solomonik, Edgar and Yelick, Katherine},
  title = {{A Communication-Optimal N-Body Algorithm for Direct Interactions}},
  booktitle = {Parallel \& Distributed Processing (IPDPS), 2013 IEEE 27th International
	Symposium on},
  year = {2013},
  pages = {1075--1084},
  organization = {IEEE}
}

@INPROCEEDINGS{Eisenback:2009:GBP,
  author = {Eisenbach, M. and Zhou, C.-G. and Nicholson, D.~M. and Brown, G.
	and Larkin, J. and Schulthess, T.~C.},
  title = {A scalable method for ab initio computation of free energies in nanoscale
	systems},
  booktitle = {SC '09: Proceedings of the Conference on High Performance Computing
	Networking, Storage and Analysis},
  year = {2009},
  pages = {1--8},
  address = {New York, NY, USA},
  publisher = {ACM},
  location = {Portland, Oregon}
}

@ARTICLE{Elmroth2004,
  author = {Elmroth, Erik and Gustavson, Fred and Jonsson, Isak and K\aa gstr\"{o}m,
	B},
  title = {{Recursive blocked algorithms and hybrid data structures for dense
	matrix library software}},
  journal = {SIAM Rev.},
  year = {2004},
  volume = {46},
  pages = {3--45},
  number = {1}
}

@ARTICLE{engel2007evidence,
  author = {Engel, G.S. and Calhoun, T.R. and Read, E.L. and Ahn, T.K. and Man{\v{c}}al,
	T. and Cheng, Y.C. and Blankenship, R.E. and Fleming, G.R.},
  title = {Evidence for wavelike energy transfer through quantum coherence in
	photosynthetic systems},
  journal = {Nature},
  year = {2007},
  volume = {446},
  pages = {782--786},
  number = {7137},
  publisher = {Nature Publishing Group}
}

@ARTICLE{Ferronato2012,
  author = {Ferronato, Massimiliano},
  title = {{Preconditioning for Sparse Linear Systems at the Dawn of the 21st
	Century: History, Current Developments, and Future Perspectives}},
  journal = {ISRN Appl. Math.},
  year = {2012},
  volume = {2012},
  pages = {1--49}
}

@ARTICLE{Finkel1974,
  author = {Finkel, R.~A.~and Bentley, J.~L.},
  title = {Quad trees a data structure for retrieval on composite keys},
  journal = {Acta Inform.},
  year = {1974},
  volume = {4},
  pages = {1-9},
  issue = {1},
  keyword = {Computer Science},
  publisher = {Springer Berlin / Heidelberg}
}

@ARTICLE{Frens:1997:AMT:263767.263789,
  author = {Frens, Jeremy D. and Wise, David S.},
  title = {{Auto-blocking matrix-multiplication or tracking BLAS3 performance
	from source code}},
  journal = {SIGPLAN Not.},
  year = {1997},
  volume = {32},
  pages = {206--216},
  month = {June},
  acmid = {263789},
  address = {New York, NY, USA},
  doi = {http://doi.acm.org/10.1145/263767.263789},
  issue = {7},
  keywords = {cache misses, indexing, paging, quadtrees, storage management, swapping},
  numpages = {11},
  publisher = {ACM}
}

@INPROCEEDINGS{Frigo:1999:CA:795665.796479,
  author = {Frigo, Matteo and Leiserson, Charles E. and Prokop, Harald and Ramachandran,
	Sridhar},
  title = {{Cache-Oblivious Algorithms}},
  booktitle = {Proceedings of the 40th Annual Symposium on Foundations of Computer
	Science},
  year = {1999},
  series = {FOCS '99},
  pages = {285},
  address = {Washington, DC, USA},
  publisher = {IEEE Computer Society},
  acmid = {796479}
}

@INPROCEEDINGS{Gabriel:2004:OCR:1054943.1054962,
  author = {Gabriel, Steven T. and Wise, David S.},
  title = {{The Opie compiler from row-major source to Morton-ordered matrices}},
  booktitle = {Proceedings of the 3rd workshop on Memory performance issues: in
	conjunction with the 31st international symposium on computer architecture},
  year = {2004},
  series = {WMPI '04},
  pages = {136--144},
  address = {New York, NY, USA},
  publisher = {ACM},
  acmid = {1054962},
  keywords = {cache, paging, quadtrees, scientific computing},
  location = {Munich, Germany},
  numpages = {9}
}

@ARTICLE{Galli:1996:ONREV,
  author = {G. Galli},
  title = {Linear Scaling Methods for {E}lectronic {S}tructure {C}alculations
	and {Q}uantum {M}olecular-{D}ynamics {S}imulations},
  journal = {Current Opinion in Solid State \& Materials Science},
  year = {1996},
  volume = {1},
  pages = {864-874},
  number = {6},
  month = DEC
}

@ARTICLE{10.1063/1.1568734,
  author = {Chee Kwan Gan and Matt Challacombe},
  title = {{Linear scaling computation of the Fock matrix. VI. Data parallel
	computation of the exchange-correlation matrix}},
  journal = {J.~Comp.~Phys.},
  year = {2003},
  volume = {118},
  pages = {9128-9135},
  number = {20},
  coden = {JCPSA6},
  eissn = {10897690},
  keywords = {organic compounds; water; molecular clusters; matrix algebra; SCF
	calculations; iterative methods; GO calculations; },
  publisher = {AIP}
}

@ARTICLE{Gargantini1982,
  author = {Gargantini, Irene},
  title = {An effective way to represent quadtrees},
  journal = {Commun.~ACM},
  year = {1982},
  volume = {25},
  pages = {905--910},
  month = {December},
  acmid = {358741},
  address = {New York, NY, USA},
  doi = {http://doi.acm.org/10.1145/358728.358741},
  issue = {12},
  keywords = {digital images, image encoding},
  numpages = {6},
  publisher = {ACM}
}

@ARTICLE{gaydadjiev2006sad,
  author = {Gaydadjiev, G. and Vassiliadis, S.},
  title = {{SAD Prefetching for MPEG4 Using Flux Caches}},
  journal = {Embedded Computer Systems: Architectures, Modeling, and Simulation},
  year = {2006},
  pages = {248--258},
  publisher = {Springer}
}

@MISC{gcc,
  author = {gcc},
  title = {{The GNU Compiler Collection}},
  note = {\url{http://gcc.gnu.org/}}
}

@MISC{gentoo,
  author = {Gentoo},
  title = {{A special flavor of Linux that can be automatically optimized and
	customized for just about any application or need}},
  note = {\url{http://www.gentoo.org}}
}

@ARTICLE{quantumEspresso,
  author = {Paolo Giannozzi and Stefano Baroni and Nicola Bonini and Matteo Calandra
	and Roberto Car and Carlo Cavazzoni and Davide Ceresoli and Guido
	L Chiarotti and Matteo Cococcioni and Ismaila Dabo and Andrea Dal
	Corso and Stefano de Gironcoli and Stefano Fabris and Guido Fratesi
	and Ralph Gebauer and Uwe Gerstmann and Christos Gougoussis and Anton
	Kokalj and Michele Lazzeri and Layla Martin-Samos and Nicola Marzari
	and Francesco Mauri and Riccardo Mazzarello and Stefano Paolini and
	Alfredo Pasquarello and Lorenzo Paulatto and Carlo Sbraccia and Sandro
	Scandolo and Gabriele Sclauzero and Ari P Seitsonen and Alexander
	Smogunov and Paolo Umari and Renata M Wentzcovitch},
  title = {{QUANTUM ESPRESSO: a modular and open-source software project for
	quantum simulations of materials}},
  journal = {Journal of Physics: Condensed Matter},
  year = {2009},
  volume = {21},
  pages = {395502},
  number = {39},
  abstract = {QUANTUM ESPRESSO is an integrated suite of computer codes for electronic-structure
	calculations and materials modeling, based on density-functional
	theory, plane waves, and pseudopotentials (norm-conserving, ultrasoft,
	and projector-augmented wave). The acronym ESPRESSO stands for opEn
	Source Package for Research in Electronic Structure, Simulation,
	and Optimization . It is freely available to researchers around the
	world under the terms of the GNU General Public License. QUANTUM
	ESPRESSO builds upon newly-restructured electronic-structure codes
	that have been developed and tested by some of the original authors
	of novel electronic-structure algorithms and applied in the last
	twenty years by some of the leading materials modeling groups worldwide.
	Innovation and efficiency are still its main focus, with special
	attention paid to massively parallel architectures, and a great effort
	being devoted to user friendliness. QUANTUM ESPRESSO is evolving
	towards a distribution of independent and interoperable codes in
	the spirit of an open-source project, where researchers active in
	the field of electronic-structure calculations are encouraged to
	participate in the project by contributing their own codes or by
	implementing their own ideas into existing codes.}
}

@TECHREPORT{cosmo2007,
  author = {Filippo Gioachin and Pritish Jetley and Celso L. Mendes and Laxmikant
	V. Kal\'{e} and Thomas R. Quinn},
  title = {{Toward Petascale Cosmological Simulations with ChaNGa}},
  institution = {Parallel Programming Laboratory, Department of Computer Science,
	University of Illinois at Urbana-Champaign},
  year = {2007},
  number = {07-08}
}

@MISC{GlosliGordonBell2007,
  author = {Glosli, J.~N. and Richards, D.~F. and Caspersen, K.~J. and Rudd,
	R.~E. and Gunnels, J.~A. and Streitz, F.~H.},
  title = {{Extending Stability Beyond CPU Millennium: A Micron-scale Atomistic
	Simulation of Kelvin-Helmholtz Instability}},
  year = {2007},
  note = {{ACM Gordon Bell Prize}}
}

@ARTICLE{Goedecker:1999:ONREV,
  author = {Goedecker, Stefan},
  title = {{Linear Scaling Electronic Structure Methods}},
  journal = {Rev.~Mod.~Phys.},
  year = {1999},
  volume = {71},
  pages = {1085--1123}
}

@ARTICLE{goedecker1998decay,
  author = {Goedecker, S},
  title = {The decay properties of the finite temperature density matrix in
	metals},
  journal = {arXiv preprint cond-mat/9804013},
  year = {1998}
}

@ARTICLE{Goedecker98,
  author = {Goedecker, Stefan},
  title = {{Electronic Structure Methods Exhibiting Linear Scaling of the Computational
	Effort with Respect to the Size of the System}},
  journal = {arXiv:cond-mat},
  year = {1998},
  volume = {9806073}
}

@ARTICLE{PhysRevB.58.3501,
  author = {Goedecker, Stefan},
  title = {Decay properties of the finite-temperature density matrix in metals},
  journal = {Phys.~Rev.~B},
  year = {1998},
  volume = {58},
  pages = {3501--3502},
  month = {Aug},
  issue = {7},
  publisher = {American Physical Society}
}

@ARTICLE{Goedecker:2003:ONREV,
  author = {Goedecker, Stefan and Scuseria, G.E.},
  title = {Linear scaling electronic structure methods in chemistry and physics},
  journal = {Computing in Science Engineering},
  year = {2003},
  volume = {5},
  pages = {14 -- 21}
}

@ARTICLE{Goringe1997,
  author = {Goringe, C.~M. and Hern{\'a}ndez, E. and Gillan, M.~J. and Bush,
	I.~J.},
  title = {{Linear-scaling DFT-pseudopotential calculations on parallel computers}},
  journal = {Computer physics communications},
  year = {1997},
  volume = {102},
  pages = {1--16},
  number = {1},
  __markedentry = {[nbock:6]},
  owner = {nbock},
  publisher = {Elsevier},
  timestamp = {2014.06.18}
}

@MISC{GotoBLAS2:2010,
  author = {Goto, Kazushige},
  title = {{GotoBLAS2}},
  year = {2010},
  note = {\url{http://www.tacc.utexas.edu/tacc-projects/gotoblas2/}},
  url = {http://www.tacc.utexas.edu/tacc-projects/gotoblas2/}
}

@ARTICLE{Goto:2008:AHM:1356052.1356053,
  author = {Goto, Kazushige and {van de Geijn}, Robert A.},
  title = {Anatomy of high-performance matrix multiplication},
  journal = {ACM Trans.~Math.~Softw.},
  year = {2008},
  volume = {34},
  pages = {12:1--12:25},
  month = {May},
  acmid = {1356053},
  address = {New York, NY, USA},
  articleno = {12},
  issue = {3},
  issue_date = {May 2008},
  keywords = {Linear algebra, basic linear algebra subprogrms, matrix multiplication},
  numpages = {25},
  publisher = {ACM}
}

@ARTICLE{Goto:2008:HIL:1377603.1377607,
  author = {Goto, Kazushige and {van de Geijn}, Robert A.},
  title = {{High-performance implementation of the level-3 BLAS}},
  journal = {ACM Trans.~Math.~Softw.},
  year = {2008},
  volume = {35},
  pages = {4:1--4:14},
  month = {July},
  acmid = {1377607},
  address = {New York, NY, USA},
  articleno = {4},
  doi = {http://doi.acm.org/10.1145/1377603.1377607},
  issue = {1},
  issue_date = {July 2008},
  keywords = {Linear algebra, basic linear algebra subprograms, libraries, matrix-matrix
	operations},
  numpages = {14},
  publisher = {ACM}
}

@TECHREPORT{Goto2002,
  author = {Goto, Kazushige and {van de Geijn}, Robert A.},
  title = {{O}n reducing {TLB} misses in matrix multiplication},
  institution = {Department of Computer Sciences, The University of Texas at Austin},
  year = {2002},
  number = {CS-TR-02-55}
}

@ARTICLE{Gottschling2009,
  author = {Gottschling, Peter and Wise, DS and Joshi, A},
  title = {{Generic support of algorithmic and structural recursion for scientific computing}},
  journal = {Int. J. Parallel, \ldots},
  year = {2009}
}

@ARTICLE{Gottschling2007,
  author = {Gottschling, Peter and Wise, David S. and Adams, Michael D.},
  title = {{Representation-transparent matrix algorithms with scalable performance}},
  journal = {Proc. 21st Annu. Int. Conf. Supercomput. - ICS '07},
  year = {2007},
  pages = {116},
  address = {New York, New York, USA},
  publisher = {ACM Press}
}

@INPROCEEDINGS{Gottschling:2007:RMA:1274971.1274989,
  author = {Gottschling, Peter and Wise, David S. and Adams, Michael D.},
  title = {Representation-transparent matrix algorithms with scalable performance},
  booktitle = {Proceedings of the 21st annual international conference on Supercomputing},
  year = {2007},
  series = {ICS '07},
  pages = {116--125},
  address = {New York, NY, USA},
  publisher = {ACM},
  acmid = {1274989},
  keywords = {Morton-order, dilated integers, doppled integers, matrix template
	library},
  location = {Seattle, Washington},
  numpages = {10}
}

@ARTICLE{Grasedyck2003,
  author = {Grasedyck, Lars and Hackbusch, Wolfgang},
  title = {{Construction and Arithmetics of $\mathcal{H}$-Matrices}},
  journal = {Computing},
  year = {2003},
  volume = {70},
  pages = {295--334},
  number = {4},
  month = aug,
  doi = {10.1007/s00607-003-0019-1},
  isbn = {0060700300},
  keywords = {data-sparse approximations,fast,formatted matrix operations,hierarchical
	matrices}
}

@ARTICLE{Gray:2003:NBody,
  author = {Gray, Alexander G.},
  title = {{Bringing Tractability to Generalized N-Body Problems in Statistical
	and Scientific Computation}},
  year = {2003}
}

@INPROCEEDINGS{Gray:2001:NBody,
  author = {Gray, Alexander G. and Moore, Andrew W.},
  title = {{N-Body Problems in Statistical Learning}},
  booktitle = {Advances in Neural Information Processing Systems},
  year = {2001},
  volume = {4},
  pages = {521--527},
  publisher = {MIT Press}
}

@INCOLLECTION{springerlink:10.1007/BFb0089775,
  author = {Greengard, Leslie and Rokhlin, Vladimir},
  title = {The rapid evaluation of potential fields in three dimensions},
  booktitle = {Vortex Methods},
  publisher = {Springer Berlin / Heidelberg},
  year = {1988},
  editor = {Anderson, Christopher and Greengard, Claude},
  volume = {1360},
  series = {Lecture Notes in Mathematics},
  pages = {121-141},
  note = {10.1007/BFb0089775},
  affiliation = {Yale University Department of Computer Science New Haven CT},
  isbn = {978-3-540-50526-6},
  keyword = {Mathematics and Statistics}
}

@ARTICLE{Greengard1997,
  author = {Greengard, Leslie and Rokhlin, Vladimir},
  title = {A new version of the {F}ast {M}ultipole {M}ethod for the {L}aplace
	equation in three dimensions},
  journal = {Acta Numerica},
  year = {1997},
  pages = {229-269}
}

@ARTICLE{Greengard1987325,
  author = { Greengard, Leslie and Rokhlin, Vladimir},
  title = {A fast algorithm for particle simulations},
  journal = {Journal of Computational Physics},
  year = {1987},
  volume = {73},
  pages = {325 - 348},
  number = {2},
  doi = {10.1016/0021-9991(87)90140-9}
}

@ARTICLE{greengard:79,
  author = {Leslie Greengard and John Strain},
  title = {{The Fast Gauss Transform}},
  journal = {SIAM Journal on Scientific and Statistical Computing},
  year = {1991},
  volume = {12},
  pages = {79-94},
  number = {1},
  doi = {10.1137/0912004},
  keywords = {Gauss transform; Hermite polynomials; fast algorithms},
  publisher = {SIAM}
}

@ARTICLE{gamess,
  author = {Guest, Martyn F. and Bush, Ian J. and Van Dam, Huub J. J. and Sherwood,
	Paul and Thomas, Jens M. H. and Van Lenthe, Joop H. and Havenith,
	Remco W. A. and Kendrick, John},
  title = {{The GAMESS-UK electronic structure package: algorithms, developments
	and applications}},
  journal = {Molecular Physics},
  year = {2005},
  volume = {103},
  pages = {719-747},
  number = {6-8},
  doi = {10.1080/00268970512331340592}
}

@ARTICLE{gunnels2007cache,
  author = {Gunnels, J. and Gustavson, F.~G. and Pingali, K. and Yotov, K.},
  title = {{Is cache-oblivious DGEMM viable?}},
  journal = {Applied Parallel Computing. State of the Art in Scientific Computing},
  year = {2007},
  pages = {919--928},
  publisher = {Springer}
}

@ARTICLE{Gustavson78,
  author = {Fred G Gustavson},
  title = {Two Fast Algorithms for Sparse Matrices: Multiplication and Permuted
	Transposition},
  journal = {ACM Transactions on Mathematical Software (TOMS)},
  year = {1978},
  volume = {4},
  pages = {250-269},
  number = {3},
  month = {Sept}
}

@ARTICLE{Gustavson:1978:TFA:355791.355796,
  author = {Gustavson, Fred G.},
  title = {{Two Fast Algorithms for Sparse Matrices: Multiplication and Permuted
	Transposition}},
  journal = {ACM Trans.~Math.~Softw.},
  year = {1978},
  volume = {4},
  pages = {250--269},
  month = {September},
  acmid = {355796},
  address = {New York, NY, USA},
  issue = {3},
  issue_date = {Sept.~1978},
  numpages = {20},
  publisher = {ACM}
}

@ARTICLE{gustavson2011parallel,
  author = {Gustavson, F.~G. and Karlsson, L. and K{\aa}gstr{\"o}m, B.},
  title = {Parallel and cache-efficient in-place matrix storage format conversion},
  journal = {ACM Transactions on Mathematical Software},
  year = {2011},
  volume = {37}
}

@ARTICLE{JCC:JCC540100111,
  author = {H\"{a}ser, Marco and Ahlrichs, Reinhart},
  title = {{Improvements on the direct SCF method}},
  journal = {Journal of Computational Chemistry},
  year = {1989},
  volume = {10},
  pages = {104--111},
  number = {1},
  publisher = {John Wiley \& Sons, Inc.}
}

@ARTICLE{Hackbusch2002,
  author = {Hackbusch, Wolfgang and B\"{o}rm, S},
  title = {{Data-sparse approximation by adaptive $\mathcal{H}^{2}$-matrices}},
  journal = {Computing},
  year = {2002},
  volume = {69},
  pages = {1--35},
  number = {1},
  doi = {10.1007/s00607-002-1450-4},
  keywords = {bem,fast matrix-vector multiplication,full matrices,hierarchical matrices,nested
	bases}
}

@ARTICLE{Hafner2008,
  author = {Hafner, J\"{u}rgen},
  title = {{Ab-initio simulations of materials using VASP: Density-functional
	theory and beyond}},
  journal = {Journal of Computational Chemistry},
  year = {2008},
  volume = {29},
  pages = {2044--2078},
  number = {13},
  doi = {10.1002/jcc.21057},
  keywords = {density-functional theory, plane-wave basis, pseudopotentials, projector-augmented-waves,
	hybrid functionals, many-body perturbation theory, solid state physics,
	solid state chemistry, materials science, surface science, catalysis},
  publisher = {Wiley Subscription Services, Inc., A Wiley Company}
}

@MISC{HamadaGordonBell2009,
  author = {Hamada, T. and Narumi, T. and Yokota, R. and Yasuoka, K. and Nitadori,
	K. and Taiji, M.},
  title = {{42 TFlops Hierarchical N-body Simulations on GPUs with Applications
	in Both Astrophysics and Turbulence}},
  year = {2009},
  note = {{ACM Gordon Bell Prize}}
}

@ARTICLE{Hanlon:2001:CCM:565761.565766,
  author = {Hanlon, Philip J. and Chung, Dean and Chatterjee, Siddhartha and
	Genius, Daniela and Lebeck, Alvin R. and Parker, Erin},
  title = {The combinatorics of cache misses during matrix multiplication},
  journal = {J.~Comput.~Syst.~Sci.},
  year = {2001},
  volume = {63},
  pages = {80--126},
  month = {August},
  acmid = {565766},
  address = {Orlando, FL, USA},
  doi = {10.1006/jcss.2001.1756},
  issue = {1},
  numpages = {47},
  publisher = {Academic Press, Inc.}
}

@ARTICLE{Hanrath:2010:TCE,
  author = {Hanrath, Michael and Engels-Putzka, Anna},
  title = {{An efficient matrix-matrix multiplication based antisymmetric tensor
	contraction engine for general order coupled cluster.}},
  journal = {The Journal of chemical physics},
  year = {2010},
  volume = {133},
  pages = {064108},
  number = {6},
  abstract = {In this paper, we present an efficient implementation of general tensor
	contractions, which is part of a new coupled-cluster program. The
	tensor contractions, used to evaluate the residuals in each coupled-cluster
	iteration are particularly important for the performance of the program.
	We developed a generic procedure, which carries out contractions
	of two tensors irrespective of their explicit structure. It can handle
	coupled-cluster-type expressions of arbitrary excitation level. To
	make the contraction efficient without loosing flexibility, we use
	a three-step procedure. First, the data contained in the tensors
	are rearranged into matrices, then a matrix-matrix multiplication
	is performed, and finally the result is backtransformed to a tensor.
	The current implementation is significantly more efficient than previous
	ones capable of treating arbitrary high excitations.},
  institution = {Institute for Theoretical Chemistry, University of Cologne, Greinstrasse
	4, 50939 Cologne, Germany. michael.hanrath@uni-koeln.de}
}

@ARTICLE{Hardin2013,
  author = {Hardin, Johanna and Garcia, Stephan Ramon and Golan, David},
  title = {{A method for generating realistic correlation matrices}},
  journal = {Ann. Appl. Stat.},
  year = {2013},
  volume = {7},
  pages = {1733--1762},
  number = {3},
  month = sep,
  keywords = {Correlation matrix, simulating matrices, Toeplitz }
}

@ARTICLE{hargrove2001,
  author = {William W. Hargrove and Forrest M. Hoffman and Thomas Sterling},
  title = {{The Do-It-Yourself Supercomputer}},
  journal = {Scientific American},
  year = {2001},
  volume = {265},
  pages = {72-79},
  issue = {2}
}

@ARTICLE{Hastings2014,
  author = {Hastings, M. B.},
  title = {{Notes on Some Questions in Mathematical Physics and Quantum Information}},
  year = {2014},
  pages = {35},
  number = {2},
  month = apr,
  archiveprefix = {arXiv},
  arxivid = {1404.4327},
  eprint = {1404.4327}
}

@ARTICLE{Hastings2014a,
  author = {Hastings, M. B.},
  title = {{Notes on Some Questions in Mathematical Physics and Quantum Information}},
  year = {2014},
  pages = {35},
  number = {2},
  month = apr,
  abstract = {This is a set of notes on some unrelated topics in mathematical physics,
	at varying levels of detail. First, I consider certain questions
	relating to the decay of correlation functions in matrix product
	states, in particular those generated by quantum expanders. This
	is discussed in relation to recent results of Brandao and Horodecki
	on area laws on systems with exponentially decaying correlation function$\backslash$cite\{areaexp\}.
	Second, I consider some difficulties in trying to construct a tensor
	product state (or PEPS) describing a two-dimensional fermionic system
	with non-vanishing Hall conductance. Third, I present some relations
	between the theory of almost commuting matrices and that of vector
	bundles, making the connection between the classifications more explicit.
	Fourth, I present an open question about quantum channels, and some
	partial results.},
  archiveprefix = {arXiv},
  arxivid = {1404.4327},
  eprint = {1404.4327}
}

@MISC{ONETEP:2010,
  author = {Haynes, Peter and Skylaris, Chris Kriton and Mostofi, Arash and Payne,
	Mike},
  title = {{O}{N}{E}{T}{E}{P}: {L}inear-scaling density-functional theory with
	plane waves},
  year = {2010},
  note = {\url{http://www2.tcm.phy.cam.ac.uk/onetep/}}
}

@ARTICLE{Heil1970,
  author = {Heil, Timothy G and O'Neil, Stephen V and Schaefer, Henry F},
  title = {High precision valence bond potential curve for the Cl${}_{2}$ molecule},
  journal = {Chemical Physics Letters},
  year = {1970},
  volume = {5},
  pages = {253--256},
  number = {5},
  publisher = {Elsevier}
}

@ARTICLE{hernquist1988hierarchical,
  author = {Hernquist, L.},
  title = {{Hierarchical N-body methods}},
  journal = {Computer Physics Communications},
  year = {1988},
  volume = {48},
  pages = {107--115},
  number = {1},
  publisher = {Elsevier}
}

@ARTICLE{Higham1986,
  author = {Higham, NJ},
  title = {{Newton's method for the matrix square root}},
  journal = {Math. Comput.},
  year = {1986},
  volume = {46},
  pages = {537},
  number = {174},
  month = apr
}

@BOOK{Higham08,
  title = {Functions of Matrices},
  publisher = {Society for Industrial \& Applied Mathematics,},
  year = {2008},
  author = {Higham, Nicholas J.},
  booktitle = {Am. J. Math.}
}

@ARTICLE{Higham2005,
  author = {Nicholas J . Higham and D . Steven Mackey, Niloufer Mackey and Fran
	¸ coise Tisseur},
  title = {{Functions Preserving Matrix Groups and Iterations for the Matrix
	Square Root}},
  journal = {SIAM J. Matrix Anal. Appl.},
  year = {2005},
  volume = {26},
  pages = {849--877},
  number = {3},
  month = jan
}

@ARTICLE{HilberCurve,
  author = {Hilbert, David},
  title = {\"{U}ber die stetige {A}bbildung einer {L}inie auf ein {F}l\"{a}chenst\"{u}ck},
  journal = {Math.~Ann.},
  year = {1891},
  pages = {459},
  volulme = {38}
}

@ARTICLE{Hirata:2003:TCE,
  author = {Hirata, So},
  title = {{Tensor Contraction Engine: Abstraction and Automated Parallel Implementation
	of Configuration-Interaction, Coupled-Cluster, and Many-Body Perturbation
	Theories}},
  journal = {The Journal of Physical Chemistry A},
  year = {2003},
  volume = {107},
  pages = {9887--9897},
  number = {46},
  abstract = {We have developed a symbolic manipulation program and program generator
	(tensor contraction engine or TCE) that abstracts and automates the
	time-consuming, error-prone processes of deriving the working equations
	of a well-defined model of second-quantized many-electron theories
	and synthesizing efficient parallel computer programs on the basis
	of these equations. Provided an ansatz of a many-electron theory
	model, TCE performs valid contractions of creation and annihilation
	operators according to Wick's theorem, consolidates identical terms,
	and reduces the expressions into the form of multiple tensor contractions
	acted upon by permutation operators. It subsequently determines the
	binary contraction order for each multiple tensor contraction with
	the minimal operation and memory cost, factorizes common binary contractions
	(defines intermediate tensors), and identifies reusable intermediates.
	The resulting ordered list of binary tensor contractions, additions,
	and index permutations is translated into an optimized program that
	is combined with the NWCHEM and UTCHEM computational chemistry software
	packages. The programs synthesized by TCE take advantage of spin
	symmetry (within the spinorbital formalisms), real Abelian point-group
	symmetry, and index permutation symmetry at every stage of the calculations
	to minimize the number of arithmetic operations and storage requirement,
	adjust the peak local memory usage by index-range tiling, and support
	parallel I/O interfaces and dynamic load balancing for parallel executions.
	We demonstrate the utility of TCE through automatic derivation and
	implementation of parallel programs for a range of predictive computational
	methodsconfiguration-interaction theory (CISD, CISDT, CISDTQ), generalized
	many-body perturbation theory MBPT(2), MBPT(3), MBPT(4), and coupled-cluster
	theory (LCCD, CCD, LCCSD, CCSD, QCISD, CCSDT, and CCSDTQ), some for
	the first timeand discuss the performance of the implemented programs.},
  publisher = {American Chemical Society}
}

@INPROCEEDINGS{Hoel94,
  author = {Hoel, E.~G. and Samet, H.},
  title = {{Data-Parallel Spatial Join Algorithms}},
  booktitle = {Parallel Processing, 1994. ICPP 1994. International Conference on},
  year = {1994},
  volume = {3},
  pages = {227 -234},
  month = {aug.},
  doi = {10.1109/ICPP.1994.82}
}

@ARTICLE{PhysRev.136.B864,
  author = {Hohenberg, P. and Kohn, W.},
  title = {{Inhomogeneous Electron Gas}},
  journal = {Phys. Rev.},
  year = {1964},
  volume = {136},
  pages = {B864--B871},
  month = {Nov},
  doi = {10.1103/PhysRev.136.B864},
  issue = {3B},
  numpages = {0},
  publisher = {American Physical Society}
}

@ARTICLE{Hu,
  author = {Hu, Y.~Charlie and Cox, Alan and Zwaenepoel, Willy},
  title = {Improving fine-grained irregular shared-memory benchmarks by data
	reordering},
  timestamp = {2010.07.03}
}

@INPROCEEDINGS{huang2009performance,
  author = {Huang, Y. and Gu, Z.},
  title = {{Performance Comparison of Data Prefetching for Pointer-Chasing Applications}},
  booktitle = {Information Science and Engineering (ICISE), 2009 1st International
	Conference on},
  year = {2009},
  pages = {307--310},
  organization = {IEEE}
}

@BOOK{Intel2009,
  title = {{Intel 64 and IA-32 Architectures Optimization Reference Manual}},
  publisher = {Intel},
  year = {2009},
  author = {Intel},
  month = {November},
  note = {{O}rder {N}umber: 248966-020},
  url = {http://www.intel.com}
}

@ARTICLE{Iserles:2000:Decay,
  author = {Iserles, Arieh},
  title = {{How Large is the Exponential of a Banded Matrix?}},
  journal = {J.~New Zealand Math.~Soc.},
  year = {2000},
  volume = {29},
  pages = {177}
}

@MISC{IshiyamaGordonBell2012,
  author = {Ishiyama, T. and Nitadori, K. and Makino, J.},
  title = {{4.45 Pflops Astrophysical N-Body Simulation on K computer -- The
	Gravitational Trillion-Body Problem}},
  year = {2012},
  note = {{ACM Gordon Bell Prize}}
}

@ARTICLE{Ismail-Beigi1999,
  author = {Ismail-Beigi, Sohrab and Arias, T.~A.},
  title = {{Locality of the Density Matrix in Metals, Semiconductors, and Insulators}},
  journal = {Phys. Rev. Lett.},
  year = {1999},
  volume = {82},
  pages = {2127--2130},
  month = {Mar},
  doi = {10.1103/PhysRevLett.82.2127},
  issue = {10},
  numpages = {0},
  owner = {nbock},
  publisher = {American Physical Society},
  timestamp = {2014.04.21}
}

@ARTICLE{Jacox03,
  author = {Jacox, Edwin H. and Samet, Hanan},
  title = {Iterative spatial join},
  journal = {ACM Trans.~Database Syst.},
  year = {2003},
  volume = {28},
  pages = {230--256},
  month = {September},
  acmid = {937600},
  address = {New York, NY, USA},
  doi = {http://doi.acm.org/10.1145/937598.937600},
  issue = {3},
  keywords = {Spatial join, external memory algorithms, plane-sweep, spatial databases},
  numpages = {27},
  publisher = {ACM}
}

@ARTICLE{Jansik2007,
  author = {Jans\'{\i}k, Branislav and Host, Stinne and Jorgensen, Poul and Olsen,
	Jeppe and Helgaker, Trygve},
  title = {{Linear-scaling symmetric square-root decomposition of the overlap
	matrix.}},
  journal = {J. Chem. Phys.},
  year = {2007},
  volume = {126},
  pages = {124104},
  number = {12},
  month = mar
}

@MISC{Jenkins2006,
  author = {Bob Jenkins},
  title = {32-bit hashes for hash table lookup},
  month = {May},
  year = {2006},
  note = {\url{http://burtleburtle.net/bob/c/lookup3.c}},
  url = {http://burtleburtle.net/bob/c/lookup3.c}
}

@INPROCEEDINGS{2007_ChaNGaScaling,
  author = {Pritish Jetley and Filippo Gioachin and Celso Mendes and Laxmikant
	V. Kal\'{e} and Thomas R. Quinn},
  title = {{Massively parallel cosmological simulations with ChaNGa}},
  booktitle = {Proceedings of IEEE International Parallel and Distributed Processing
	Symposium 2008},
  year = {2008}
}

@INPROCEEDINGS{jetley2008massively,
  author = {Jetley, Pritish and Gioachin, Filippo and Mendes, Celso and Kale,
	Laxmikant V and Quinn, Thomas},
  title = {Massively parallel cosmological simulations with ChaNGa},
  booktitle = {Parallel and Distributed Processing, 2008. IPDPS 2008. IEEE International
	Symposium on},
  year = {2008},
  pages = {1--12},
  organization = {IEEE}
}

@INPROCEEDINGS{Jin2005,
  author = {Jin, Guohua and Mellor-Crummey, John},
  title = {Using space-filling curves for computation reordering},
  booktitle = {Proceedings of the Los Alamos Computer Science Institute},
  year = {2005},
  citeulike-article-id = {4979217},
  keywords = {file-import-09-06-26},
  posted-at = {2009-06-26 16:52:22},
  priority = {2}
}

@ARTICLE{Kahan2013,
  author = {Kahan},
  title = {{A Tutorial Overview of Vector and Matrix Norms}},
  year = {2013},
  pages = {1--79}
}

@INPROCEEDINGS{Kale2002,
  author = {Kal\'{e}, Laxmikan V. and Kumar, Sameer and DeSouza, J.},
  title = {{A Malleable-Job System for Timeshared Parallel Machines}},
  booktitle = {Cluster Computing and the Grid, 2002. 2nd IEEE/ACM International
	Symposium on},
  year = {2002},
  pages = {230-230},
  month = {May},
  doi = {10.1109/CCGRID.2002.1017131},
  keywords = {Adaptive scheduling;Computer science;Delay;Monitoring;Parallel machines;Processor
	scheduling;Runtime;Throughput;Time factors;Workstations}
}

@INCOLLECTION{NAMDEncyEntry10,
  author = {Laxmikant V. Kale and Abhinav Bhatele and Eric J. Bohm and James
	C. Phillips},
  title = {{NAnoscale Molecular Dynamics (NAMD)}},
  booktitle = {Encyclopedia of Parallel Computing (to appear)},
  publisher = {Springer Verlag},
  year = {2011},
  editor = {D. Padua}
}

@INCOLLECTION{CharmppPPWCPP96,
  author = {L.~V. Kale and Sanjeev Krishnan},
  title = {{Charm++: Parallel Programming with Message-Driven Objects}},
  booktitle = {Parallel Programming using C++},
  publisher = {MIT Press},
  year = {1996},
  editor = {Gregory V. Wilson and Paul Lu},
  pages = {175-213}
}

@INPROCEEDINGS{karlsson2000prefetching,
  author = {Karlsson, M. and Dahlgren, F. and Stenstr\"{o}m, P.},
  title = {A prefetching technique for irregular accesses to linked data structures},
  booktitle = {High-Performance Computer Architecture, 2000. HPCA-6. Proceedings.
	Sixth International Symposium on},
  year = {2000},
  pages = {206--217},
  organization = {IEEE}
}

@ARTICLE{Karp:1997:GBP,
  author = {Karp, Alan H. and Lusk, Ewing and Bailey, David H.},
  title = {{1997 Gordon Bell Prize Winners}},
  journal = {Computer},
  year = {1998},
  volume = {31},
  pages = {86--92},
  number = {1},
  address = {Los Alamitos, CA, USA},
  publisher = {IEEE Computer Society Press}
}

@ARTICLE{kawai1999grape,
  author = {Kawai, Atsushi and Fukushige, Toshiyuki and Makino, Junichiro and
	Taiji, Makoto},
  title = {{GRAPE-5: A special-purpose computer for N-body simulation}},
  journal = {arXiv preprint astro-ph/9909116},
  year = {1999}
}

@MISC{KawaiGordonBell1999,
  author = {Kawai, A. and Fushushige, T. and Makino, J.},
  title = {{Astrophysical N-Body Simulation}},
  year = {1999},
  note = {{ACM Gordon Bell Prize}}
}

@ARTICLE{Kenney1995,
  author = {Kenney, C.S. and Laub, A.J.},
  title = {{The matrix sign function}},
  journal = {IEEE Trans. Automat. Contr.},
  year = {1995},
  volume = {40},
  pages = {1330--1348},
  number = {8}
}

@ARTICLE{Kenney1998,
  author = {Kenney, C. S. and Laub, a. J.},
  title = {{A Schur--Fr\'{e}chet Algorithm for Computing the Logarithm and Exponential
	of a Matrix}},
  journal = {SIAM J. Matrix Anal. Appl.},
  year = {1998},
  volume = {19},
  pages = {640--663},
  number = {3},
  month = jul
}

@ARTICLE{khaliullin2013efficient,
  author = {Khaliullin, Rustam Z and VandeVondele, Joost and Hutter, Jürg},
  title = {Efficient linear-scaling density functional theory for molecular
	systems},
  journal = {Journal of Chemical Theory and Computation},
  year = {2013},
  volume = {9},
  pages = {4421--4427},
  number = {10},
  doi = {10.1021/ct400595k},
  owner = {nbock},
  publisher = {ACS Publications},
  timestamp = {2014.03.20}
}

@ARTICLE{Kim09,
  author = {Kim, Changkyu and Kaldewey, Tim and Lee, Victor W. and Sedlar, Eric
	and Nguyen, Anthony D. and Satish, Nadathur and Chhugani, Jatin and
	Di Blas, Andrea and Dubey, Pradeep},
  title = {{Sort vs.~Hash revisited: fast join implementation on modern multi-core
	CPUs}},
  journal = {Proc.~VLDB Endow.},
  year = {2009},
  volume = {2},
  pages = {1378--1389},
  month = {August},
  acmid = {1687564},
  issue = {2},
  issue_date = {August 2009},
  numpages = {12},
  publisher = {VLDB Endowment}
}

@INPROCEEDINGS{Koanantakool:2014:CCP:2683593.2683634,
  author = {Koanantakool, Penpom and Yelick, Katherine},
  title = {{A Computation- and Communication-optimal Parallel Direct 3-body
	Algorithm}},
  booktitle = {Proceedings of the International Conference for High Performance
	Computing, Networking, Storage and Analysis},
  year = {2014},
  series = {SC '14},
  pages = {363--374},
  address = {Piscataway, NJ, USA},
  publisher = {IEEE Press},
  acmid = {2683634},
  doi = {10.1109/SC.2014.35},
  isbn = {978-1-4799-5500-8},
  keywords = {communication-avoiding algorithms, n-body, parallel algorithms, particle
	methods},
  location = {New Orleans, Louisana},
  numpages = {12},
  url = {http://dx.doi.org/10.1109/SC.2014.35}
}

@ARTICLE{kohn1999nobel,
  author = {Kohn, Walter},
  title = {{Nobel lecture: Electronic structure of matter-wave functions and
	density functionals}},
  journal = {Reviews of Modern Physics},
  year = {1999},
  volume = {71},
  pages = {1253--1266},
  number = {5},
  publisher = {Minneapolis: American Physical Society,[1930-}
}

@ARTICLE{PhysRev.140.A1133,
  author = {Kohn, W. and Sham, L.~J.},
  title = {{Self-Consistent Equations Including Exchange and Correlation Effects}},
  journal = {Phys. Rev.},
  year = {1965},
  volume = {140},
  pages = {A1133--A1138},
  month = {Nov},
  doi = {10.1103/PhysRev.140.A1133},
  issue = {4A},
  numpages = {0},
  publisher = {American Physical Society}
}

@article{Krishtal2014,
year={2015},
journal={Found. Comp. Math.},
volume={15},
number={4},
title={Localization of Matrix Factorizations},
publisher={Springer US},
keywords={Banach algebras; Localization; Matrix factorization; Inverse-closed; Spectral invariance; Holomorphic functional calculus; Off-diagonal decay; 47A56; 47A60; 47A68},
author={Krishtal, Ilya and Strohmer, Thomas and Wertz, Tim},
pages={931-951},
language={English}
}

@ARTICLE{Kutzkov2012,
  author = {Kutzkov, Konstantin},
  title = {{Deterministic algorithms for skewed matrix products}},
  year = {2012},
  pages = {1--15},
  month = sep,
  archiveprefix = {arXiv},
  arxivid = {1209.4508},
  eprint = {1209.4508}
}

@INPROCEEDINGS{Lashuk:2009:SFC,
  author = {Lashuk, Ilya and Chandramowlishwaran, Aparna and Langston, Harper
	and Nguyen, Tuan-Anh and Sampath, Rahul and Shringarpure, Aashay
	and Vuduc, Richard and Ying, Lexing and Zorin, Denis and Biros, George},
  title = {A massively parallel adaptive fast-multipole method on heterogeneous
	architectures},
  booktitle = {{SC} '09: Proceedings of the Conference on High Performance Computing
	Networking, Storage and Analysis},
  year = {2009},
  pages = {1--12},
  address = {New York, NY, USA},
  publisher = {ACM},
  location = {Portland, Oregon}
}

@INPROCEEDINGS{lee2009mcmm,
  author = {Lee, Dongryeol and Gray, Alexander G.},
  title = {{Fast High-dimensional Kernel Summations Using the Monte Carlo Multipole
	Method}},
  booktitle = {Advances in Neural Information Processing Systems (NIPS) 21 (Dec
	2008)},
  year = {2009},
  publisher = {MIT Press}
}

@INPROCEEDINGS{lee2006fgt2,
  author = {Lee, Dongryeol and Gray, Alexander G.},

repository: FreeON/spammpack

repo_name: FreeON/spammpack

gha_language: Assembly