arXiv · 2301.10042
Logarithmically Sparse Symmetric Matrices
Abstract
A positive definite matrix is called logarithmically sparse if its matrix logarithm has many zero entries. Such matrices play a significant role in high-dimensional statistics and semidefinite optimization. In this paper, logarithmically sparse matrices are studied from the point of view of computational algebraic geometry: we present a formula for the dimension of the Zariski closure of a set of matrices with a given logarithmic sparsity pattern, give a degree bound for this variety and develop implicitization algorithms that allow to find its defining equations. We illustrate our approach with numerous examples.
Explore related subjects
Keep this discovery
Dmitrii Pavlov. 2023-01-24. Logarithmically Sparse Symmetric Matrices. https://arxiv.org/abs/2301.10042
Cite the original work for its findings. Save a collection to share your selection of sources.