A chiseling algorithm for low-rank Grassmann decomposition of skew-symmetric tensors

A numerical algorithm to decompose an exact low-rank skew-symmetric tensor into a sum of elementary skew-symmetric tensors is introduced. The algorithm uncovers this Grassmann decomposition based on linear relations that are encoded by the kernel of the differential of the natural action of the general linear group on the tensor, following the ideas of [Brooksbank, Kassabov, and Wilson, Detecting sparsity patterns in tensor data , arXiv:2408.17425v3, 2026]. The Grassmann decomposition can be recovered, up to scale, from a diagonalization of a generic element in this kernel. Numerical experiments illustrate that the algorithm is computationally efficient and quite accurate for mathematically low-rank tensors.