跳到正文
研踪PaperTrail

论文库

检索计算机领域论文,按研究方向、作者或关键词筛选。

部分采集异常
正在读取账号与研究记录…

全站更新概况

+758新增论文
+578其中 AI 相关
+94已有论文修订
+95新增 AI 导读

arXiv 最近完成扫描:2026-11-17 04:58 · 全站最近入库:2026-11-17 04:58各信源进度 →

统计口径与数据新鲜度

统计 2026-11-16 08:16 — 2026-11-17 08:16(北京时间) · 点击数字查看对应简报;AI 相关包含在新增论文内。

最近完成检查:2026-11-17 04:58最近发现新增版本:2026-11-17 04:58库内论文最新更新时间:2026-11-14 02:59

每分钟刷新已保存的数据。空检查不代表采集异常;新收录可能包含历史论文。AI 导读按新增版本计数。

24,106 已收录论文20,158 AI 相关7,049 有修订112 HF 社区发现

浏览论文库

时间范围跟随排序:版本更新、本站收录或首次发表。最新收录可能包含历史论文。部分信源异常,查看状态 →

找到 1 篇论文 · 按版本更新时间排序上轮扫描起点 2026-11-17 04:57(北京时间)
版本更新 · v2arXiv:2605.11673

Incremental Matrix Assembly for Preplanned Dynamic Tetrahedral Meshes

Manish Acharya, David Hyde

原文摘要

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.

cs.GR