Computing the Jacobian in Gaussian Spatial Autoregressive Models: An Illustrated Comparison of Available Methods

When estimating spatial regression models by maximum likelihood using spatial weights matrices to represent spatial processes, computing the Jacobian, ln(vertical bar I-lambda W vertical bar), remains a central problem. In principle, and for smaller data sets, the use of the eigenvalues of the spatial weights matrix provides a very rapid resolution. Analytical eigenvalues are available for large regular grids. For larger problems not on regular grids, including those induced in spatial panel and dyadic (network) problems, solving the eigenproblem may not be feasible, and a number of alternatives have been proposed. This article surveys selected alternatives, and comments on their relative usefulness, covering sparse Cholesky and sparse LU factorizations, and approximations such as Monte Carlo, Chebyshev, and using lower-order moments with interpolation. The results are presented in terms of component-wise differences between sets of Jacobians for selected data sets. In conclusion, recommendations are made for a number of analytical settings.