Partial Condition Numbers for Double Saddle Point Problems
Fuente:
arXiv
Gespeichert in:
| Hauptverfasser: | , |
|---|---|
| Format: | Preprint |
| Veröffentlicht: |
2025
|
| Schlagworte: | |
| Online-Zugang: | |
| Tags: |
Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
|
| _version_ | 1866909649717952512 |
|---|---|
| author | Ahmad, Sk. Safique Khatun, Pinki |
| author_facet | Ahmad, Sk. Safique Khatun, Pinki |
| contents | This paper presents a unified framework for investigating the partial condition number (CN) of the solution of double saddle point problems (DSPPs) and provides closed-form expressions for it. This unified framework encompasses the well-known partial normwise CN (NCN), partial mixed CN (MCN) and partial componentwise CN (CCN) as special cases. Furthermore, we derive sharp upper bounds for the partial NCN, MCN and CCN, which are computationally efficient and free of expensive Kronecker products. By applying perturbations that preserve the structure of the block matrices of the DSPPs, we analyze the structured partial NCN, MCN and CCN when the block matrices exhibit linear structures. By leveraging the relationship between DSPP and equality constrained indefinite least squares (EILS) problems, we recover the partial CNs for the EILS problem. Numerical results confirm the sharpness of the derived upper bounds and demonstrate their effectiveness in estimating the partial CNs. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2502_19792 |
| institution | arXiv |
| publishDate | 2025 |
| record_format | arxiv |
| spellingShingle | Partial Condition Numbers for Double Saddle Point Problems Ahmad, Sk. Safique Khatun, Pinki Numerical Analysis 15A12, 65F20, 65F35, 65F99 This paper presents a unified framework for investigating the partial condition number (CN) of the solution of double saddle point problems (DSPPs) and provides closed-form expressions for it. This unified framework encompasses the well-known partial normwise CN (NCN), partial mixed CN (MCN) and partial componentwise CN (CCN) as special cases. Furthermore, we derive sharp upper bounds for the partial NCN, MCN and CCN, which are computationally efficient and free of expensive Kronecker products. By applying perturbations that preserve the structure of the block matrices of the DSPPs, we analyze the structured partial NCN, MCN and CCN when the block matrices exhibit linear structures. By leveraging the relationship between DSPP and equality constrained indefinite least squares (EILS) problems, we recover the partial CNs for the EILS problem. Numerical results confirm the sharpness of the derived upper bounds and demonstrate their effectiveness in estimating the partial CNs. |
| title | Partial Condition Numbers for Double Saddle Point Problems |
| topic | Numerical Analysis 15A12, 65F20, 65F35, 65F99 |
| url | https://arxiv.org/abs/2502.19792 |