Fetching the paper…
Reading the bibliography…
Many important problems are characterized by the eigenvalues of a large matrix.
A stochastic approximation method
Herbert Robbins and Sutton Monro · 1951
Earlier work this paper cites.
Characteristic vectors of bordered matrices with infinite dimensions
Eugene P Wigner · 1955
Earlier work this paper cites.
Theory of gradient methods
Heinz Rutishauser · 1959
Earlier work this paper cites.
Distribution of eigenvalues for some sets of random matrices
Vladimir A Marčenko and Leonid Andreevich Pastur · 1967
Earlier work this paper cites.
Electronic structure based on the local atomic environment for tight-binding bands
R Haydock, Volker Heine, and MJ Kelly · 1972
Earlier work this paper cites.
Introduction to dynamic systems: theory, model, and applications
David G. Luenberger · 1979
Earlier work this paper cites.
Polynomial preconditioners for conjugate gradient calculations
Olin G Johnson, Charles A Micchelli, and George Paul · 1983
Earlier work this paper cites.
An accurate and efficient scheme for propagating the time dependent schrödinger equation
Hillel Tal-Ezer and R Kosloff · 1984
Earlier work this paper cites.
Practical use of polynomial preconditionings for the conjugate gradient method
Youcef Saad · 1985
Earlier work this paper cites.
Unbiased Monte Carlo evaluation of certain functional integrals
Wolfgang Wagner · 1987
Earlier work this paper cites.
A stochastic estimator of the trace of the influence matrix for Laplacian smoothing splines
MF Hutchinson · 1989
Earlier work this paper cites.
The eigenvalues of mega-dimensional matrices , pages 455–466
John Skilling · 1989
Earlier work this paper cites.
Maximum entropy approach for linear scaling in the electronic structure problem
David A Drabold and Otto F Sankey · 1993
Earlier work this paper cites.
Matrices, moments and quadrature
Gene H Golub and Gérard Meurant · 1994
Earlier work this paper cites.
Densities of states of mega-dimensional Hamiltonian matrices
RN Silver and H Röder · 1994
Earlier work this paper cites.
Orthogonal polynomial expansion of the spectral density operator and the calculation of bound state energies and eigenfunctions
Wei Zhu, Youhong Huang, DJ Kouri, Colston Chandler, and David K Hoffman · 1994
Earlier work this paper cites.
Bounds for the trace of the inverse and the determinant of symmetric positive definite matrices
Zhaojun Bai and Gene H Golub · 1996
Cited alongside, same era.
Some large-scale matrix computation problems
Zhaojun Bai, Gark Fahey, and Gene Golub · 1996
Cited alongside, same era.
Matrix pseudo-spectroscopy: iterative calculation of matrix eigenvalues and eigenvectors of large matrices using a polynomial expansion of the dirac delta function
Gregory A Parker, Wei Zhu, Youhong Huang, David K Hoffman, and Donald J Kouri · 1996
Cited alongside, same era.
Kernel polynomial approximations for densities of states and spectral functions
RN Silver, H Roeder, AF Voter, and JD Kress · 1996
Cited alongside, same era.
Spectral graph theory , volume 92
Fan R.K. Chung · 1997
Cited alongside, same era.
Calculation of absolute spectral densities via stochastic estimators of tr { \{ δ \delta (E-Ĥ) } \}
Self-averaging stochastic Kohn-Sham density-functional theory
Roi Baer, Daniel Neuhauser, and Eran Rabani · 2013
Later among the works it cites.
Deep learning with COTS HPC systems
Adam Coates, Brody Huval, Tao Wang, David Wu, Bryan Catanzaro, and Ng Andrew · 2013
Later among the works it cites.
Approximation theory and approximation practice
Lloyd N Trefethen · 2013
Later among the works it cites.
A randomized algorithm for approximating the log determinant of a symmetric positive definite matrix
Christos Boutsidis, Petros Drineas, Prabhanjan Kambadur, Eugenia-Maria Kontopoulou, and Anastasios Zouzias · 2015
Later among the works it cites.
Large-scale log-determinant computation through stochastic Chebyshev expansions
Insu Han, Dmitry Malioutov, and Jinwoo Shin · 2015
Later among the works it cites.
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
Stephen J Jeffrey and Sean C Smith · 1997
Cited alongside, same era.
Anatomy of a large-scale hypertextual web search engine
Sergey Brin and Lawrence Page · 1998
Cited alongside, same era.
Monte Carlo estimates of the log determinant of large sparse matrices
Ronald Paul Barry and R Kelley Pace · 1999
Cited alongside, same era.
Algebraic Graph Theory
C. Godsil and G.F. Royle · 2001
Cited alongside, same era.
The kernel polynomial method
Alexander Weiße, Gerhard Wellein, Andreas Alvermann, and Holger Fehske · 2006
Cited alongside, same era.
An estimator for the diagonal of a matrix
Costas Bekas, Effrosyni Kokiopoulou, and Yousef Saad · 2007
Cited alongside, same era.
We knew the web was big…
Jesse Alpert and Nissan Hajaj · 2008
Cited alongside, same era.
Wei Peng and Hongxia Wang · 2015
Later among the works it cites.
Improved bounds on sample size for implicit matrix trace estimators
Farbod Roosta-Khorasani and Uri Ascher · 2015
Later among the works it cites.
Second order stochastic optimization in linear time
Naman Agarwal, Brian Bullins, and Elad Hazan · 2016
Later among the works it cites.
Nonlinear programming
Dimitri P Bertsekas · 2016
Later among the works it cites.
Efficient estimation of eigenvalue counts in an interval
Edoardo Di Napoli, Eric Polizzi, and Yousef Saad · 2016
Later among the works it cites.
Approximating spectral densities of large matrices
Lin Lin, Yousef Saad, and Chao Yang · 2016
Later among the works it cites.
Randomized matrix-free trace and log-determinant estimators
Arvind K Saibaba, Alen Alexanderian, and Ilse CF Ipsen · 2016
Later among the works it cites.
Randomized estimation of spectral densities of large matrices made accurate
Lin Lin · 2017
Later among the works it cites.
Geometry of neural network loss surfaces via random matrix theory
Jeffrey Pennington and Yasaman Bahri · 2017
Later among the works it cites.
Fast computation of spectral densities for generalized eigenvalue problems
Yuanzhe Xi, Ruipeng Li, and Yousef Saad · 2017
Later among the works it cites.