Fetching the paper…
Reading the bibliography…
We present new algorithms for computing the log-determinant of symmetric, diagonally dominant matrices.
Quantum theory of many-particle systems. iii. extension of the hartree-fock scheme to include degenerate systems and correlation effects
Per-Olov Löwdin · 1955
Earlier work this paper cites.
Direct methods for sparse matrices
Iain S Duff, Albert Maurice Erisman, and John Ker Reid · 1986
Earlier work this paper cites.
Multigrid techniques for quark propagator
Philippe de Forcrand and Rajan Gupta · 1989
Earlier work this paper cites.
The Role of Elimination Trees in Sparse Factorization
J Liu · 1990
Earlier work this paper cites.
Approximations to the determinant term in Gaussian maximum likelihood estimation of some spatial models
R J Martin · 1992
Earlier work this paper cites.
Monte carlo methods for estimating linear combinations of inverse matrix entries in lattice {QCD}
Shannon Bernardson, Paul McCarty, and Chris Thron · 1994
Earlier work this paper cites.
A graph-theoretic game and its application to the k-server problem
Noga Alon, RM Karp, D Peleg, and Douglas West · 1995
Earlier work this paper cites.
Some large-scale matrix computation problems
Zhaojun Bai, Mark Fahey, and Gene H. Golub · 1996
Earlier work this paper cites.
Combinatorial Preconditioners for Sparse, Symmetric, Diagonally Dominant Linear Systems
Keith D. Gremban · 1996
Earlier work this paper cites.
Sparse spatial autoregressions
R. Kelley Pace and Ronald Barry · 1997
Earlier work this paper cites.
Efficient algorithm for qcd with light dynamical quarks
A Duncan, E Eichten, and H Thacker · 1998
Earlier work this paper cites.
Monte Carlo estimates of the log determinant of large sparse matrices
Ronald Paul Barry and R. Kelley Pace · 1999
Cited alongside, same era.
Computer Solution of Large Linear Systems
Gérard A Meurant · 1999
Cited alongside, same era.
Approximation of the Determinant of Large Sparse Symmetric Positive Definite Matrices
Arnold Reusken · 2002
Cited alongside, same era.
Analysis of computer experiments using penalized likelihood in gaussian kriging models
Runze Li and Agus Sudjianto · 2005
Cited alongside, same era.
The Schur complement and its applications
Fuzhen Zhang · 2005
Cited alongside, same era.
Determinant approximations
Ilse C F Ipsen and Dean J Lee · 2006
Cited alongside, same era.
Yunong Zhang, W.E. Leithead, D.J. Leith, and L. Walshe · 2008
Later among the works it cites.
Nearly-Linear Time Algorithms for Preconditioning and Solving Symmetric , Diagonally Dominant Linear Systems
Daniel A Spielman and Shang-Hua Teng · 2009
Later among the works it cites.
A Note on Preconditioning by Low-Stretch Spanning Trees
Daniel A Spielman and Jaeoh Woo · 2009
Later among the works it cites.
Approaching optimality for solving SDD linear systems
Ioannis Koutis, Gary L Miller, and Richard Peng · 2010
Later among the works it cites.
Algorithms , Graph Theory , and Linear Equations in Laplacian Matrices
Daniel A Spielman · 2010
Later among the works it cites.
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
Log-determinant relaxation for approximate inference in discrete Markov random fields
M.J. Wainwright and M.I. Jordan · 2006
Cited alongside, same era.
Approximate implementation of the logarithm of the matrix determinant in Gaussian process regression
Y. Zhang and W. E. Leithead · 2007
Cited alongside, same era.
Nearly tight low stretch spanning trees
Ittai Abraham, Yair Bartal, and Ofer Neiman · 2008
Cited alongside, same era.
A Stochastic Simulation for Approximating the log-Determinant of a Symmetric Positive Definite Matrix
M McCourt · 2008
Cited alongside, same era.
A Local Clustering Algorithm for Massive Graphs and its Application to Nearly-Linear Time Graph Partitioning
Daniel A Spielman and Shang-Hua Teng · 2008
Cited alongside, same era.
Hao Zhang and Yong Wang · 2010
Later among the works it cites.
Molecular quantum mechanics
Peter W Atkins and Ronald S Friedman · 2011
Later among the works it cites.
A nearly-m log n time solver for SDD linear systems
Ioannis Koutis, Gary L Miller, and Richard Peng · 2011
Later among the works it cites.
Graph Sparsification by Effective Resistances
Daniel A Spielman and Nikhil Srivastava · 2011
Later among the works it cites.
A simple, combinatorial algorithm for solving sdd systems in nearly-linear time
Jonathan A Kelner, Lorenzo Orecchia, Aaron Sidford, and Zeyuan Allen Zhu · 2013
Later among the works it cites.