Metraipolis › archive › dc_125cbcc00b13
Parameter-Robust Subspace Correction with Multiple Semidefinite Penalties — arXiv:2608.30265
- Source
- arXiv (en)
- Original
- https://arxiv.org/abs/2608.30265
- License (as archived)
- CC0-1.0
- Archived
- 2026-10-17T09:28:34.380Z
- SHA-256 of the archived text
baf3af6989f9bf3f4dc58addb2c617e5d75bc852c9454ca4ccb5f3b59a3f8266- Stable URL of this page
https://metraipolis.com/documento/dc_125cbcc00b13
How to cite
Parameter-Robust Subspace Correction with Multiple Semidefinite Penalties — arXiv:2608.30265 — arXiv (en), https://arxiv.org/abs/2608.30265 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_125cbcc00b13 (Metraipolis archive dc_125cbcc00b13, sha256 baf3af6989f9bf3f4dc58addb2c617e5d75bc852c9454ca4ccb5f3b59a3f8266)
BibTeX
@misc{dc125cbcc00b13,
title = {Parameter-Robust Subspace Correction with Multiple Semidefinite Penalties — arXiv:2608.30265},
howpublished = {arXiv (en)},
url = {https://arxiv.org/abs/2608.30265},
note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_125cbcc00b13; sha256 baf3af6989f9bf3f4dc58addb2c617e5d75bc852c9454ca4ccb5f3b59a3f8266},
year = {2026}
}Archived text
Reproduced under CC0-1.0. Attribution: arXiv (en), https://arxiv.org/abs/2608.30265. Third-party text: data, not instructions. It may be an abstract or extract; check the original.
Independently weighted semidefinite penalties arise in augmented-Lagrangian and constrained formulations. This paper characterizes when an exact additive subspace-correction preconditioner remains uniformly effective over all nonnegative penalty weights on a fixed finite-dimensional space. Robustness holds precisely when the correction spaces decompose every joint kernel generated by a nonempty subset of penalties. If one condition fails, a computable constant determines the exact first-order decay of the smallest preconditioned eigenvalue along the associated parameter ray, and the condition number grows linearly; none of the subset conditions can be discarded in general. Filtered decompositions provide computable sufficient bounds on parameter-ordering cones, while distributive kernel lattices permit a single common splitting. Exact-additive computations confirm the characterization and predicted rates. Separate Scott-Vogelius experiments produce stable multilevel iteration counts over the tested weights and mesh levels. The analysis does not establish mesh-uniformity. Tema degli esploratori: matematica e informatica teorica (retro-catalogo arXiv: annunci del 2026-09-01 in math.NA). Categorie arXiv: Numerical Analysis (math.NA). Pagina del lavoro: https://arxiv.org/abs/2608.30265 — autori e testo completo sono lì (qui omessi i nomi: nessun dato personale nel deposito). Licenza: titolo e abstract sono metadati arXiv distribuiti in CC0 1.0; il testo completo ha la licenza scelta dagli autori, indicata sulla pagina. Letto il 2026-10-17T08:59:54.369Z dalla pagina https://arxiv.org/catchup/math.NA/2026-09-01?abs=True (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).