WorksMathematics
A unified variational framework for augmented Lagrangian preconditioning of saddle point systems: applications to mixed-dimensional and fictitious domain methods
Abstract
We present a general framework to derive augmented Lagrangian preconditioners for saddle point systems arising from mixed finite element discretizations. Our approach is based on augmenting the variational formulation at the continuous level prior to discretization, providing a unified strategy for designing efficient preconditioners that are robust under mesh refinement for a broad class of problems leading to symmetric saddle point systems. The robustness of the proposed preconditioners is established through a detailed spectral analysis. This framework is applied to different model problems, focusing on mixed-dimensional and fictitious domain formulations involving Lagrange multipliers, with some configurations featuring large coefficient jumps. Extensive numerical experiments on different test cases and geometries are presented, validating the effectiveness and robustness of our preconditioners when used in conjunction with flexible GMRES.
Introduction
The mathematical modeling of many physical and engineering problems leads to systems of partial differential equations subject to constraints. A classical approach to the treatment of such constraints consists in introducing Lagrange multipliers, which enforce the constraints in a weak sense within the variational formulation. After discretization with inf-sup stable elements, this procedure gives rise to algebraic saddle point systems of the form
where is the discretization of the constraint operator, and denotes the vector of coefficients associated with the Lagrange multiplier. Besides enforcing the constraints, the multiplier often has a direct physical interpretation and its computation is therefore of independent interest.
Examples of fields where these large-scale saddle point problems naturally arise include computational fluid dynamics, constrained optimization, contact mechanics, optimal control, and many others. In recent years, mixed-dimensional models, in which the constraint operator couples problems posed on domains of different dimensionality, have gained increasing attention [29, 18, 19], as have fictitious domain methods, which give rise to a particularly challenging and relevant class of saddle
Funding: MF and LH acknowledge support of the European Research Council (ERC) under the European Union’s Horizon 2020 research and innovation programme (call HORIZON-EUROHPC-JU-2023-COE-03, grant agreement No. 101172493 ”dealii-X”). The authors thank the Barcelona Supercomputing Center for the computational resources made available through the EuroHPC project EHPC-DEV-2026D02-275. The authors are members of Gruppo Nazionale per il Calcolo Scientifico (GNCS), Istituto Nazionale di Alta Matematica (INdAM). point problems [24, 15, 16]. Rather than constructing a body-fitted mesh conforming to a geometrically complex or evolving physical domain, these methods embed the geometry of interest into a simpler background domain that can be meshed independently, often by means of a structured grid. The interaction between the physical and background domains is then enforced weakly through a Lagrange multiplier field, resulting in a saddle point formulation. Depending on the support of the multiplier, one distinguishes between distributed Lagrange multiplier (DLM) formulations, where the constraint is imposed through volumetric integrals, and boundary Lagrange multiplier (BLM) formulations, where the multiplier is defined only on the lower-dimensional interface between the background and immersed domains. Fictitious domain methods based on distributed Lagrange multipliers have been successfully employed for elliptic interface problems [3, 16, 1] as a preliminary step to study fluid-structure interaction problems [15]. The resulting algebraic systems exhibit an intricate structure. In particular, the use of independent grids for the physical and background domains requires the assembly of coupling operators that encode interactions between basis functions supported on non-matching and possibly overlapping meshes [14, 13]. As a consequence, the off-diagonal block in (1) couples discrete spaces defined on different meshes, leading to saddle point systems whose analysis and implementation are considerably more challenging than in standard boundary-fitted settings.
We cast all the problems discussed above into the following abstract framework, which we borrow from [17]. For a Hilbert space , we denote by its dual and by the duality pairing, where the subscript indicates the spaces to which the first and second arguments belong. We denote by the inner product on . Let , , and be real Hilbert spaces such that
is a Gelfand triple, with dense and continuous embeddings, where is identified with its dual. This structure allows us to identify the duality pairing with the inner product of whenever the second argument belongs to , i.e., for all and .
Let be a continuous bilinear form and a continuous linear operator. We consider the following classical variational formulation: for and , find such that
It is well known that Problem (2) is well-posed if is coercive on the kernel and is surjective [12].
The finite element approximation with and yields the discrete problem4: find such that
Classical results on saddle point problems [12] show that problem (3) is uniquely solvable if there exist mesh-independent positive constants and such that
where .
Motivation and main contributions
Owing to the ubiquitous nature of large and sparse saddle point systems whose conditioning may deteriorate under mesh refinement and with variations in the physical and model parameters, a large variety of iterative solvers and preconditioning techniques have been developed in the literature [35, 20, 9, 32]. Among them, augmented Lagrangian (AL) techniques have emerged as a particularly powerful strategy. The basic idea consists in replacing the original system (1.1) with the equivalent augmented formulation
where is a suitable symmetric positive definite (SPD) matrix and is a positive real number. An effective block triangular preconditioner is
With an appropriate choice of the matrix , increasing clusters the spectrum and often leads to convergence rates that are independent of the mesh size and remarkably robust with respect to the physical parameters. Successful applications include linearizations of the stationary Navier–Stokes equations [10, 22], as well as multiphysics problems such as the coupled Stokes-Darcy problem [5] and magnetohydrodynamic problems [30]. Even if the ideal preconditioner is replaced in practice by an inexact version, in which the diagonal blocks (or the action of their inverses) are replaced by suitable approximations, the large kernel of makes the augmented block difficult to invert efficiently. Achieving optimal complexity therefore typically requires specialized, problem-dependent multigrid methods [10, 22, 38], often based on the ideas introduced in [36]. Modified AL variants have also been proposed [11], while more general algebraic strategies were tackled in [6]. In the fictitious domain setting, we recently investigated AL preconditioners in [8, 7]; related ideas were subsequently extended to mixed-dimensional beam-solid coupling in [23]. In these works, the augmentation is introduced algebraically by modifying the discrete system as in (1.6). Although effective, this approach may require the explicit formation of , leading to a substantial computational cost and reduced sparsity of the resulting global system.
Motivated by these limitations and following the abstract theory of augmented Lagrangian formulations for mixed finite element schemes developed in [17], we directly augment the formulation (1.2) with , associated with the constraint in . Moreover, exploiting the continuous inclusion and incorporating an appropriate mesh-dependent scaling, we use as the augmentation term in the discrete formulation, employing the more practical inner product on rather than that on . The resulting augmented bilinear form, , can be directly assembled and avoids the explicit construction of the triple matrix product , preserving locality of assembly, reducing memory requirements, and facilitating the design of efficient solvers for the augmented subproblems.
This approach allows us to derive augmented formulations whose associated preconditioners admit a unified spectral analysis under the assumption that the bilinear form is symmetric and positive semidefinite. We identify general conditions on the augmentation operator ensuring favorable spectral properties of the preconditioned systems. In particular, is the matrix representation of the scaled Riesz map associated with a suitable inner product on the multiplier space.
However, unlike algebraic augmentation, modifying the variational formulation may alter the discrete solution. In some cases, as for Grad–Div stabilization with Taylor–Hood elements [26, 33], the resulting error can be shown to vanish as the mesh is refined. In such cases, the continuous augmentation asymptotically retains the properties of the algebraic augmentation while providing a more favorable framework for preconditioning. In other cases, however, the presence of a power of the mesh size in the formulation may make this error non-trivial to control. A possible alternative is to use the projected counterpart rather than , where is the -orthogonal projector onto , together with piecewise-constant multiplier spaces, when feasible [10, 22]. Indeed, we prove that the projected realization coincides with the algebraic augmentation, and therefore does not alter the discrete solution. Moreover, when piecewise-constant multiplier spaces are used, the projected term can be implemented efficiently, avoiding the computational cost of explicitly forming . A concrete example is presented in § 6.3.
We apply the resulting framework to the imposition of Dirichlet boundary conditions through Lagrange multipliers [4], BLM and DLM fictitious domain formulations [7, 8], and immersed linear elasticity, thereby unifying and extending our earlier AL preconditioners developed for fictitious domain methods [8, 7] within a common variational framework amenable to a much wider class of saddle point problems.
Outline
The remainder of the paper is organized as follows. § 2 introduces the notation, while § 3 presents the augmented formulation. The relationship between continuous and algebraic augmentation is discussed in § 4, followed by the development and spectral analysis of the AL preconditioners in § 5. § 6 reports numerical experiments aimed at validating the theoretical results and assessing the practical performance of the proposed preconditioning strategy. Finally, § 7 summarizes the main findings and outlines directions for future research.
Notation
Given an open and bounded domain , we denote by the space of square-integrable functions on , endowed with the norm induced by the inner product . Sobolev spaces are denoted by , where refers to the differentiability index and is the integrability exponent. In the case , we use the notation , with associated norm and seminorm . Dual spaces and duality pairings are denoted as in § 1. The spectrum of a matrix is indicated by , while vectors appear in boldface, e.g., . We will use the letter for the Lagrange multiplier in the weak formulation. Finally, the letter will refer to a constant independent of the discretization parameters, possibly taking different values from one formula to another.
Augmented Lagrangian formulation
We start by recalling the abstract framework developed by Boffi & Lovadina in [17] for augmented Lagrangian formulations of mixed finite element schemes. Adding the term , with , to the first equation of (2) does not change the continuous solution, since $Lu=g. in . The corresponding discrete scheme seeks such that
This is the natural augmentation, since the constraint residual is measured in the norm of the space in which takes its values. If is positive semidefinite (as will be assumed throughout), and the assumptions ensuring the well-posedness of the original problem (2) hold, then for every it can be shown that the coercivity condition (4) is automatically satisfied for the bilinear form . Hence, only the discrete inf-sup condition (5) remains to be verified [17 Section 2].
In practice, computing the inner product on may be impractical, for instance when . We therefore consider instead the inner product on . This substitution, however, requires an appropriate mesh-dependent scaling.
Following the second augmented formulation of [17 Section 3], we use with left unspecified. The spectral analysis in § 5 will determine the choice of . The resulting scheme seeks , for , such that
Throughout this section, we only assume to be positive semidefinite on , that is continuous and surjective, and that the discrete inf-sup condition (5) holds.
Since the -norm used in the augmentation is weaker than the -norm, well-posedness of (9) additionally requires the following coercivity condition [17]: there exist constants , independent of , such that
This condition is application-dependent and must be verified on a case-by-case basis.
Algebraic problem
3.1. Algebraic problem. Given basis functions and such that and , we have that Problem (3.2) can be written in matrix form as the following algebraic problem with unknowns and :
where
and denotes the augmented bilinear form.
In the next section, we will take a closer look at the augmented term , describing its finite dimensional representation in terms of known matrices.
Connection between continuous and algebraic augmentation
In this section, we show that the augmented term appearing in the augmented bilinear form , shares the same algebraic properties as the triple matrix product , where is the mass matrix defined on the multiplier space. This observation generalizes the results of [26], where the specific case of Grad-Div stabilization for the Oseen problem is considered.
This naturally raises the question of whether considering the augmented formulation in (9) is equivalent to augmenting the discrete saddle point system as in (6) with . As already observed in [26] for Grad-Div stabilization, the two approaches are generally not equivalent. Nevertheless, we will show that the term admits a decomposition into the sum of an algebraic term and a projection-type stabilization term, where the former coincides exactly with the entries of when .
We emphasize that, also in this section, we only assume to be positive semidefinite, but not necessarily symmetric.
Let be the -orthogonal projector, i.e.
For , the term can be split into the following sum:
where is the so-called fluctuation operator. By the projection property of , we have:
Following [26], we call the first summand algebraic term and the second one stabilizing term. The following lemma shows that, after moving the term to the right-hand side of the first equation in (9), the contribution can be represented as a product of known and computable matrices.
Lemma 4.1. Let be a basis of and a basis of . Let and be the following matrices, defined as:
Then,
Proof. Let be the orthogonal projection of onto with respect to the inner product , that is . Since is a basis of , we may expand as , where is the corresponding coefficient column vector. By definition of orthogonal projection,
Therefore, for each basis function we obtain
Substituting the expansion of yields . Moreover, using the definition of matrices and and letting denote the -th canonical basis vector, the system (15) can be written in matrix form as . We now compute the -entry of :
where the last equality follows from expanding both and in the basis . Finally, recalling that , we conclude that
Lemma 4.2. Let be a solution of the augmented Lagrangian formulation (9), and let solve the original problem (2). We define the augmentation residual, namely, the term by which (9) differs from (3), as
Then, the following bound holds:
In particular, if and , then .
Proof. The second equation of the augmented problem (9) gives
since and , so that the duality pairing between and can be identified with the scalar product in . Using the definition of -orthogonal projection onto (12), the relation above implies . Then, using the decomposition in (14), we obtain
which contains the stabilizing term introduced in (14). Finally, using Cauchy-Schwarz inequality and the fact that we obtain the desired bound
Remark 4.3. The above bound is clearly problem-dependent. For instance, in the context of Grad-Div stabilization, where is the divergence operator and , it was shown in [26] that, for Taylor–Hood elements, as . Whenever this occurs, we can conclude that the continuous augmentation asymptotically retains the same properties as the algebraic one, while avoiding the computational drawbacks associated with the explicit formation of . In § 5.2, we will show another illustrative example for which the stabilizing term can be proved to vanish as the mesh is refined. A further possibility is to choose, if feasible, discrete spaces satisfying . This is the case for the classic Stokes problem discretized with divergence-free pairs, such as Scott–Vogelius elements.
In the following section, we introduce the proposed AL preconditioner and provide a detailed spectral analysis that accounts for the effects of the stabilizing term arising from the continuous augmentation.
We define the symmetric positive semidefinite matrix associated with the bilinear form , i.e.
Preconditioning and spectral analysis
Using the decomposition (14) and Lemma 4.1, the matrix in (11) can be decomposed as , where and is the matrix in (17). We denote the matrix in system (11) by
By analogy with the algebraic augmentation, it is natural to consider a corresponding preconditioner of the form
We derive lower and upper bounds for the eigenvalues of the preconditioned matrix and then investigate the behavior of the smallest eigenvalue as the mesh is refined.
While eigenvalue information alone is generally insufficient to fully characterize the convergence of non-symmetric Krylov subspace methods, especially when the problem is far from normal [25], rapid convergence is commonly observed when the spectrum is real and positive and lies within a bounded interval away from zero. The spectral analysis below is performed for the ideal preconditioner (19). However, we anticipate using a more practical approximation thereof in the numerical experiments.
From now on, we will assume to be not only positive semidefinite, but also symmetric, and to have full row rank, consistently with the inf-sup condition (5).
Note that, in principle, the natural choice of in (6) should be consistent with the norm on used in the augmented formulation (8). However, since we move from the norm on to that on in (9), a mesh-dependent scaling factor arises in the choice of this matrix. To emphasize this correspondence, we set and rewrite the matrix in (18) and the preconditioner in (19) accordingly.
Theorem 5.1. Assume that and are defined by the matrices in Equations (18) and (19), respectively. The eigenvalues of the preconditioned matrix are all real and positive. It holds
where
and is an eigenvalue of algebraic multiplicity at least . Here denotes the set
Proof. Since both the original system matrix and the preconditioner are nonsingular, the preconditioned matrix is also nonsingular, and therefore cannot be an eigenvalue. Let be an arbitrary eigenvalue of the preconditioned matrix, with a corresponding eigenvector . The generalized eigenvalue problem can be stated as:
which can be written explicitly as the following system of equations:
Notice that ; otherwise, the positive definiteness of implies , in contradiction with the fact that is an eigenvector. Therefore, we can assume .
It is evident from Equation (21) that is an eigenvalue of , with associated eigenvector . Moreover, when , we have as associated eigenvector.
We now assume . From (21) we derive
whereas from (22) we obtain , which plugged into the previous equation gives
Multiplying both sides of (24) by , we get
Therefore,
Since has full rank, a necessary and sufficient condition for the saddle point matrix to be nonsingular is , which implies . Therefore, the augmented matrix is still symmetric positive definite even if is SPSD. The positive definiteness of and the positive semidefiniteness of imply that all the eigenvalues are positive and real.5 Moreover, note that in this case cannot belong to , since , nor to since .
From (26), we also deduce that , and that all eigenvalues satisfying (26) cluster towards 1 as when the augmentation does not contain the term . In view of Lemmas 4.1 and 4.2, this is precisely the case for algebraic augmentation, for which no stabilizing term is present, consistently with the theory of classical AL-based preconditioners [10].
To conclude, we know that all nonunit eigenvalues of satisfy (25), hence, by the theory of generalized Rayleigh quotients, the smallest positive eigenvalue is characterized by:
which concludes the proof.
Remark 5.2. There are particular cases in which the matrix is actually singular, for example, in the presence of enclosed flows in the Stokes problem, where is positive definite but the divergence matrix is rank deficient by one. However, the presence of a zero eigenvalue does not necessarily hinder the convergence of preconditioned GMRES, provided that the system is consistent [11, 20].
Mesh-independence of the lower bound
The behavior of upon mesh refinement relies on the algebraic formulation of the inf-sup condition (5). Whenever , we assume that the multiplier space satisfies an inverse estimate of the form
where is the mesh size of the grid over which the multiplier space is defined. Practical examples of such estimates will be discussed later in Remark 5.5. Note that the case can be interpreted as the limiting case corresponding to , as no inverse estimate is needed.
Furthermore, let and be the expansion coefficients of and with respect to their bases, and let denote the matrix corresponding to the inner product on , so that . After exploiting inequality (27), we have the following algebraic interpretation of the discrete inf-sup stability condition (5):
where the realization of the dual norm has been replaced by the matrix , which represents the mesh-dependent norm . It is well known that the constant can be identified through a generalized eigenvalue problem (see, e.g., [31, 12, 20] for details).
Proposition 5.3. Let be the inf-sup constant in (28), and let be the smallest positive generalized eigenvalue of
Then,
where denotes the set .
In the next theorem, we show that requiring the smallest eigenvalue to be independent of the mesh size leads to a relation between the exponent in the augmented formulation (9) and the exponent appearing in inequality (27). In addition, we quantify the influence of the stabilizing term when it is nonzero. To this aim, we define
Theorem 5.4. Let be a positive constant, and assume that the inf-sup condition (5) holds and that the multiplier space satisfies the inverse estimate (27).
Then, for , the lower bound for the spectrum of in Theorem 5.1 satisfies
where denotes the continuity constant of and is the component of that is -orthogonal to . In particular, if is uniformly bounded in , then is bounded away from 0 as .
Proof. We first observe that . Indeed, let . Taking in the definition of in (20), we obtain . Since is symmetric positive semidefinite, it follows that , that is, . Hence, , which proves that .
Now let be nonzero. In order to use the results in Proposition 5.3, we decompose in a -orthogonal fashion as
so that is -orthogonal to and . Note that , otherwise .
Since is SPD and , the augmented term only sees the component :
As is -orthogonal to , it belongs to . Therefore, Proposition 5.3 yields
Moreover, the defining property of gives , whence . Using the symmetry and positive semidefiniteness of together with the continuity of , we obtain
where is the continuity constant for . Using the definition of , rewriting in a more convenient form and using (31) and (32) together with the definition of in (29) we obtain:
For algebraic augmentation, the term involving is absent. Hence, for , the lower bound in (30) is independent of , since is the mesh-independent inf-sup constant. Moreover, in agreement with Theorem 5.1, increasing the penalization parameter drives closer to 1.
For continuous augmentation, on the other hand, additional problem-dependent assumptions on are generally required to establish a mesh-independent lower bound for .
Remark 5.5. The previous analysis relates the choice for the exponent in the augmented formulation (9) to the power in the inverse estimate (27) on the multiplier space. This estimate depends on the problem, and it has to be verified on a case-by-case basis. We briefly list here some examples, which will also be considered in the numerical experiments.
When and , where denotes either the boundary of the domain or an immersed interface, the inverse estimate (27) holds with . Consequently, and , where denotes the mesh size of the codimension-one manifold . This setting arises, for instance, in the weak imposition of Dirichlet boundary conditions and in fictitious domain formulations with boundary Lagrange multipliers [24].
When and , where is a subdomain of , the inverse estimate (27) holds with , yielding and , where denotes the mesh size associated with the codimension-zero immersed domain .
If (as in the case of Grad-Div stabilization where both spaces coincide with ), no inverse estimate is needed. Therefore, , and , the standard pressure mass matrix. More generally, this rule determines the exponent for the applications in § 6.
We now validate the preceding framework on a concrete yet simple example involving the weak imposition of essential boundary conditions by means of Lagrange multipliers.
Example: boundary conditions through Lagrange multiplier
We consider the weak imposition of essential boundary conditions through Lagrange multipliers on a convex domain (), introduced in Babuška’s seminal work [4].
Let and . Let be the prescribed boundary datum and the forcing term. The operator , with , is the trace operator, namely . The saddle-point formulation in [4] seeks such that
Let us introduce suitable finite-dimensional spaces and where . This choice is admissible since, identifying with its dual, we have the dense and continuous inclusion
For this problem, Remark 5.5 suggests , and hence as power of the mesh-size.6
Let and denote the mesh sizes on and , respectively, and assume that both meshes are shape regular and quasi-uniform. Furthermore, since , the pairings in (33) reduce to scalar products at the discrete level, so that the discrete augmented formulation reads as follows: find such that
Upon discretization, a classical choice is to use linear conforming elements for and (either or elements, depending on the mesh type). In [4], it is shown that the corresponding discrete formulation, with equal order spaces, is inf-sup stable if , with chosen sufficiently large.
Note that the augmented term involves the inner product on . Albeit simple, this example shows an instance of a mixed-dimensional problem where .
As explained in [17], since the norm in is weaker than the one in , we ought to check the coercivity assumption in (10) for the well-posedness of the problem, which reads now
with . The condition is satisfied automatically with .
We start by showing that the bound in (16) tends to zero as the mesh is refined, implying that the proposed continuous augmentation is consistent. To this end, we adapt the following result from the error analysis in [17], setting for ease of exposition. Note that, since is a mesh-independent constant, this choice does not affect the following results. For simplicity, we assume that the mesh sizes are comparable, i.e., , and denote both by .
Theorem 5.6 ([17]). Assume the hypotheses of § 3. Let be the solution of the original problem (2) and be the solution of the discrete augmented problem (9). Moreover, assume that , , and . Then, the following error estimates hold:
As observed in [17], the previous a priori estimates are not optimal, since is controlled by the -norm of the interpolation error. In this specific case, such bounds are not sharp. Nevertheless, we use them to characterize the behavior of the stabilizing term. To satisfy the hypothesis , we assume additional regularity , so that by elliptic regularity . In particular, [4], and hence .
The following approximation properties hold for the chosen finite element spaces:
Using Theorem 5.6 with and standard conforming interpolation estimates, yields the following a-priori error estimate for the augmented formulation:
Moreover, for , it holds
where we have used the approximation property of the -projection (see, e.g., [37 Chapter 10]) and the trace theorem. Exploiting twice the bound (35) in Lemma 4.2 yields
We now turn our attention to the computational advantages of continuous over algebraic augmentation in terms of matrix sparsity and assembly cost. We provide numerical evidence of this matter through the following three-dimensional example.
Example 5.7 (Computational gains). We set , the three-dimensional unit ball centered at the origin, and report in Figure 1 the sparsity patterns and the number of nonzero entries (nnz) of the matrix associated with the original bilinear form , the matrix associated with the augmented bilinear form, and the algebraically augmented -block, . The global size of the -block is 3,817. The original matrix and the matrix share the same sparsity pattern, whereas is clearly much denser, by a factor larger than 16. Although the augmentation considered here involves only a surface integral, the algebraic augmentation still leads to a dramatic increase in the number of nonzero entries.
To further highlight the benefits of our approach, we compare the wall-clock times of the continuous and algebraic augmentations (the latter computed using the cheaper variant ) over a sequence of mesh refinements in Figure 2.
The continuous augmentation is substantially sparser, and on the finest mesh is 90× faster to assemble. Motivated by these examples, we will not compute any triple matrix product in the numerical tests of § 6, but rather we will directly assemble the augmented bilinear form.
Figure 1. Sparsity patterns of the original matrix and of the augmented matrices , and for the weak imposition of Dirichlet boundary conditions à la Babuška. – elements are employed.
Figure 2. Comparison of wall-clock time (in seconds) against number of dof for the algebraic and continuous augmentations. Here , and is its associated matrix representation.
Finally, we establish the mesh-independence of in Theorem 5.4 for the present problem, namely, we show that the term remains bounded as the mesh is refined. Indeed, using estimate (35) in the definition (29) yields
We also validate the mesh-independence of numerically. To avoid solving large generalized eigenvalue problems, we consider the two-dimensional analogue of the previous example, setting . We perform a series of uniform refinement cycles to investigate the behavior of as the mesh resolution increases. Furthermore, we also verify that increasing the augmentation parameter using values produces a tightly clustered spectrum near 1, as predicted at the end of Theorem 5.4. We compute the eigenvalues of the preconditioned matrices using the Python scipy.linalg package. The plots in Figure 3 validate the developed theory: all eigenvalues are real and positive, with the smallest eigenvalue indicated in each plot. Fixing each column, we observe that the smallest eigenvalue remains uniformly bounded upon mesh refinement. Fixing each row, instead, we observe an increasingly clustered spectrum near 1 as the constant increases.
Figure 3. Spectrum of for the weak imposition of essential boundary conditions. Each row corresponds to a refinement cycle in which both meshes are uniformly refined. Along rows: influence of the AL parameter (increasing from left to right). Along columns: mesh-independence of lower bound . Cycle 0 has sizes and , cycle 1 has and , and cycle 2 has and .
Interplay between , convergence rates, and iteration counts.
In [17], the power of is tuned to improve a-priori estimates, whereas in the present work is dictated by preconditioning requirements. Since this choice is not driven by accuracy considerations, we have to verify that it does not deteriorate the convergence of the discrete solution.
To this end, we consider again Problem (34), with , manufactured solution , and – elements. This pair is balanced, and the non-augmented scheme already achieves the best-approximation rate [4], so no accuracy can be gained from the augmentation. The purpose of the experiment is therefore to confirm that none is lost with , and to show that, in contrast, the performance of the iterative solver is strongly dependent on the choice of . We use FGMRES with an inexact variant of the ideal preconditioner to account for its variable application resulting from the iterative solution of the diagonal blocks. The absolute stopping tolerance is set to . The augmented block uses conjugate gradient (CG) with one V-cycle of algebraic multigrid and tolerance , while the mass matrix uses CG with point-Jacobi preconditioning. Details are provided in § 6. We set the augmentation parameter to .
Errors, convergence rates, and iteration counts are reported in Table 1, where is compared with .
| dof_u | dof_λ | FGMRES its. | FGMRES its. | ||||||
| 81 | 16 | 10 | 10 | ||||||
| 289 | 32 | (1.97) | (0.99) | (0.56) | 14 | (2.00) | (1.00) | (0.56) | 12 |
| 1,089 | 64 | (1.97) | (0.99) | (0.51) | 18 | (2.00) | (1.00) | (0.51) | 12 |
| 4,225 | 128 | (1.97) | (0.99) | (0.50) | 21 | (2.00) | (1.00) | (0.50) | 12 |
| 16,641 | 256 | (1.98) | (0.99) | (0.50) | 24 | (2.00) | (1.00) | (0.50) | 12 |
| 66,049 | 512 | (1.98) | (0.99) | (0.50) | 27 | (2.00) | (1.00) | (0.50) | 11 |
| 263,169 | 1,024 | (1.99) | (0.99) | (0.50) | 30 | (2.00) | (1.00) | (0.50) | 11 |
| 1,050,625 | 2,048 | (1.99) | (0.99) | (0.50) | 34 | (2.00) | (1.00) | (0.50) | 11 |
Table 1. Convergence study for the weak imposition of boundary conditions on , , – elements, . Comparison between and the exponent, , predicted by Remark 5.5, implying . Convergence rates are reported in parentheses.
For both powers, the optimal convergence rates are confirmed (two in and one in semi-), and the errors are essentially unaffected by . The iteration counts, instead, remain bounded only for (cf. also Table 3 in § 6).
| Weak bcs. through multipliers (2D) | ||||
| dof | dof | FGMRES its. | Inner (avg.) | |
| 81 | 16 | 6 | 2 | |
| 289 | 32 | 7 | 2 | |
| 1,089 | 64 | 6 | 2 | |
| 4,225 | 128 | 6 | 5 | |
| 16,641 | 256 | 5 | 5 | |
| 66,049 | 512 | 5 | 5 | |
| 263,169 | 1,024 | 5 | 6 | |
| 1,050,625 | 2,048 | 4 | 6 | |
| 4,198,401 | 4,096 | 5 | 7 |
Table 3. FGMRES(30) iteration counts for the AL preconditioner applied to weakly imposed boundary conditions (5.17) on , with , , .
Numerical experiments
We evaluate the performance of the proposed preconditioners for linear systems stemming from mixed finite element discretizations of mixed-dimensional and fictitious domain formulations with Lagrange multipliers. Our previous works [8, 7] demonstrated the robustness of algebraic AL approaches for fictitious domain problems, showing superior performance compared with other methods. Here, we focus on improving and generalizing the framework developed therein, while referring to our previous works for comparisons with alternative methods.
Computations have been carried out on a laptop equipped with an AMD Ryzen 9 PRO 7940HS processor and 64 GB of RAM. Experiments have been performed using the C++ finite element library DEAL.II [2].
Our implementation allows exploiting several features, such as adaptive mesh refinement, efficient handling of non-matching meshes in parallel setting, as well as state-of-the-art algebraic multigrid preconditioners available in well-established linear algebra libraries. When we use conforming elements on quadrilaterals or hexahedra, local refinement induces hanging nodes. Continuity of the discrete solution is enforced by imposing constraints on the degrees of freedom (dof). The nodal unknowns associated with such nodes are eliminated by restricting them to an interpolation of the nodal values of the finite element solution on the corresponding parent element [2].
Table 2 summarizes the problems, preconditioners, and stable finite element pairs, including three-dimensional elasticity with different Lamé constants in each subdomain.
Table 2. Problems considered in this section, corresponding AL preconditioners, and finite element spaces.
We use simplicial, quadrilateral, or hexahedral meshes according to the geometry. As usual in fictitious domain experiments, we use a structured background mesh on .
The outer Krylov solver is set to FGMRES [34] with a restart every 30 iterations. All iterations start from a zero initial guess and, unless otherwise specified, are stopped when the relative residual norm drops below , or when the absolute residual is below . All preconditioners considered are applied inexactly. Inner solves for the augmented blocks use preconditioned conjugate gradient (PCG) with one V-cycle of an algebraic multigrid preconditioner from Trilinos ML [27] (using a degree two Chebyshev smoother, aggregation threshold set to , maximum size of the coarsest level set to 2000, and a direct solver on the coarsest level) with a loose inner tolerance of . For the mass matrix inversion we use PCG with point-Jacobi. In each one of the forthcoming tables, we report as last column the (average) number of PCG iterations to invert the (1,1)-block.
A classical alternative for the approximate inversion of augmented blocks in AL preconditioners is to use one or a few multigrid cycles with tailored smoothers based on patchwise relaxation [36, 21]. Crucially, designing such smoothers strongly depends on the weak form and on the finite element spaces employed; we notice that, in the mixed-dimensional case, this becomes even more challenging due to the presence of two overlapping meshes. For these reasons, we do not pursue this avenue here, and leave the development of tailored multigrid solvers to future work.
Weak imposition of boundary conditions with Lagrange multipliers
We consider the system associated with the weak imposition of boundary conditions on through Lagrange multipliers in Problem (34). We use a stable pair with linear Lagrangian elements for both the solution variable and the Lagrange multiplier. The resulting preconditioner is (19) with blocks
Following Remark 5.5, we have set , which corresponds to . We refer to this preconditioner as . We test its performance by setting , with and as a non-constant boundary datum. The results are reported in Table 3. They indicate excellent convergence properties of the AL preconditioner, which exhibits constant and very low iteration counts across mesh refinement, even with a mild value of .
To stress the robustness of the preconditioner, we consider a non-trivial three-dimensional test case involving the geometry shown in Figure 4a, keeping as boundary datum. For such a geometry, the generation of a hexahedral mesh is a complex task, and we hence consider tetrahedral elements. Hence, – is the chosen finite element pair. The meshing procedure starts from an STL file representing the boundary of the domain7, and generates a volumetric tetrahedral mesh through the FTETWILD library [28]. The resulting mesh is shown in Figure 4a, while the computed solution is shown in Figure 4b.
Figure 4. (a)–(b): tetrahedralization of the surface mesh (clipped) and computed solution for the weak imposition of boundary conditions with . (c)–(d): popcorn surface (12,178 triangles) and computed solution on (clipped in order to show mesh of ) for the Poisson fictitious domain problem with boundary supported Lagrange multipliers, with , . Iteration counts are reported in Table 5.
The results in terms of iteration counts across mesh refinement are collected in Table 4, confirming the robustness of the AL preconditioner also for a challenging geometry. The average number of inner iterations to approximately invert the augmented block mildly increases with mesh refinement, never exceeding nine PCG iterations.
| Weak bcs. through multipliers (3D) | ||||
| dof | dof | FGMRES its. | Inner (avg.) | |
| 5,859 | 3,887 | 15 | 6 | |
| 37,356 | 15,542 | 11 | 7 | |
| 264,283 | 62,162 | 11 | 8 | |
| 1,982,981 | 248,642 | 8 | 9 |
Table 4. FGMRES(30) iteration counts for the AL preconditioner applied to weakly imposed boundary conditions (5.17) on the three-dimensional geometry in Figure 4, with , , .
Fictitious domain with boundary supported Lagrange multipliers
We consider the saddle-point system associated with the Poisson fictitious domain problem with boundary Lagrange multipliers, which we briefly recall from [24]. Let be a closed and bounded domain of , , with Lipschitz continuous boundary , and a Lipschitz domain such that is compactly contained in . We consider the associated variational formulation from [24], i.e., find
for given data and . Formally, the above problem and its augmented formulation is very close to the one in the previous section. The main difference lies in the fact that is an immersed interface (a surface in the three-dimensional case) not aligned with the background domain , yielding a loss of regularity for , which cannot be expected to be globally in [24]. Remark 5.5 gives again , therefore the blocks of the preconditioner are defined analogously to those in (6.1). We refer to the preconditioner for this problem as .
We test it on a challenging three-dimensional immersed geometry. We set , , , and take to be a surface mesh representing a popcorn-like geometry. The discretization of is done by means of a surface triangular mesh consisting of 12,178 elements, and it is shown in Figure 4c. A localized refinement is performed around the interface, and the computed solution is shown in Figure 4d. Iteration counts in Table 5 remain robust under mesh refinement. Low and robust iteration counts (not reported here) are also confirmed for a simpler two-dimensional test with and given by the boundary of the ball of radius 0.2 centered at .
| FD-BLM (3D) | ||||
| FGMRES its. | Inner (avg.) | |||
| 141,179 | 6,091 | 14 | 11 | |
| 577,664 | 24,358 | 15 | 11 | |
| 2,442,031 | 97,426 | 12 | 12 | |
| 10,808,121 | 389,698 | 12 | 12 |
Table 5. FGMRES(30) iteration counts for the AL preconditioner applied to the Poisson fictitious domain problem with boundary supported Lagrange multipliers. We set , the pop-corn geometry, , , , and we use – elements.
Fictitious domain with distributed Lagrange multipliers
We consider the following elliptic interface problem with a jump in the coefficients. Let be a domain in , where , with a bounded Lipschitz boundary . Let and be two subdomains of such that , and let the interface be Lipschitz continuous. We assume .
For , given forcing terms , and positive coefficients , find and such that:
where () denotes the unit vector normal to , pointing out of .
Following the fictitious domain discretization developed in [3, 16], let , , and . Given , and , let denote the product space, whose elements are . The formulation requires finding such that
where
Hence, for this problem it follows , which weakly enforces to match on the immersed domain .
We denote by the characteristic mesh size of the background mesh on and by that of the immersed mesh on . We assume that both meshes are shape regular and quasi-uniform and satisfy . Thus, the analogue of the discrete augmented formulation (9) is obtained by adding the term to the left-hand side of the first equation. Moreover, following the recipe outlined in Remark 5.5, we set . In this case, we consider instead the projected augmentation
as an example of the possible alternative mentioned in § 1.1. By Lemma 4.1, this term is equivalent to the algebraic augmentation and therefore does not alter the discrete solution. Using finite element spaces for which the multiplier space is discontinuous, i.e. ––, where denotes the bubble enrichment (inf-sup stability for this element has been shown in [1]), the projected term can be assembled without forming . Indeed, reduces to the local projection onto piecewise constants, which is a local operation consisting of averaging the values of over each cell of the immersed mesh .
Introducing basis functions , , and for the finite element spaces , , and , respectively, the resulting matrices are defined as follows:
Our framework gives the following candidate (ideal) preconditioner, where no triple matrix product needs to be formed:
Nevertheless, approximately inverting the augmented block remains non-trivial. To address this issue, the authors introduced in [7] a modified version with two distinct augmentation parameters, and . In our framework, this preconditioner takes the form
and only requires the inversion of the SPD diagonal blocks. As shown in [7], the preconditioner is fairly robust with respect to the jump , with an increasingly tighter spectrum when and . For this reason, following [7], we set and .
To validate this preconditioner, we start with a classic two-dimensional experiment where and , the ball of radius 0.3 centered at the origin. The number of FGMRES iterations for different values of are collected in Table 6, showing high robustness of the preconditioner also with respect to the jump in the coefficients induced by parameter . Inner iteration counts for the approximate inversion of the augmented -block when are reported in the last column and low values are observed across mesh refinement.
| FGMRES iterations | Inner (avg.) | |||||
| dof | dof | dof | ||||
| 4,225 | 169 | 80 | 18 | 18 | 18 | 6 |
| 16,641 | 657 | 320 | 23 | 23 | 23 | 6 |
| 66,049 | 2,593 | 1,280 | 22 | 22 | 22 | 7 |
| 263,169 | 10,305 | 5,120 | 22 | 22 | 22 | 7 |
| 1,050,625 | 41,089 | 20,480 | 23 | 23 | 23 | 7 |
| 4,198,401 | 164,097 | 81,920 | 25 | 24 | 24 | 8 |
Table 6. FGMRES(30) iteration counts for the modified AL preconditioner applied to the elliptic interface fictitious domain problem with distributed Lagrange multipliers. We set , , –– elements, for increasing values of . The augmentation parameters are chosen as , , .
A visualization of the solution for is shown in Figure 5, where the contrast among subdomains results in a clear and visible separation of the two regions.

Figure 5. Computed solution for the elliptic interface fictitious domain problem with distributed Lagrange multipliers () on , .
For the three-dimensional case, we consider a more complex setting by extending the scalar elliptic interface problem to an immersed linear elasticity problem. We use the same finite element spaces as in the previous scalar case. Let be the shear moduli in and , respectively, and the first Lamé parameters. Consistently with the assumptions for the scalar problem (38), we assume and . We denote with and the corresponding jumps. Vector-valued functions are indicated in boldface; thus, no ambiguity arises when denotes either a multiplier or a Lamé parameter. Adapting the arguments from the previous sections to the vector-valued case, the fictitious domain formulation reads as follows: find such that
where is the linearized strain tensor, , and , , are the vector-valued analogues of the spaces defined for the scalar problem. Here, denotes the portion of the boundary on which Dirichlet conditions are imposed.
We consider an elongated steel bar inside a rubber-like elastomeric mount. The background domain is the rectangular box (in mm), while the immersed domain is the box . Both domains are discretized with structured hexahedral meshes, with the bar mesh shown in Figure 6a.


Figure 6. (a) Rectangular inclusion for . (b) Computed solution (clipped). Linear elasticity problem: bar inclusion mesh immersed in a rubber-like elastomeric mount. In gray, the displaced configuration of the inclusion, while in blue the reference configuration. The background domain is deformed and clipped in order to show the immersed geometry.
The material properties are chosen to be representative of the physical materials: the bar has Lamé constants and , corresponding to a Young’s modulus , while the background domain has and , corresponding to a Young’s modulus . This implies a contrast of nearly four orders of magnitude between the immersed inclusion and the background domain, and represents a good test case to evaluate the AL preconditioner on a physically relevant scenario. On the background domain , we prescribe a fixed displacement field , with , on the top face and zero displacement on the bottom face. Traction-free boundary conditions are applied to the four remaining lateral faces, and body forces are neglected. The displacement magnitude (in mm) with the associated streamlines is shown in Figure 6b. The softer background domain shows a smooth gradient for the magnitude of the displacement from the clamped bottom to the fixed top face, typical of a uniaxial compression state. Due to the high contrast in material properties, the bar undergoes a translation of in the negative -direction with no visible distortion, behaving as a rigid body.
We use the same inner PCG solvers as in the previous experiments, with an outer relative residual tolerance of . We then study the behavior of with respect to simultaneous mesh refinement up to degrees of freedom. The FGMRES iterations for different cycles are reported in Table 7: also in this complex scenario, the iteration counts remain low and robust under mesh refinement. The low number of iterations, combined with a realistic setup featuring high contrast in the material coefficients, motivates the usage of the proposed preconditioner as a viable option for the solution of large-scale three-dimensional problems.
| FD-DLM (3D) | ||||
| FGMRES its. | Inner (avg.) | |||
| 28,611 | 1,551 | 576 | 12 | 7 |
| 212,355 | 10,683 | 4,608 | 10 | 7 |
| 1,635,075 | 79,347 | 36,864 | 12 | 9 |
| 12,830,211 | 611,811 | 294,912 | 9 | 9 |
Table 7. FGMRES(30) iteration counts for the modified AL preconditioner applied to the linear elasticity fictitious-domain problem with distributed Lagrange multipliers on the rectangular inclusion immersed in a rubber-like elastomeric mount.
Strong scaling study
We conclude with a strong scaling experiment, using the same inner and outer solvers and stopping criteria as in the previous experiment. The simulations have been run on the MareNostrum 5 cluster at Barcelona Supercomputing Center, where each compute node features 2x Intel Sapphire Rapids 8460Y+ processors at 2GHz (56 cores each, 112 cores per node) and 256GB of main memory.8
We consider the same material parameters and spaces as in the previous example, with and . The discretization has 50,923,779 dof for , 206,115 for , and 98,304 for . We vary the number of MPI processes from 336 to 5376 (i.e., from 3 to 48 compute nodes) and report the wall-clock time as a function of the number of MPI processes for each phase: linear solver, assembly of background and immersed matrices, and coupling terms.
Results are shown in Figure 7. The annotations (in black) indicate the number of FGMRES iterations, which is independent of the number of MPI processes. The linear solver and the classical assembly phases exhibit good scaling, with a degradation when communication overhead becomes significant due to the low number of dof per MPI process. Particle detection and augmented term assembly dominate the assembly cost. The detection phase locates immersed-mesh quadrature points, treated as particles, in the background mesh and assigns them to subdomains, requiring substantial global communication between the independently partitioned meshes.
!Strong scaling plot showing wall-clock time [s] versus number of MPI processes, with Ideal, Solver, Coupling setup and augmented assembly, Background assembly, and Immersed assembly curves bbox=0.10,0.09,0.87,0.35
Figure 7. Strong scaling analysis for the fictitious domain method with distributed Lagrange multipliers on MareNostrum 5. The dashed line represents ideal scaling. Black numbers above the solver curve indicate FGMRES iteration counts.
Conclusions, practical guidelines and outlook
We have introduced a unified framework for the design and analysis of augmented Lagrangian preconditioners for symmetric saddle point systems arising from mixed finite element discretizations. The proposed approach is based on a continuous augmentation, which combines the spectral benefits of algebraic augmentation with the computational simplicity of a standard finite element formulation. The augmented -block can be explicitly assembled, preserving the sparsity pattern of the original block and avoiding sparse matrix-matrix products. Moreover, if we can prove that the stabilizing term vanishes under mesh refinement, then the solution of the discrete augmented formulation converges to that of the original problem. In addition, our analysis shows that the matrix preconditioned with the ideal preconditioner has a real, positive spectrum that is bounded away from zero and clusters around 1 as the AL parameter increases.
Numerical experiments with mixed-dimensional Lagrange multiplier formulations, different discretizations, and complex geometries validate the theoretical findings, while the abstract analysis applies to a broader class of constrained formulations. The applicability of the framework to a new problem can be assessed through four main checks: coercivity (10), the inverse inequality (27), the vanishing of the augmentation residual in (16) under mesh refinement, and compatibility of the mesh-dependent scaling with the convergence rate (Section 5.2.1). These conditions provide a practical guideline for assessing whether the framework provides an efficient alternative to algebraic augmentation while retaining its spectral advantages. The procedure is illustrated in § 5.2 for the weak imposition of boundary conditions considered.
If one of the previous checks does not hold, a possible alternative is to employ the projected counterpart of the augmentation term, as illustrated in § 6.3. This approach still avoids the explicit computation of the triple matrix product .
Future work will extend this approach to fluid-structure interaction problems and develop tailored multigrid solvers for the approximate inversion of the augmented blocks.
Acknowledgments
The authors are grateful to Patrick Farrell (University of Oxford) for helpful discussions.
Declarations. The implementation of this methodology is available in the authors’ maintained GitHub repository: https://github.com/fdrmrc/fictitious_domain_AL-preconditioners. The authors used ChatGPT v6.1 to improve readability and language. They reviewed and edited the material. The authors take full responsibility for all content.
References
References
- [1]N. Alshehri, D. Boffi, and L. Gastaldi, Unfitted mixed finite element methods for elliptic interface problems, Numerical Methods for Partial Differential Equations, 40 (2024), p. e23063, https://doi.org/10.1002/num.23063.
- [2]D. Arndt, W. Bangerth, D. Davydov, T. Heister, L. Heltai, M. Kronbichler, M. Maier, J.-P. Pelteret, B. Turcksin, and D. Wells, The deal.II finite element library: Design, features, and insights, Computers & Mathematics with Applications, 81 (2021), pp. 407–422.DOI
- [3]F. Auricchio, D. Boffi, L. Gastaldi, A. Lefieux, and A. Reali, On a fictitious domain method with distributed Lagrange multiplier for interface problems, Applied Numerical Mathematics, 95 (2015), pp. 36–50, https://doi.org/10.1016/j.apnum.2014.05.013.
- [4]I. Babuška, The finite element method with Lagrangian multipliers, Numerische Mathematik, 20 (1973), pp. 179–192.DOI
- [5]F. P. A. Beik and M. Benzi, Preconditioning techniques for the coupled Stokes-Darcy problem: spectral and field-of-values analysis, Numerische Mathematik, 150 (2022), pp. 257–298, https://doi.org/10.1007/s00211-021-01267-8.
- [6]M. Benzi and C. Faccio, Solving linear systems of the form $(A + \alpha UU^T) x = b$ by preconditioned iterative methods, SIAM Journal on Scientific Computing, 46 (2024), pp. S51–S70, https://doi.org/10.1137/22M1505529.
- [7]M. Benzi, M. Feder, L. Heltai, and F. Mungaioni, Augmented Lagrangian preconditioners for fictitious domain formulations of elliptic interface problems, arXiv:2603.12993, (2026), https://arxiv.org/abs/2603.12993.
- [8]M. Benzi, M. Feder, L. Heltai, and F. Mungaioni, Scalable augmented Lagrangian preconditioners for fictitious domain problems, Computer Methods in Applied Mechanics and Engineering, 450 (2026), p. 118522, https://doi.org/10.1016/j.cma.2025.118522.
- [9]M. Benzi, G. H. Golub, and J. Liesen, Numerical solution of saddle point problems, Acta Numerica, 14 (2005), pp. 1–137, https://doi.org/10.1017/S0962492904000212.
- [10]M. Benzi and M. A. Olshanskii, An augmented Lagrangian-based approach to the Oseen problem, SIAM Journal on Scientific Computing, 28 (2006), pp. 2095–2113, https://doi.org/10.1137/050646421.
- [11]M. Benzi, M. A. Olshanskii, and Z. Wang, Modified augmented Lagrangian preconditioners for the incompressible Navier-Stokes equations, International Journal for Numerical Methods in Fluids, 66 (2011), pp. 486–508, https://doi.org/10.1002/fld.2267.
- [12]D. Boffi, F. Brezzi, and M. Fortin, Mixed Finite Element Methods and Applications, vol. 44 of Springer Series in Computational Mathematics, Springer, Berlin, Heidelberg, 2013, https://doi.org/10.1007/978-3-642-36519-5.
- [13]D. Boffi, A. Cangiani, M. Feder, L. Gastaldi, and L. Heltai, A comparison of non-matching techniques for the finite element approximation of interface problems, Computers & Mathematics with Applications, 151 (2023), pp. 101–115.arxiv.org/abs/2304.11908
- [14]D. Boffi, F. Credali, and L. Gastaldi, On the interface matrix for fluid-structure interaction problems with fictitious domain approach, Computer Methods in Applied Mechanics and Engineering, 401 (2022), p. 115650, https://doi.org/10.1016/j.cma.2022.115650.
- [15]D. Boffi and L. Gastaldi, A fictitious domain approach with Lagrange multiplier for fluid-structure interactions, Numer. Math., 135 (2017), pp. 711–732, https://doi.org/10.1007/s00211-016-0814-1.
- [16]D. Boffi, L. Gastaldi, and M. Ruggeri, Mixed formulation for interface problems with distributed Lagrange multiplier, Computers & Mathematics with Applications, 68 (2014), pp. 2151–2166, https://doi.org/10.1016/j.camwa.2014.07.020. Advances in Computational Partial Differential Equations.
- [17]D. Boffi and C. Lovadina, Analysis of new augmented Lagrangian formulations for mixed finite element schemes, Numerische Mathematik, 75 (1997), pp. 405–419.DOI
- [18]A. Budiša, X. Hu, M. Kuchta, K.-A. Mardal, and L. Zikatanov, Rational approximation preconditioners for multiphysics problems, in International Conference on Numerical Methods and Applications, Springer, 2022, pp. 100–113.
- [19]N. Dimola, N. Rares Franco, and P. Zunino, Numerical solution of mixed-dimensional PDEs using a neural preconditioner, Computers & Mathematics with Applications, 206 (2026), pp. 58–79, https://doi.org/10.1016/j.camwa.2025.12.013.
- [20]H. Elman, D. Silvester, and A. Wathen, Finite Elements and Fast Iterative Solvers: with Applications in Incompressible Fluid Dynamics, Oxford University Press, 2014, https://doi.org/10.1093/acprof:oso/9780199678792.001.0001.
- [21]P. E. Farrell, M. G. Knepley, L. Mitchell, and F. Wenschung, PCPATCH: Software for the topological construction of multigrid relaxation methods, ACM Transactions on Mathematical Software, 47 (2021), https://doi.org/10.1145/3445791.
- [22]P. E. Farrell, L. Mitchell, and F. Wenschung, An augmented Lagrangian preconditioner for the 3D stationary incompressible Navier–Stokes equations at high Reynolds number, SIAM Journal on Scientific Computing, 41 (2019), pp. A3073–A3096, https://doi.org/10.1137/18M1219370.
- [23]M. Firmbach, I. Steinbrecher, A. Popp, and M. Mayr, Modified augmented Lagrangian preconditioning for mixed-dimensional beam-solid coupling, Computer Methods in Applied Mechanics and Engineering, 463 (2027), p. 119425, https://doi.org/10.1016/j.cma.2026.119425.
- [24]V. Girault and R. Glowinski, Error analysis of a fictitious domain method applied to a Dirichlet problem, Japan Journal of Industrial and Applied Mathematics, 12 (1995), pp. 487–514, https://doi.org/10.1007/BF03167240.
- [25]A. Greenbaum, V. Pták, and Z. Strakoš, Any nonincreasing convergence curve is possible for GMRES, SIAM Journal on Matrix Analysis and Applications, 17 (1996), pp. 465–469, https://doi.org/10.1137/S0895479894275030.
- [26]T. Heister and G. Rapin, Efficient augmented Lagrangian-type preconditioning for the Oseen problem using Grad-Div stabilization, International Journal for Numerical Methods in Fluids, 71 (2013), pp. 118–134, https://doi.org/10.1002/fld.3654.
- [27]M. A. Heroux, R. A. Bartlett, V. E. Howle, R. J. Hoekstra, J. J. Hu, T. G. Kolda, R. B. Lehoucq, K. R. Long, R. P. Pawlowski, E. T. Phipps, A. G. Salinger, H. K. Thornquist, R. S. Tuminaro, J. M. Willenbring, A. Williams, and K. S. Stanley, An overview of the Trilinos project, ACM Transactions on Mathematical Software, 31 (2005), pp. 397–423, https://doi.org/10.1145/1089014.1089021.
- [28]Y. Hu, T. Schneider, B. Wang, D. Zorin, and D. Panozzo, Fast tetrahedral meshing in the wild, ACM Trans. Graph., 39 (2020), https://doi.org/10.1145/3386569.3392385.
- [29]M. Kuchta, M. Nordaas, J. C. Verschaeve, M. Mortensen, and K.-A. Mardal, Preconditioners for saddle point systems with trace constraints coupling 2D and 1D domains, SIAM Journal on Scientific Computing, 38 (2016), pp. B962–B987.DOI
- [30]F. Laakmann, P. E. Farrell, and L. Mitchell, An augmented Lagrangian preconditioner for the magnetohydrodynamics equations at high Reynolds and coupling numbers, SIAM Journal on Scientific Computing, 44 (2022), pp. B1018–B1044, https://doi.org/10.1137/21M1416539.
- [31]D. Malkus, Eigenproblems associated with the discrete LBB condition for incompressible finite elements, International Journal of Engineering Science, 19 (1981), pp. 1299–1310, https://doi.org/10.1016/0020-7225(81)90013-6.
- [32]K.-A. Mardal and W. Winther, Preconditioning discretizations of systems of partial differential equations, Numerical Linear Algebra with Applications, 18 (2011), pp. 1–40, https://doi.org/10.1002/nla.716.
- [33]J. Moulin, P. Jolivet, and O. Marquet, Augmented Lagrangian preconditioner for large-scale hydrodynamic stability analysis, Computer Methods in Applied Mechanics and Engineering, 351 (2019), pp. 718–743, https://doi.org/10.1016/j.cma.2019.03.052.
- [34]Y. Saad, A flexible inner-outer preconditioned GMRES algorithm, SIAM Journal on Scientific Computing, 14 (1993), pp. 461–469, https://doi.org/10.1137/0914128.
- [35]Y. Saad, Iterative Methods for Sparse Linear Systems, Society for Industrial and Applied Mathematics, second ed., 2003, https://doi.org/10.1137/1.9780898718003.
- [36]J. Schöberl, Multigrid methods for a parameter dependent problem in primal variables, Numerische Mathematik, 84 (1999), pp. 97–119, https://doi.org/10.1007/s002110050465.
- [37]O. Steinbach, Numerical Approximation Methods for Elliptic Boundary Value Problems: Finite and Boundary Elements, Springer, 2008.
- [38]J. Xia, P. E. Farrell, and F. Wenschung, Augmented Lagrangian preconditioners for the Oseen–Frank model of nematic and cholesteric liquid crystals, BIT Numerical Mathematics, 61 (2021), pp. 607–644, https://doi.org/10.1007/s10543-020-00838-9.



