pith. sign in
Pith Number

pith:YTUDTDDX

pith:2026:YTUDTDDXIREZ7DV65BCFZODP63
not attested not anchored not stored refs resolved

An Efficient Multilevel Preconditioned Nonlinear Conjugate Gradient Method for Incremental Potential Contact

Kemeng Huang, Taku Komura, Tiantian Liu, Wei Chen, Xingang Pan, Xing Shen, Yin Yang, Yu Zhang

The MAS-PNCG method with a Sparse-Input Woodbury update adapts multilevel preconditioners to changing contacts, enabling faster nonlinear conjugate gradient solves than Newton's method while keeping simulations intersection-free.

arxiv:2604.19892 v1 · 2026-04-21 · cs.GR · cs.AI

Add to your LaTeX paper
\usepackage{pith}
\pithnumber{YTUDTDDXIREZ7DV65BCFZODP63}

Prints a linked badge after your title and injects PDF metadata. Compiles on arXiv. Learn more · Embed verified badge

Record completeness

1 Bitcoin timestamp
2 Internet Archive
3 Author claim open · sign in to claim
4 Citations open
5 Replications open
Portable graph bundle live · download bundle · merged state
The bundle contains the canonical record plus signed events. A mirror can host it anywhere and recompute the same current state with the deterministic merge algorithm.

Claims

C1strongest claim

Experiments demonstrate that our MAS-PNCG outperforms state-of-the-art Newton-PCG solvers, GIPC and StiffGIPC, both preconditioned with MAS up to 5.66× and 2.07× respectively.

C2weakest assumption

The Sparse-Input Woodbury update algorithm maintains effective spectral properties of the multilevel preconditioner for rapidly changing contact sets without requiring full rebuilds or introducing instability in the nonlinear iterations.

C3one line summary

MAS-PNCG accelerates IPC by incrementally updating multilevel MAS preconditioners via Sparse-Input Woodbury, adding Hessian-aware 2D subspace minimization and per-subdomain CCD, achieving up to 5.66x speedup over Newton-PCG baselines.

References

94 extracted · 6 resolved · 0 Pith anchors

[1] Proceedings of the Platform for Advanced Scientific Computing Conference , pages=
[2] SIAM Journal on Optimization , volume= 2013
[3] Mathematical programming , volume= 1983
[4] Proceedings of the 21st Pan-Hellenic Conference on Informatics , pages=
[5] OPTIMIZATION LETTERS , volume=
Receipt and verification
First computed 2026-05-20T01:05:14.137105Z
Builder pith-number-builder-2026-05-17-v1
Signature Pith Ed25519 (pith-v1-2026-05) · public key
Schema pith-number/v1.0

Canonical hash

c4e8398c7744499f8ebee8445cb86ff6d150ff095de1707704e92dde7620d221

Aliases

arxiv: 2604.19892 · arxiv_version: 2604.19892v1 · doi: 10.48550/arxiv.2604.19892 · pith_short_12: YTUDTDDXIREZ · pith_short_16: YTUDTDDXIREZ7DV6 · pith_short_8: YTUDTDDX
Agent API
Verify this Pith Number yourself
curl -sH 'Accept: application/ld+json' https://pith.science/pith/YTUDTDDXIREZ7DV65BCFZODP63 \
  | jq -c '.canonical_record' \
  | python3 -c "import sys,json,hashlib; b=json.dumps(json.loads(sys.stdin.read()), sort_keys=True, separators=(',',':'), ensure_ascii=False).encode(); print(hashlib.sha256(b).hexdigest())"
# expect: c4e8398c7744499f8ebee8445cb86ff6d150ff095de1707704e92dde7620d221
Canonical record JSON
{
  "metadata": {
    "abstract_canon_sha256": "ee2767b3fc0423f8af1e7f5636a7d3a85ff7661c4bf9f0fdd023c105603e125e",
    "cross_cats_sorted": [
      "cs.AI"
    ],
    "license": "http://arxiv.org/licenses/nonexclusive-distrib/1.0/",
    "primary_cat": "cs.GR",
    "submitted_at": "2026-04-21T18:13:52Z",
    "title_canon_sha256": "bde1c97dc103059e2974bf75d545c5cb4833d75bb70531c679cdf184a7932525"
  },
  "schema_version": "1.0",
  "source": {
    "id": "2604.19892",
    "kind": "arxiv",
    "version": 1
  }
}