arxiv: 2605.14157 · v1 · submitted 2026-05-13 · 🧮 math.NA · cs.NA

Recognition: 1 theorem link

· Lean Theorem

Classification of Double Saddle-Point Systems

Susanne Bradley , Chen Greif

Authors on Pith no claims yet

Pith reviewed 2026-05-15 01:52 UTC · model grok-4.3

classification 🧮 math.NA cs.NA

keywords double saddle-point systemsblock-arrow matricesblock-tridiagonal matricespreconditionersspectral propertiesnumerical linear algebrasymmetric indefinite systems

0 comments

The pith

Symmetric double saddle-point systems divide into block-arrow and block-tridiagonal matrix forms that control their invertibility, spectra, and preconditioners.

A machine-rendered reading of the paper's core claim, the machinery that carries it, and where it could break.

The paper establishes a classification for a broad class of symmetric double saddle-point systems by separating their matrices into block-arrow and block-tridiagonal structures. This division is presented in a general framework that covers invertibility conditions, spectral properties, and block preconditioners without specializing to individual applications. A reader would care because these systems appear in optimization and discretized PDEs, where structure directly affects whether solvers converge and how fast they run. The classification supplies concrete conditions and preconditioner designs that follow from the two forms.

Core claim

The central claim is that symmetric double saddle-point matrices fall into block-arrow or block-tridiagonal forms, and this partition determines the relevant applications, the conditions for nonsingularity, the spectral behavior, and the construction of effective block preconditioners, all within one unified framework rather than case-by-case analysis.

What carries the argument

The division of the associated matrices into block-arrow and block-tridiagonal forms, which organizes the entire discussion of invertibility, spectra, and preconditioning.

If this is right

Invertibility of the full system follows from simple conditions on the blocks once the form is identified.
Eigenvalue bounds and clustering can be derived directly from the arrow or tridiagonal block pattern.
Block preconditioners are constructed by approximating the Schur complements that arise from each structure.
The same framework covers applications ranging from constrained optimization to mixed finite-element discretizations.

Where Pith is reading between the lines

These are editorial extensions of the paper, not claims the author makes directly.

The classification may suggest analogous block patterns for non-symmetric or indefinite saddle-point problems that appear in fluid mechanics.
Numerical tests on concrete applications could check whether the predicted spectral clustering holds in floating-point arithmetic.
Software implementations could automatically detect which form a given matrix belongs to and select the matching preconditioner.

Load-bearing premise

The systems are symmetric and their matrices admit one of the two described block structures.

What would settle it

A symmetric double saddle-point matrix whose nonzero pattern matches neither the block-arrow nor the block-tridiagonal pattern would falsify the claimed classification.

Figures

Figures reproduced from arXiv: 2605.14157 by Chen Greif, Susanne Bradley.

read the original abstract

We offer a classification of a broad and practically relevant class of symmetric double saddle-point system. At the core of the paper is the division of the associated matrices into ``block-arrow'' and ``block-tridiagonal'' forms. We describe relevant applications, invertibility conditions, spectral properties, and block preconditioners. Our discussion is kept within a general framework rather than tailored to specific applications.

Editorial analysis

A structured set of objections, weighed in public.

Desk editor's note, referee report, simulated authors' rebuttal, and a circularity audit. Tearing a paper down is the easy half of reading it; the pith above is the substance, this is the friction.

Desk Editor's Note private letter to a colleague

This paper classifies symmetric double saddle-point systems by splitting their matrices into block-arrow and block-tridiagonal forms, then derives general invertibility conditions, spectral properties, and block preconditioners.

read the letter

The paper's main move is to divide symmetric double saddle-point matrices into block-arrow and block-tridiagonal structures. From that split it works out invertibility conditions, some spectral facts, and ideas for block preconditioners, all kept at a general level rather than tied to one concrete application. Applications are mentioned to show where these systems appear, which helps make the framework feel relevant to preconditioning work in optimization or fluid problems. The classification itself looks like the fresh part; once the blocks are fixed, the rest follows from standard block-matrix arguments. The writing stays clean and the framework is coherent, so the organizational contribution is real. The soft spot is that everything remains abstract. No new algorithms are proposed, no numerical tests or comparisons appear, and the spectral or preconditioning claims are not checked against existing methods in practice. This makes it harder to judge whether the taxonomy leads to better solvers or just rearranges known facts. The invertibility conditions read as routine once the structure is given, so the payoff depends on how useful the two forms turn out to be for future work. Readers already working on saddle-point preconditioners might find the reference helpful for organizing cases they already see. Someone hunting for new computational tools or application-specific results will probably come away wanting more. I would send it to peer review. The classification is presented as original, the topic sits squarely in numerical linear algebra, and the general treatment is solid enough to merit referee input even if revisions will likely add experiments or tighten the claims.

Referee Report

2 major / 3 minor

Summary. The manuscript classifies symmetric double saddle-point systems by partitioning their coefficient matrices into block-arrow and block-tridiagonal forms. It discusses relevant applications, derives invertibility conditions, examines spectral properties, and constructs block preconditioners, all within a general framework rather than for specific applications.

Significance. If the proposed classification is comprehensive and the derived results on invertibility and spectra hold, this work would offer a valuable unified approach to analyzing and preconditioning a wide class of saddle-point problems common in numerical PDEs, optimization, and other fields. The general framework could facilitate the development of robust solvers.

major comments (2)

[§2] §2: The central division of matrices into block-arrow and block-tridiagonal forms is introduced without a clear statement of whether this partition is exhaustive or if there exist symmetric double saddle-point systems that do not fit either structure. This is load-bearing for the classification claim.
[§3] §3: The invertibility conditions in the block-tridiagonal case (around Eq. (8)) are stated but the proof relies on an assumption of positive definiteness of a principal submatrix that may not hold in all symmetric indefinite cases typical for saddle-point problems.

minor comments (3)

[Abstract] Abstract: The abstract mentions 'relevant applications' but does not specify them; listing one or two would improve clarity.
[§4] §4: The spectral properties discussion would benefit from a numerical example or table comparing eigenvalues for the two forms.
[References] References: Some standard references on saddle-point problems (e.g., on block preconditioners) appear to be missing.

Simulated Author's Rebuttal

2 responses · 0 unresolved

We thank the referee for the careful reading and constructive feedback on our manuscript. We address the major comments point by point below, providing clarifications and indicating where revisions will be made to improve the presentation.

read point-by-point responses

Referee: [§2] §2: The central division of matrices into block-arrow and block-tridiagonal forms is introduced without a clear statement of whether this partition is exhaustive or if there exist symmetric double saddle-point systems that do not fit either structure. This is load-bearing for the classification claim.

Authors: We appreciate the referee drawing attention to this point. The manuscript presents a classification for a broad and practically relevant class of symmetric double saddle-point systems, specifically those whose nonzero blocks follow either the block-arrow or block-tridiagonal pattern. These two structures are the ones that arise most frequently in applications (e.g., from mixed finite-element discretizations of PDEs and certain constrained optimization problems). We do not claim that every conceivable symmetric double saddle-point matrix must fit exactly one of these two forms; other block arrangements are possible in principle, though they are less common and can often be reduced to one of the considered patterns via symmetric permutation. To remove any ambiguity, we will revise §2 to include an explicit statement clarifying the scope of the classification and noting that systems outside these two sparsity patterns lie beyond the framework developed here. revision: yes
Referee: [§3] §3: The invertibility conditions in the block-tridiagonal case (around Eq. (8)) are stated but the proof relies on an assumption of positive definiteness of a principal submatrix that may not hold in all symmetric indefinite cases typical for saddle-point problems.

Authors: The referee is correct that the invertibility argument for the block-tridiagonal case invokes positive definiteness of a leading principal submatrix. This hypothesis is part of the standard setup for well-posed saddle-point problems, where the (1,1) block typically inherits positive definiteness from the underlying coercive bilinear form. Nevertheless, we agree that the presentation would benefit from greater transparency. We will revise the text around Eq. (8) to list the positive-definiteness assumption explicitly as a hypothesis, add a short remark discussing its validity in typical applications, and briefly indicate how the result would need to be modified if the submatrix were only semidefinite or indefinite. revision: partial

Circularity Check

0 steps flagged

No significant circularity; classification is self-contained

full rationale

The paper organizes symmetric double saddle-point systems by partitioning matrices into block-arrow and block-tridiagonal forms as its core organizing principle, then derives invertibility conditions, spectral properties, and block preconditioners inside that general framework. No load-bearing step reduces by construction to a fitted parameter, self-definition, or self-citation chain; the block forms are presented as the definitional structure of the class under study rather than a derived prediction. The discussion stays within stated assumptions without renaming known results or smuggling ansatzes via prior self-citations. This is the normal honest outcome for a classification paper whose central contribution is the taxonomy itself.

Axiom & Free-Parameter Ledger

0 free parameters · 1 axioms · 0 invented entities

Only abstract available; no explicit free parameters, invented entities, or non-standard axioms are described. Relies on standard properties of symmetric matrices and saddle-point systems from linear algebra.

axioms (1)

standard math Symmetric matrices admit standard spectral and invertibility properties from linear algebra
Invoked implicitly for the classification of double saddle-point systems.

pith-pipeline@v0.9.0 · 5339 in / 1037 out tokens · 42762 ms · 2026-05-15T01:52:54.804514+00:00 · methodology

discussion (0)

Lean theorems connected to this paper

Citations machine-checked in the Pith Canon. Every link opens the source theorem in the public Lean library.

IndisputableMonolith/Cost/FunctionalEquation.lean; IndisputableMonolith/Foundation/DimensionForcing.lean; IndisputableMonolith/Foundation/ArithmeticFromLogic.lean reality_from_one_distinction; washburn_uniqueness_aczel; Jcost_pos_of_ne_one unclear

?

unclear
Relation between the paper passage and the cited Recognition theorem.

At the core of the paper is the division of the associated matrices into “block-arrow” and “block-tridiagonal” forms... Definition 2... family S3... block-LDL decompositions... eigenvalue bounds via R-matrix method

What do these tags mean?

matches: The paper's claim is directly supported by a theorem in the formal canon.
supports: The theorem supports part of the paper's argument, but the paper may add assumptions or extra steps.
extends: The paper goes beyond the formal theorem; the theorem is a base layer rather than the whole result.
uses: The paper appears to rely on the theorem as machinery.
contradicts: The paper's claim conflicts with a theorem or certificate in the canon.
unclear: Pith found a possible connection, but the passage is too broad, indirect, or ambiguous to say the theorem truly supports the claim.

Reference graph

Works this paper leans on

86 extracted references · 86 canonical work pages

[1]

Adler, Thomas R

James H. Adler, Thomas R. Benson, Eric C. Cyr, Patrick E. Farrell, Scott P. MacLachlan, and Ray S. Tuminaro. Monolithic multigrid meth- ods for magnetohydrodynamics.SIAM Journal on Scientific Computing, 43(5):S70–S91, 2021

work page 2021
[2]

Safique Ahmad and Pinki Khatun

Sk. Safique Ahmad and Pinki Khatun. Partial condition numbers for double saddle point problems.Numerical Algorithms, 2025

work page 2025
[3]

Safique Ahmad and Pinki Khatun

Sk. Safique Ahmad and Pinki Khatun. A class of generalized shift-splitting preconditioners for double saddle point problems.Applied Mathematics and Computation, 509:129658, 2026

work page 2026
[4]

Ali Beik and M

F. Ali Beik and M. Benzi. Iterative methods for double saddle point sys- tems.SIAM Journal on Matrix Analysis and Applications, 39(2):902–921, 2018

work page 2018
[5]

Antonietti, Jacopo De Ponti, Luca Formaggia, and Anna Scotti

Paola F. Antonietti, Jacopo De Ponti, Luca Formaggia, and Anna Scotti. Preconditioning techniques for the numerical solution of flow in fractured porous media.Journal of Scientific Computing, 86(1):2, 2020

work page 2020
[6]

Two block preconditioners for a class of double saddle point linear systems

Fariba Bakrani Balani, Masoud Hajarian, and Luca Bergamaschi. Two block preconditioners for a class of double saddle point linear systems. Applied Numerical Mathematics, 190:155–167, 2023

work page 2023
[7]

Two block preconditioners for a class of double saddle point linear systems

Fariba Bakrani Balani, Masoud Hajarian, and Luca Bergamaschi. Two block preconditioners for a class of double saddle point linear systems. Preprint, 2024

work page 2024
[8]

M. A. Barrientos, G. N. Gatica, and E. P. Stephan. A mixed finite element method for nonlinear elasticity: two-fold saddle point approach and a- posteriori error estimate.Numerische Mathematik, 89(2):269–305, 2001. 33

work page 2001
[9]

Robust precondition- ers for multiple saddle point problems and applications to optimal control problems.SIAM Journal on Matrix Analysis and Applications, 41(4):1590– 1615, 2020

Alexander Beigl, Jarle Sogn, and Walter Zulehner. Robust precondition- ers for multiple saddle point problems and applications to optimal control problems.SIAM Journal on Matrix Analysis and Applications, 41(4):1590– 1615, 2020

work page 2020
[10]

Fatemeh P. A. Beik and Michele Benzi. Iterative methods for double sad- dle point systems.SIAM Journal on Matrix Analysis and Applications, 39(2):902–921, 2018

work page 2018
[11]

Beik, Chen Greif, and Manfred Trummer

Fatemeh P.A. Beik, Chen Greif, and Manfred Trummer. On the invertibility of matrices with a double saddle-point structure.Linear Algebra and its Applications, 699:403–420, 2024

work page 2024
[12]

Block preconditioners for sad- dle point systems arising from liquid crystal directors modeling.Calcolo, 55(3):1–16, September 2018

Fatemeh Panjeh Beik and Michele Benzi. Block preconditioners for sad- dle point systems arising from liquid crystal directors modeling.Calcolo, 55(3):1–16, September 2018

work page 2018
[13]

Springer International Publishing, Cham, 2019

Michele Benzi and Fatemeh Panjeh Ali Beik.Uzawa-Type and Augmented Lagrangian Methods for Double Saddle Point Systems, pages 215–236. Springer International Publishing, Cham, 2019

work page 2019
[14]

Golub, and J¨ org Liesen

Michele Benzi, Gene H. Golub, and J¨ org Liesen. Numerical solution of saddle point problems.Acta Numerica, 14:1–137, 2005

work page 2005
[15]

Bergamaschi, A

L. Bergamaschi, A. Martinez, J. W. Pearson, and A. Potschka. Eigenvalue bounds for preconditioned symmetric multiple saddle-point matrices, 2025

work page 2025
[16]

Triangular preconditioners for double saddle point lin- ear systems arising in the mixed form of poroelasticity equations.arXiv e-prints, 2025

Luca Bergamaschi. Triangular preconditioners for double saddle point lin- ear systems arising in the mixed form of poroelasticity equations.arXiv e-prints, 2025

work page 2025
[17]

Eigenvalue bounds for sym- metric, multiple saddle-point matrices with spd preconditioners.Preprints, February 2026

Luca Bergamaschi and Michele Bergamaschi. Eigenvalue bounds for sym- metric, multiple saddle-point matrices with spd preconditioners.Preprints, February 2026

work page 2026
[18]

Trian- gular preconditioners for double saddle point linear systems arising in the mixed form of poroelasticity equations, 05 2025

Luca Bergamaschi, Massimiliano Ferronato, and Angeles Martinez. Trian- gular preconditioners for double saddle point linear systems arising in the mixed form of poroelasticity equations, 05 2025

work page 2025
[19]

Pearson, and Andreas Potschka

Luca Bergamaschi, ´Angeles Mart´ ınez, John W. Pearson, and Andreas Potschka. Spectral analysis of block preconditioners for double saddle- point linear systems with application to PDE-constrained optimization. Computational Optimization and Applications, 91:423–455, 2025

work page 2025
[20]

Pearson, and Andreas Potschka

Luca Bergamaschi, ´Angeles Mart´ ınez, John W. Pearson, and Andreas Potschka. Spectral analysis of block preconditioners for double saddle-point linear systems with application to pde-constrained optimization.Compu- tational Optimization and Applications, 2024. 34

work page 2024
[21]

Society for Industrial and Applied Mathematics, Philadelphia, PA, 2024

Ake Bj¨ orck.Numerical Methods for Least Squares Problems, Second Edi- tion. Society for Industrial and Applied Mathematics, Philadelphia, PA, 2024

work page 2024
[22]

PhD thesis, University of British Columbia, 2022

Susanne Bradley.Analysis and Preconditioning of Double Saddle-Point Systems. PhD thesis, University of British Columbia, 2022

work page 2022
[23]

Eigenvalue bounds for double saddle- point systems.IMA Journal of Numerical Analysis, 43(6):3564–3592, 12 2022

Susanne Bradley and Chen Greif. Eigenvalue bounds for double saddle- point systems.IMA Journal of Numerical Analysis, 43(6):3564–3592, 12 2022

work page 2022
[24]

Schur complement based pre- conditioners for twofold and block tridiagonal saddle point problems

Mingchao Cai, Guoliang Ju, and Jingzhi Li. Schur complement based pre- conditioners for twofold and block tridiagonal saddle point problems. 2021. https://arxiv.org/abs/2108.08332

work page arXiv 2021
[25]

Preconditioning techniques for a mixed Stokes/Darcy model in porous media applications.Journal of Computational and Applied Mathematics, 233(2):346 – 355, 2009

Mingchao Cai, Mo Mu, and Jinchao Xu. Preconditioning techniques for a mixed Stokes/Darcy model in porous media applications.Journal of Computational and Applied Mathematics, 233(2):346 – 355, 2009

work page 2009
[26]

Shift-splitting preconditioners for a class of block three-by-three saddle point problems.Applied Mathematics Letters, 96:40–46, 2019

Yang Cao. Shift-splitting preconditioners for a class of block three-by-three saddle point problems.Applied Mathematics Letters, 96:40–46, 2019

work page 2019
[27]

Scalable algo- rithms for three-field mixed finite element coupled poromechanics.Journal of Computational Physics, 327:894–918, 2016

Nicola Castelletto, Jacob White, and Massimo Ferronato. Scalable algo- rithms for three-field mixed finite element coupled poromechanics.Journal of Computational Physics, 327:894–918, 2016

work page 2016
[28]

Modified restrictive preconditioners for dou- ble saddle point problems arising from liquid crystal director modeling

Fang Chen and Shu-Ru He. Modified restrictive preconditioners for dou- ble saddle point problems arising from liquid crystal director modeling. Computational and Applied Mathematics, 43(1):60, 2024

work page 2024
[29]

On preconditioning of double saddle point linear systems arising from liquid crystal director modeling.Applied Math- ematics Letters, 136:108445, 2023

Fang Chen and Bi-Cong Ren. On preconditioning of double saddle point linear systems arising from liquid crystal director modeling.Applied Math- ematics Letters, 136:108445, 2023

work page 2023
[30]

Prince Chidyagwai, Scott Ladenheim, and Daniel B. Szyld. Constraint preconditioning for the coupled Stokes–Darcy system.SIAM Journal on Scientific Computing, 38(2):A668–A690, 2016

work page 2016
[31]

A practical factorization of a Schur complement for PDE-constrained dis- tributed optimal control.Journal of Scientific Computing, 65:576–597, 11 2015

Youngsoo Choi, Charbel Farhat, Walter Murray, and Michael Saunders. A practical factorization of a Schur complement for PDE-constrained dis- tributed optimal control.Journal of Scientific Computing, 65:576–597, 11 2015

work page 2015
[32]

Navier-Stokes/Darcy coupling: modeling, analysis, and numerical approximation.Revista Matem´ atica Complutense, 22(2):315–426, 2009

Marco Discacciati and Alfio Quarteroni. Navier-Stokes/Darcy coupling: modeling, analysis, and numerical approximation.Revista Matem´ atica Complutense, 22(2):315–426, 2009

work page 2009
[33]

A class of block alternating splitting im- plicit iteration methods for double saddle point linear systems.Numerical Linear Algebra with Applications, 30(1):e2455, 2023

Yan Dou and Zhao-Zheng Liang. A class of block alternating splitting im- plicit iteration methods for double saddle point linear systems.Numerical Linear Algebra with Applications, 30(1):e2455, 2023. 35

work page 2023
[34]

A method of finite element tear- ing and interconnecting and its parallel solution algorithm.International journal for numerical methods in engineering, 32(6):1205–1227, 1991

Charbel Farhat and Francois-Xavier Roux. A method of finite element tear- ing and interconnecting and its parallel solution algorithm.International journal for numerical methods in engineering, 32(6):1205–1227, 1991

work page 1991
[35]

Tchelepi

Massimiliano Ferronato, Andrea Franceschini, Carlo Janna, Nicola Castel- letto, and Hamdi A. Tchelepi. A general preconditioning framework for coupled multiphysics problems with application to contact- and poro- mechanics.Journal of Computational Physics, 398:108887, 2019

work page 2019
[36]

A fully coupled 3D mixed finite element model of biot consolidation.Journal of Computational Physics, 229(12):4813–4830, 2010

Massimo Ferronato, Nicola Castelletto, and Giuseppe Gambolati. A fully coupled 3D mixed finite element model of biot consolidation.Journal of Computational Physics, 229(12):4813–4830, 2010

work page 2010
[37]

Friedlander and Dominique Orban

Michael P. Friedlander and Dominique Orban. A primal–dual regularized interior-point method for convex quadratic programs.Mathematical Pro- gramming Computation, 4(1):71–107, Mar 2012

work page 2012
[38]

Gartland and Alison Ramage

Eugene C. Gartland and Alison Ramage. A renormalized newton method for liquid crystal director modeling.SIAM Journal on Numerical Analysis, 53(1):251–278, 2015

work page 2015
[39]

G. N. Gatica and N. Heuer. Conjugate gradient method for dual-dual mixed formulations.Mathematics of Computation, 71(240):1455–1472, 2002

work page 2002
[40]

G. N. Gatica, N. Heuer, and S. Meddahi. On the numerical analysis of non- linear twofold saddle point problems.IMA Journal of Numerical Analysis, 23(2):301–330, 2003

work page 2003
[41]

G. N. Gatica and S. Meddahi. A dual-dual mixed formulation for nonlinear exterior transmission problems.Mathematics of Computation, 70(236):1461–1480, 2000

work page 2000
[42]

Conjugate gradient method for dual- dual mixed formulations.Mathematics of Computation, 71, 07 2000

Gabriel Gatica and Norbert Heuer. Conjugate gradient method for dual- dual mixed formulations.Mathematics of Computation, 71, 07 2000

work page 2000
[43]

A dual-dual formulation for the cou- pling of mixed-FEM and BEM in hyperelasticity.SIAM Journal on Nu- merical Analysis, 38:380–400, July 2000

Gabriel Gatica and Norbert Heuer. A dual-dual formulation for the cou- pling of mixed-FEM and BEM in hyperelasticity.SIAM Journal on Nu- merical Analysis, 38:380–400, July 2000

work page 2000
[44]

Gatica and Norbert Heuer

Gabriel N. Gatica and Norbert Heuer. An expanded mixed finite element approach via a dual-dual formulation and the minimum residual method. Journal of Computational and Applied Mathematics, 132(2):371 – 385, 2001

work page 2001
[45]

A BFBt preconditioner for double saddle-point systems, 2026

Chen Greif. A BFBt preconditioner for double saddle-point systems, 2026

work page 2026
[46]

Block preconditioners for the Marker-and- Cell discretization of the stokes–darcy equations.SIAM Journal on Matrix Analysis and Applications, 44(4):1540–1565, 2023

Chen Greif and Yunhui He. Block preconditioners for the Marker-and- Cell discretization of the stokes–darcy equations.SIAM Journal on Matrix Analysis and Applications, 44(4):1540–1565, 2023. 36

work page 2023
[47]

Bounds on eigenvalues of matrices arising from interior-point methods.SIAM Journal on Opti- mization, 24(1):49–83, 2014

Chen Greif, Erin Moulding, and Dominique Orban. Bounds on eigenvalues of matrices arising from interior-point methods.SIAM Journal on Opti- mization, 24(1):49–83, 2014

work page 2014
[48]

Robust pre- conditioning for coupled Stokes-Darcy problems with the Darcy problem in primal form.Comput

Karl Erik Holter, Miroslav Kuchta, and Kent-Andre Mardal. Robust pre- conditioning for coupled Stokes-Darcy problems with the Darcy problem in primal form.Comput. Math. Appl., 91:53–66, 2021

work page 2021
[49]

Howell and Noel J

Jason S. Howell and Noel J. Walkington. Inf–sup conditions for twofold saddle point problems.Numerische Mathematik, 118(4):663–693, August 2011

work page 2011
[50]

Spectral analysis of the preconditioned system for the 3×3 block saddle point problem.Numer

Na Huang and Chang-Feng Ma. Spectral analysis of the preconditioned system for the 3×3 block saddle point problem.Numer. Algorithms, 81(2):421–444, jun 2019

work page 2019
[51]

Ilse C. F. Ipsen. A note on preconditioning nonsymmetric matrices.SIAM J. Sci. Comput., 23(3):1050–1051, 2001

work page 2001
[52]

Augmented Lagrangian–SQP methods for nonlinear optimal control problems of tracking type.SIAM journal on control and optimization, 34(3):874–891, 1996

Kazufumi Ito and Karl Kunisch. Augmented Lagrangian–SQP methods for nonlinear optimal control problems of tracking type.SIAM journal on control and optimization, 34(3):874–891, 1996

work page 1996
[53]

A robust fem-bem solver for time- harmonic eddy current problems

Michael Kolmbauer and Ulrich Langer. A robust fem-bem solver for time- harmonic eddy current problems. In Randolph Bank, Michael Holst, Olof Widlund, and Jinchao Xu, editors,Domain Decomposition Methods in Science and Engineering XX, pages 297–304, Berlin, Heidelberg, 2013. Springer Berlin Heidelberg

work page 2013
[54]

Kouri, Denis Ridzal, and Ray Tuminaro

Drew P. Kouri, Denis Ridzal, and Ray Tuminaro. KKT preconditioners for PDE-constrained optimization with the Helmholtz equation.SIAM Journal on Scientific Computing, 43(5):S225–S248, 2021

work page 2021
[55]

Langer, G

U. Langer, G. Of, O. Steinbach, and W. Zulehner. Inexact data-sparse boundary element tearing and interconnecting methods.SIAM Journal on Scientific Computing, 29(1):290–314, 2007

work page 2007
[56]

A modified new matrix splitting preconditioner for double saddle point problems.Japan Journal of Industrial and Applied Mathematics, 41(1):85–103, 2024

Jun Li. A modified new matrix splitting preconditioner for double saddle point problems.Japan Journal of Industrial and Applied Mathematics, 41(1):85–103, 2024

work page 2024
[57]

Jun Li, Kailiang Xin, and Lingsheng Meng. A block upper triangular split- ting method for solving block three-by-three linear systems arising from the large indefinite least squares problem.Applied Mathematics and Com- putation, 505:129546, 2025

work page 2025
[58]

Alternating positive semidefi- nite splitting preconditioners for double saddle point problems.Calcolo, 56(3):26, 2019

Zhao-Zheng Liang and Guo-Feng Zhang. Alternating positive semidefi- nite splitting preconditioners for double saddle point problems.Calcolo, 56(3):26, 2019. 37

work page 2019
[59]

On the improvement of shift- splitting preconditioners for double saddle point problems.Journal of Ap- plied Mathematics and Computing, 70:1339–1363, 2024

Zhao-Zheng Liang and Mu-Zheng Zhu. On the improvement of shift- splitting preconditioners for double saddle point problems.Journal of Ap- plied Mathematics and Computing, 70:1339–1363, 2024

work page 2024
[60]

SIAM, 1972

Jacques-Louis Lions.Some aspects of the optimal control of distributed parameter systems. SIAM, 1972

work page 1972
[61]

Preconditioning discretizations of systems of partial differential equations.Acta Numerica, 20:1–64, 2011

Kent-Andr´ e Mardal and Ragnar Winther. Preconditioning discretizations of systems of partial differential equations.Acta Numerica, 20:1–64, 2011

work page 2011
[62]

The generation and compaction of partially molten rock

DAN McKenzie. The generation and compaction of partially molten rock. Journal of petrology, 25(3):713–765, 1984

work page 1984
[63]

L. Meng, Y. He, and J. Li. A generalized simplified hermitian and skew- hermitian splitting preconditioner for double saddle point problems.Com- putational Mathematics and Mathematical Physics, 63(5):704–718, 2023

work page 2023
[64]

Lingsheng Meng, Jun Li, and Shu-Xin Miao. A variant of relaxed alternat- ing positive semi-definite splitting preconditioner for double saddle point problems.Japan Journal of Industrial and Applied Mathematics, 38(3):979– 998, 2021

work page 2021
[65]

Murphy, Gene H

Malcolm F. Murphy, Gene H. Golub, and Andrew J. Wathen. A note on preconditioning for indefinite linear systems.SIAM J. Sci. Comput., 21(6):1969–1972, 2000

work page 1969
[66]

Wright.Numerical Optimization

Jorge Nocedal and Stephen J. Wright.Numerical Optimization. Springer series in operations research and financial engineering. Springer, New York, NY, 2. ed. edition, 2006

work page 2006
[67]

On symmetric positive definite preconditioners for multiple saddle-point systems.IMA Journal of Numer- ical Analysis, 44(3):1731–1750, 08 2023

John W Pearson and Andreas Potschka. On symmetric positive definite preconditioners for multiple saddle-point systems.IMA Journal of Numer- ical Analysis, 44(3):1731–1750, 08 2023

work page 2023
[68]

Pearson and Andreas Potschka

John W. Pearson and Andreas Potschka. Double saddle-point precondi- tioning for Krylov methods in the inexact sequential homotopy method. Numerical Linear Algebra with Applications, 31(4):e2553, 2024

work page 2024
[69]

Pearson and Andrew J

John W. Pearson and Andrew J. Wathen. A new approximation of the Schur complement in preconditioners for PDE-constrained optimization. Numerical Linear Algebra with Applications, 19(5):816–829, 2012

work page 2012
[70]

Spectral analy- sis of block diagonally preconditioned multiple saddle-point matrices with inexact Schur complements, 2026

Marco Pilotto, Luca Bergamaschi, and Angeles Martinez. Spectral analy- sis of block diagonally preconditioned multiple saddle-point matrices with inexact Schur complements, 2026

work page 2026
[71]

Tesi doctoral, UPC, Escola T` ecnica Superior d’Enginyers de Camins, Canals i Ports de Barcelona, November 2013

Ramon Planas Badenas.Stabilized finite element formulations for solving incompressible magnetohydrodynamics. Tesi doctoral, UPC, Escola T` ecnica Superior d’Enginyers de Camins, Canals i Ports de Barcelona, November 2013. 38

work page 2013
[72]

Gartland, Jr

Alison Ramage and Eugene C. Gartland, Jr. A preconditioned nullspace method for liquid crystal director modeling.SIAM J. Sci. Comput., 35(1):B226–B247, 2013

work page 2013
[73]

Sue Dollar, and Andrew J

Tyrone Rees, H. Sue Dollar, and Andrew J. Wathen. Optimal solvers for PDE-constrained optimization.SIAM Journal on Scientific Computing, 32(1):271–298, 2010

work page 2010
[74]

Improved splitting pre- conditioner for double saddle point problems arising from liquid crystal director modeling.Numerical Algorithms, 91(3):1363–1379, 2022

Bi-Cong Ren, Fang Chen, and Xiao-Liang Wang. Improved splitting pre- conditioner for double saddle point problems arising from liquid crystal director modeling.Numerical Algorithms, 91(3):1363–1379, 2022

work page 2022
[75]

Wells, Andrew J

Sander Rhebergen, Garth N. Wells, Andrew J. Wathen, and Richard F. Katz. Three-field block preconditioners for models of coupled magma/mantle dynamics.SIAM Journal on Scientific Computing, 37(5):A2270–A2294, 2015

work page 2015
[76]

Rusten and R

T. Rusten and R. Winther. A preconditioned iterative method for saddle- point problems.SIAM J. Matrix Anal. Appl., 13:887–904, 1992

work page 1992
[77]

Symmetric indefinite precondition- ers for saddle point problems with applications to PDEs.SIAM Journal on Matrix Analysis and Applications, 29(3):752–773, 2007

Joachim Sch¨ oberl and Walter Zulehner. Symmetric indefinite precondition- ers for saddle point problems with applications to PDEs.SIAM Journal on Matrix Analysis and Applications, 29(3):752–773, 2007

work page 2007
[78]

Fast iterative solution of stabilised Stokes systems part II: Using general block preconditioners.SIAM Journal on Numerical Analysis, 31(5):1352–1367, 1994

David Silvester and Andrew Wathen. Fast iterative solution of stabilised Stokes systems part II: Using general block preconditioners.SIAM Journal on Numerical Analysis, 31(5):1352–1367, 1994

work page 1994
[79]

Schur complement preconditioners for multiple saddle point problems of block tridiagonal form with application to optimization problems.arXiv e-prints, 2017

Jarle Sogn and Walter Zulehner. Schur complement preconditioners for multiple saddle point problems of block tridiagonal form with application to optimization problems.arXiv e-prints, 2017

work page 2017
[80]

Jarle Sogn and Walter Zulehner. Schur complement preconditioners for multiple saddle point problems of block tridiagonal form with application to optimization problems.IMA Journal of Numerical Analysis, 39(3):1328– 1359, 05 2018

work page 2018

Showing first 80 references.