跳到正文
研踪PaperTrail
← 研踪 PaperTrail

arXiv:2605.11673 · v2

Incremental Matrix Assembly for Preplanned Dynamic Tetrahedral Meshes

首次提交 2026-05-12 15:29
版本更新 2026-11-07 01:23
雷达观测 2026-11-10 10:11
arXiv ↗PDF ↗

摘要

Local topology edits require updating assembled operators even when most of a tetrahedral mesh remains unchanged. We implement and evaluate incremental matrix assembly for preplanned edits, assuming a fixed pool of candidate elements with precomputable contributions. A preallocated sparse layout allows operator values to be updated from edited elements without rebuilding the sparsity structure. We compare full reassembly, local recomputation, and persistent incremental updates using a shared layout. Across tested meshes with up to 460k tetrahedra, incremental assembly achieves 6-27 times assembly speedups over a vectorized full-reassembly baseline for a proxy graph Laplacian and 2-17 times for linear elasticity. Frame times decrease by 1-3% when the linear solve dominates and by 18-20% in the tested synthetic dynamic elasticity loop with shorter solves. Local Recompute often achieves comparable frame times. For fixed time-step coefficients, directly maintaining the combined elasticity system also avoids a global matrix-combination pass. The Laplacian matches full reconstruction exactly in every tested frame; elasticity differences remain at rounding scale, reaching a maximum entry difference of 4.2 times 10^(-16) over 5,000 frames.

作者备注:10 pages, 5 figures. Revision: updated title and framing, corrected performance claims and added baseline comparisons, numerical validation, and additional experiments

AI 论文解读

基于摘要 · 非全文审阅

此版本尚未生成 AI 解读。解读由后台任务生成并按论文版本保存,登录后共享已有结果。

版本差异

本站首次收录为 v2,暂无更早版本可对照。

观测到的版本

相邻记录可能跳过中间版本;首次发现 v2 及以上也会标为版本更新。

v2 · 2026-11-07 01:23 · 最新观测版本

Incremental Matrix Assembly for Preplanned Dynamic Tetrahedral Meshes

Local topology edits require updating assembled operators even when most of a tetrahedral mesh remains unchanged. We implement and evaluate incremental matrix assembly for preplanned edits, assuming a fixed pool of candidate elements with precomputable contributions. A preallocated sparse layout allows operator values to be updated from edited elements without rebuilding the sparsity structure. We compare full reassembly, local recomputation, and persistent incremental updates using a shared layout. Across tested meshes with up to 460k tetrahedra, incremental assembly achieves 6-27 times assembly speedups over a vectorized full-reassembly baseline for a proxy graph Laplacian and 2-17 times for linear elasticity. Frame times decrease by 1-3% when the linear solve dominates and by 18-20% in the tested synthetic dynamic elasticity loop with shorter solves. Local Recompute often achieves comparable frame times. For fixed time-step coefficients, directly maintaining the combined elasticity system also avoids a global matrix-combination pass. The Laplacian matches full reconstruction exactly in every tested frame; elasticity differences remain at rounding scale, reaching a maximum entry difference of 4.2 times 10^(-16) over 5,000 frames.

查看此版本解读 →查看此版本原文 ↗