  We consider the problem of estimating log-determinants of large, sparse,
positive definite matrices. A key focus of our algorithm is to reduce
computational cost, and it is based on sparse approximate inverses. The
algorithm can be implemented to be adaptive, and it uses graph spline
approximation to improve accuracy. We illustrate our approach on classes of
large sparse matrices.
