Abstract Globally supported covariance functions are generally associated with dense covariance matrices, meaning severe numerical problems in solution feasibility. These problems can be alleviated by considering methods yielding sparse covariance matrices. Indeed, having many zero entries in the covariance matrix can both greatly reduce computer storage requirements and the number of floati…