MPM Lite: Linear Kernels and Integration without Particles
Xiang Feng, Yunuo Chen, Chang Yu, Hao Su, Demetri Terzopoulos, Yin Yang, Joe Masterjohn, Alejandro Castro, Chenfanfu Jiang

TL;DR
MPM Lite introduces a hybrid Lagrangian/Eulerian method that eliminates particle-based quadrature, significantly speeding up simulations while maintaining robustness across various materials.
Contribution
It proposes a novel architecture that replaces particle quadrature with fixed-location linear kernels, enabling faster and more modular MPM implementations.
Findings
Achieves speedups in implicit simulations
Maintains robustness across diverse materials
Improves explicit simulation performance
Abstract
In this paper, we introduce MPM Lite, a new hybrid Lagrangian/Eulerian method that eliminates the need for particle-based quadrature at solve time. Standard MPM practices suffer from a performance bottleneck where expensive implicit solves are proportional to particle-per-cell (PPC) counts due to the the choices of particle-based quadrature and wide-stencil kernels. In contrast, MPM Lite treats particles primarily as carriers of kinematic state and material history. By conceptualizing the background Cartesian grid as a voxel hexahedral mesh, we resample particle states onto fixed-location quadrature points using efficient, compact linear kernels. This architectural shift allows force assembly and the entire time-integration process to proceed without accessing particles, making the solver complexity no longer relate to particles. At the core of our method is a novel stress transfer and…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsComputer Graphics and Visualization Techniques · Block Copolymer Self-Assembly · Composite Material Mechanics
