OpenAlex ·

Parameter-Robust Subspace Correction with Multiple Semidefinite Penalties

Subhransu S. Bhattacharjee

Published
Source
OpenAlex
DOI
10.48550/arxiv.2608.30265
Original
Read it at the publisher
Topics
Computational ComplexityNumerical AnalysisComputational Physics

Abstract

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.

The authors’ abstract, as arXiv lists it. arXiv’s listings, abstracts included, are free for anyone to reuse.

Read it on ReadSearch

Each opens after you create an account, and brings you back to this paper.

Already a reader? Sign in

All new papers in Computational Complexity

Get the few papers worth your time in Computational Complexity every morning.

ReadSearch reads the new papers in your field each day and brings you the few worth reading, each with its key finding in a sentence.

Papers belong to their authors and publishers; every page here links to the original. All research topics