带多个半定惩罚项的参数鲁棒子空间校正
Parameter-Robust Subspace Correction with Multiple Semidefinite Penalties
- The Australian National University（澳大利亚国立大学）
机构由 AI 辅助整理，请以论文原文为准。
AI总结：
该研究刻画了带多个半定惩罚项的参数鲁棒子空间校正预条件子的有效条件，给出了条件不满足时的特征值衰减规律，经计算和Scott-Vogelius实验验证了结论。
AI中文摘要：
增广拉格朗日和约束公式中会出现独立加权的半定惩罚项。本文刻画了在固定有限维空间上，精确加性子空间校正预条件子对所有非负惩罚权重保持一致有效的条件：当且仅当校正空间可分解非空惩罚子集生成的每个联合核时，鲁棒性成立。若某一条件不满足，可计算常数将确定关联参数射线上最小预条件特征值的精确一阶衰减，且条件数呈线性增长；一般而言，无法丢弃任何一个子集条件。滤波分解可给出参数有序锥的可计算充分界，而分配核格则允许单一公共分裂。精确加性计算验证了该刻画及预测速率，独立的Scott-Vogelius实验在测试的权重和网格水平下产生了稳定的多重网格迭代次数，但该分析未确立网格一致性。
英文摘要：
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.
