Fetching the paper…
Reading the bibliography…
A number of problems in probability and statistics can be addressed using the multivariate normal (Gaussian) distribution.
J. Sherman and W. J. Morrison, “Adjustment of an inverse matrix corresponding to a change in one element of a given matrix,” Ann. Math. Stat. , pp. 124–127, 1950
1950
Earlier work this paper cites.
M. A. Woodbury, “Inverting modified matrices,” 1950, statistical Research Group, Memo. Rep. no. 42, Princeton University
1950
Earlier work this paper cites.
L. Greengard and V. Rokhlin, “A fast algorithm for particle simulations,” J. Comput. Phys. , vol. 73, no. 2, pp. 325–348, 1987
1987
Earlier work this paper cites.
W. Hager, “Updating the inverse of a matrix,” SIAM Rev. , pp. 221–239, 1989
1989
Earlier work this paper cites.
L. Greengard and J. Strain, “The Fast Gauss Transform,” SIAM J. Sci. Stat. Comput. , vol. 12, pp. 79–94, 1991
1991
Earlier work this paper cites.
A. Dutt and V. Rokhlin, “Fast Fourier Transforms for Nonequispaced Data,” SIAM J. Sci. Comput. , vol. 14, no. 6, pp. 1368–1393, 1993
1993
Earlier work this paper cites.
——, “Fast Fourier Transforms for Nonequispaced Data, II,” Appl. Comput. Harm. Anal. , vol. 2, no. 1, pp. 85–100, 1995
1995
Earlier work this paper cites.
G. N. Watson, A Treatise on the Theory of Bessel Functions . New York, NY: Cambridge University Press, 1995
1995
Earlier work this paper cites.
A. G. Akritas, E. K. Akritas, and G. I. Malaschonok, “Various proofs of Sylvester’s (determinant) identity,” Math. Comput. Simulat. , vol. 42, no. 4, pp. 585–593, 1996
1996
Earlier work this paper cites.
G. Golub and C. Van Loan, Matrix Computations . Johns Hopkins Univ Press, 1996, vol. 3
1996
Earlier work this paper cites.
M. Gu and S. Eisenstat, “Efficient algorithms for computing a strong rank-revealing QR factorization,” SIAM J. Sci. Comput. , vol. 17, no. 4, pp. 848–869, 1996
1996
Earlier work this paper cites.
C. Dietrich and G. Newsam, “Fast and exact simulation of stationary gaussian processes through circulant embedding of the covariance matrix,” SIAM J. Sci. Comput. , vol. 18, p. 1088, 1997
1997
Earlier work this paper cites.
S. Goreinov, E. Tyrtyshnikov, and N. Zamarashkin, “A theory of pseudoskeleton approximations,” Lin. Alg. Appl. , vol. 261, no. 1-3, pp. 1–21, 1997
1997
Earlier work this paper cites.
D. J. MacKay, “Introduction to Gaussian processes,” NATO ASI Series F Computer and Systems Sciences , vol. 168, pp. 133–166, 1998
1998
Earlier work this paper cites.
R. P. Barry and R. K. Pace, “Monte Carlo estimates of the log determinant of large sparse matrices,” Lin. Alg. Appl. , vol. 289, pp. 41–54, 1999
1999
Earlier work this paper cites.
W. Hackbusch, “A Sparse Matrix Arithmetic Based on ℋ \mathcal{H} -Matrices. Part I: Introduction to ℋ \mathcal{H} -Matrices,” Computing , vol. 62, no. 2, pp. 89–108, 1999
1999
Earlier work this paper cites.
W. Hackbusch and B. N. Khoromskij, “A sparse ℋ \mathcal{H} -matrix arithmetic,” Computing , vol. 64, no. 1, pp. 21–47, 2000
2000
Earlier work this paper cites.
C.-T. Pan, “On the existence and computation of rank-revealing LU factorizations,” Lin. Alg. Appl. , vol. 316, no. 1, pp. 199–222, 2000
2000
Earlier work this paper cites.
A. J. Smola and P. L. Bartlett, “Sparse greedy gaussian process regression,” in Advances in Neural Information Processing Systems 13 , T. K. Leen, T. G. Dietterich, and V. Tresp, Eds. MIT Press, Cambridge, MA, 2001, pp. 619–625
2001
Earlier work this paper cites.
W. Hackbusch and S. Börm, “Data-sparse approximation by adaptive ℋ 2 \mathcal{H}^{2} -matrices,” Computing , vol. 69, no. 1, pp. 1–35, 2002
2002
Earlier work this paper cites.
S. Rjasanow, “Adaptive cross approximation of dense matrices,” IABEM 2002, International Association for Boundary Element Methods , 2002
2002
Earlier work this paper cites.
S. Börm, L. Grasedyck, and W. Hackbusch, “Hierarchical matrices,” Lecture notes , vol. 21, 2003
2003
Earlier work this paper cites.
C. Chatfield, The Analysis of Time Series: An Introduction , 6th ed. Boca Raton, FL: Chapman and Hall, 2003
2003
Cited alongside, same era.
Z. Gimbutas and V. Rokhlin, “A generalized fast multipole method for nonoscillatory kernels,” SIAM J. Sci. Comput. , vol. 24, no. 3, pp. 796–817, 2003
2003
Cited alongside, same era.
L. Grasedyck and W. Hackbusch, “Construction and arithmetics of ℋ \mathcal{H} -matrices,” Computing , vol. 70, no. 4, pp. 295–334, 2003
2003
Cited alongside, same era.
L. Miranian and M. Gu, “Strong rank revealing LU factorizations,” Lin. Alg. Appl. , vol. 367, pp. 1–16, 2003
2003
Cited alongside, same era.
A. Frieze, R. Kannan, and S. Vempala, “Fast Monte-Carlo algorithms for finding low-rank approximations,” J. ACM , vol. 51, no. 6, pp. 1025–1041, 2004
2004
Cited alongside, same era.
L. Ying, “Fast algorithms for boundary integral equations,” in Multiscale Modeling and Simulation in Science . Springer, 2009, pp. 139–193
2009
Later among the works it cites.
J. Hartikainen and S. Särkkä, “Kalman Filtering and Smoothing Solutions to Temporal Gaussian Process Regression Models,” in Proc. IEEE Int. Work. Mach. Learn. Signal Process. , 2010
2010
Later among the works it cites.
F. W. J. Olver, D. W. Lozier, R. F. Boisvert, and C. W. Clark, Eds., NIST Handbook of Mathematical Functions . New York, NY: Cambridge University Press, 2010
2010
Later among the works it cites.
M. Anitescu, J. Chen, and L. Wang, “A Matrix-Free Approach for Solving the Parametric Gaussian Process Maximum Likelihood Problem,” SIAM J. Sci. Comput. , vol. 34, pp. A240–A262, 2012
2012
Later among the works it cites.
K. L. Ho and L. Greengard, “A fast direct solver for structured linear systems by recursive skeletonization,” SIAM J. Sci. Comput. , vol. 34, no. 5, pp. 2507–2532, 2012
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
L. Greengard and J.-Y. Lee, “Accelerating the Nonuniform Fast Fourier Transform,” SIAM Rev. , vol. 46, pp. 443–454, 2004
2004
Cited alongside, same era.
R. K. Pace and J. P. LeSage, “Chebyshev approximation of log-determinants of spatial weight matrices,” Comput. Stat. & Data Anal. , vol. 45, pp. 179–196, 2004
2004
Cited alongside, same era.
L. Ying, G. Biros, and D. Zorin, “A kernel-independent adaptive fast multipole algorithm in two and three dimensions,” J. Comput. Phys. , vol. 196, no. 2, pp. 591–626, 2004
2004
Cited alongside, same era.
O. Cappé, E. Moulines, and T. Rydén, Inference in hidden Markov models . New York, NY: Springer-Verlag, 2005
2005
Cited alongside, same era.
P.-G. Martinsson and V. Rokhlin, “A fast direct solver for boundary integral equations in two dimensions,” J. Comput. Phys. , vol. 205, no. 1, pp. 1–23, 2005
2005
Cited alongside, same era.
J. Q. nonero Candela and C. E. Rasmussen, “A unifying view of sparse approximate gaussian process regression,” J. Mach. Learn. Res. , vol. 6, pp. 1939–1959, 2005
2005
Cited alongside, same era.
C. Yang, R. Duraiswami, and L. Davis, “Efficient kernel machines using the improved fast gauss transform,” in Advances in Neural Information Processing Systems 17 , L. K. Saul, Y. Weiss, and L. Bottou, Eds. MIT Press, Cambridge, MA, 2005, pp. 1561–1568
2005
Cited alongside, same era.
2012
Later among the works it cites.
S. Ambikasaran, “Fast algorithms for dense numerical linear algebra and applications,” Ph.D. dissertation, Stanford University, 2013
2013
Later among the works it cites.
S. Ambikasaran, “A fast direct solver for dense linear systems,” https://github.com/sivaramambikasaran/HODLR, 2013
2013
Later among the works it cites.
S. Ambikasaran and E. Darve, “An 𝒪 ( n log n ) \mathcal{O}(n\log n) Fast Direct Solver for Partial Hierarchically Semi-Separable Matrices,” J. Sci. Comput. , vol. 57, no. 3, pp. 477–501, 2013
2013
Later among the works it cites.
S. Ambikasaran, J. Y. Li, P. K. Kitanidis, and E. Darve, “Large-scale stochastic linear inversion using hierarchical matrices,” Comput. Geosci. , vol. 17, no. 6, pp. 913–927, 2013
2013
Later among the works it cites.
S. Ambikasaran, A. K. Saibaba, E. F. Darve, and P. K. Kitanidis, “Fast Algorithms for Bayesian Inversion,” in Computational Challenges in the Geosciences . Springer, 2013, pp. 101–142
2013
Later among the works it cites.
2013
Later among the works it cites.
K. Chalupka, C. K. I. Williams, and I. Murray, “A Framework for Evaluating Approximation Methods for Gaussian Process Regression,” J. Mach. Learn. Res. , vol. 14, pp. 333–350, 2013
2013
Later among the works it cites.
J. Chen, L. Wang, and M. Anitescu, “A Fast Summation Tree Code for Matérn Kernel,” SIAM J. Sci. Comput. , vol. 36, pp. A289–A309, 2013
2013
Later among the works it cites.
J. Hensman, N. Fusi, and N. D. Lawrence, “Gaussian Processes for Big Data,” in Proc. 29th Conf. Uncertainty in Artificial Intelligence , A. Nicholson and P. Smyth, Eds. Corvallis, OR: AUAI Press, 2013, pp. 282–290
2013
Later among the works it cites.
S. Särkkä, A. Solin, and J. Hartikainen, “Spatio-Temporal Learning via Infinite-Dimensional Bayesian Filtering and Smoothing,” IEEE Signal Process. Mag. , vol. 30, no. 4, pp. 51–61, 2013
2013
Later among the works it cites.
A. Solin and S. Särkkä, “Infinite-Dimensional Bayesian Filtering for Detection of Quasi-Periodic Phenomena in Spatio-Temporal Data,” Phys. Rev. E , vol. 88, no. 5, p. 052909, 2013
2013
Later among the works it cites.
L. N. Trefethen, Approximation theory and approximation practice . Philadelphia, PA: SIAM, 2013
2013
Later among the works it cites.
K. Zhao, M. N. Vouvakis, and J.-F. Lee, “The Adaptive Cross Approximation Algorithm for Accelerated Method of Moments Computations of EMC Problems,” IEEE Trans. Electromagn. Compat. , vol. 47, no. 4, pp. 763–773, 2005
2013
Later among the works it cites.
2014
Closest in time.
D. Foreman-Mackey, “Fast Gaussian Processes for regression,” https://github.com/dfm/george, 2014
2014
Closest in time.
J. Y. Li, S. Ambikasaran, E. Darve, and P. K. Kitandis, “A Kalman filter powered by ℋ 2 \mathcal{H}^{2} -matrices for quasi-continuous data assimilation problems,” Water Resour. Res. , vol. 50, pp. 3734–3749, 2014
2014
Closest in time.
A. Townsend and L. N. Trefethen, “Continuous analogues of matrix factorizations,” Proc. Roy. Soc. A , vol. 471, p. 20140585, 2015
2015
Closest in time.