A Randomized Algorithm for Approximating the Log Determinant of a Symmetric Positive Definite Matrix

The iterative calculation of a few of the lowest eigenvalues and corresponding eigenvectors of large real-symmetric matrices

Ernest R Davidson · 1975

Earlier work this paper cites.

Approximations to the determinant term in gaussian maximum likelihood estimation of some spatial models

RJ Martin · 1992

Earlier work this paper cites.

Highly scalable parallel algorithms for sparse matrix factorization

Anshul Gupta, George Karypis, and Vipin Kumar · 1997

Earlier work this paper cites.

Quick computation of spatial autoregressive estimators

R Kelley Pace and Ronald Barry · 1997

Earlier work this paper cites.

Monte carlo estimates of the log determinant of large sparse matrices

Ronald Paul Barry and R Kelley Pace · 1999

Earlier work this paper cites.

On computing the determinant and smith form of an integer matrix

Wayne Eberly, Mark Giesbrecht, and Gilles Villard · 2000

Earlier work this paper cites.

Wsmp: Watson sparse matrix package (part-i: direct solution of symmetric sparse systems)

Anshul Gupta · 2000

Earlier work this paper cites.

A method for spatial–temporal forecasting with an application to real estate prices

R Kelley Pace, Ronald Barry, Otis W Gilley, and CF Sirmans · 2000

Earlier work this paper cites.

Spatial dependence in data mining

James P LeSage and R Kelley Pace · 2001

Earlier work this paper cites.

Approximation of the determinant of large sparse symmetric positive definite matrices

Arnold Reusken · 2002

Earlier work this paper cites.

Chebyshev approximation of log-determinants of spatial weight matrices

R Kelley Pace and James P LeSage · 2004

Earlier work this paper cites.

Nearly-linear time algorithms for graph partitioning, graph sparsification, and solving linear systems

Daniel A Spielman and Shang-Hua Teng · 2004

Cited alongside, same era.

Efficient gaussian process based on bfgs updating and logdet approximation

WE Leithead, Yunong Zhang, and DJ Leith · 2005

Cited alongside, same era.

Direct methods for sparse linear systems

Timothy A Davis · 2006

Cited alongside, same era.

Approximate implementation of the logarithm of the matrix determinant in gaussian process regression

Yunong Zhang and William E Leithead · 2007

Cited alongside, same era.

First-order methods for sparse covariance selection

Alexandre d’Aspremont, Onureena Banerjee, and Laurent El Ghaoui · 2008

Cited alongside, same era.

Sparse inverse covariance estimation with the graphical lasso

Jerome Friedman, Trevor Hastie, and Robert Tibshirani · 2008

The university of florida sparse matrix collection

Timothy A Davis and Yifan Hu · 2011

Later among the works it cites.

Parallel random numbers: as easy as 1, 2, 3

John K Salmon, Mark A Moraes, Ron O Dror, and David E Shaw · 2011

Later among the works it cites.

Graph Partitioning and Expanders

Luca Trevisan · 2011

Later among the works it cites.

Big & quic: Sparse inverse covariance estimation for a million variables

Cho-Jui Hsieh, Mátyás A Sustik, Inderjit S Dhillon, Pradeep K Ravikumar, and Russell Poldrack · 2013

Later among the works it cites.

A parallel, block greedy method for sparse inverse covariance estimation for ultra-high dimensions

Prabhanjan Kambadur and Aurelie Lozano · 2013

Later among the works it cites.

Elemental: A new framework for distributed memory dense matrix computations

Jack Poulson, Bryan Marker, Robert A Van de Geijn, Jeff R Hammond, and Nichols A Romero · 2013