DCPFJun 12

Shifting the Sweet Spot: High-Performance Matrix-Free Method for High-Order Elasticity

arXiv:2601.083744.1h-index: 2
Predicted impact top 73% in DC · last 90 daysOriginality Incremental advance
AI Analysis

For users of high-order finite-element methods, this work significantly improves the performance of MFEM's linear-elasticity solver, enabling efficient use of higher polynomial orders.

This work integrates four tensor-product partial assembly optimizations into MFEM's linear-elasticity path, achieving 7–83× kernel speedup and 3.6–16.8× end-to-end speedup on AMD EPYC 7713, shifting the operator-throughput sweet spot from p≈2 to p≥6.

MFEM is a widely used finite-element library, but its native linear-elasticity Partial Assembly (PA) path still applies an $O((p+1)^6)$ contraction in the element operator, leaving the CPU operator-throughput sweet spot near $p\approx 2$ in our baseline measurements. This work closes this implementation gap for MFEM linear elasticity on affine tensor-product hexahedral meshes by integrating four well-established tensor-product PA optimizations (sum factorization, Voigt notation, macro-kernel fusion, and slice-wise loop reorganization) into MFEM's native linear-elasticity PA path. The resulting operator is evaluated in high-order GMG-PCG solves using MFEM's geometric multigrid (GMG) components. On AMD EPYC 7713, the optimized operator achieves $7\text{--}83\times$ kernel speedup and $3.6\text{--}16.8\times$ end-to-end speedup across $p\in\{1,2,4,8\}$. At fixed problem size, the kernel-time operator throughput peaks around $p=6$ and remains high at $p=8$, shifting the operator-throughput sweet spot to $p\ge 6$. The same trend is reproduced on Huawei~Kunpeng~920 (ARMv8.2). These results are accompanied by per-stage ablation and hardware-counter characterization; the implementation will be released on GitHub.

Foundations

The foundational work for this paper's niche, ranked by how specifically the neighbourhood builds on it — not by global fame.

Your Notes