Matrix-Free Delassus Operations: Scalable and Memory-Efficient Algorithms

Authors:
Preprint
Publisher website
Google Scholar
  • 14 January 2026
    • preprint
    • Published by HAL in HAL
Abstract
The Delassus matrix, closely related to the operational-space inertia matrix, is a fundamental quantity in robotics with applications in simulation, system identification, and control. Traditional approaches compute and store this matrix explicitly, either in sparse or dense form. In this work, we depart from this convention by treating the Delassus matrix as a matrix-free operator. We derive efficient algorithms with low computational complexity that multiply the Delassus matrix or its damped inverse by an input vector or matrix. Unlike approaches based on explicit matrix construction, our method achieves a linear memory footprint, making it scalable to problems with thousands of constraints and suitable for execution on resourcelimited hardware. We implement these matrix-free operations on top of the open-source Pinocchio library and evaluate their performance against state-of-the-art methods that rely on explicit matrix computation. Our benchmarks demonstrate substantial speedups, ranging from 2x to over 400x, in contact-rich scenarios.
All Related Versions

This publication has 18 references indexed in Scilit: