WorksMathematics
A Geometry-Robust Nečas-Type Inequality for Stokes Preconditioning
Abstract
Pressure mass preconditioners for the incompressible Stokes equations can deteriorate on domains with narrow gaps. We develop a pressure preconditioner that uses the distance to the boundary to account for spatially varying geometric scales. Its application consists of a pressure mass solve and a weighted pressure Poisson solve, with the squared boundary distance as the diffusion coefficient. The theoretical basis is a distance-weighted pressure norm defined by splitting the pressure into an component and a component controlled by its weighted gradient. We prove that this norm is bounded by the negative norm of the pressure gradient on every bounded connected open set, with a constant depending only on the dimension. A reverse bound follows from the boundary Hardy inequality, giving norm equivalence uniformly over families with bounded Hardy constants. Two-dimensional finite element experiments on slender, perforated, and composite domains demonstrate stable performance across the tested geometric parameters and mesh refinements. The smallest eigenvalues of the preconditioned pressure Schur complement remain close to , and block preconditioning with algebraic multigrid auxiliary solves requires about 20–30 FGMRES iterations across the geometric sweeps.
Introduction
We study the efficient numerical solution of the steady Stokes equations on domains with challenging geometries. For unit viscosity and homogeneous Dirichlet velocity data, the equations take the form
where , , is a bounded connected Lipschitz domain, is the velocity, and is the pressure, normalized to have zero mean. Mixed finite-element discretizations lead to saddle-point systems, for which effective pressure preconditioning is essential to efficient iterative solution [12, 5].
The viscous term provides direct control of , while the pressure acts as a Lagrange multiplier enforcing incompressibility and has no coercive term of its own. Pressure stability therefore depends on its coupling to the velocity through the divergence operator. The corresponding inf-sup condition requires that the norm of a mean-zero pressure be controlled by the negative norm of its gradient. Equivalently, one needs the classical Nečas inequality [24, 14, 6]:
where is the space of square-integrable functions with zero mean, and the negative norm is dual to the gradient norm on . This estimate also underpins the comparison of the pressure Schur complement with a pressure mass operator in block preconditioners [12, 19].
In the classical negative-norm theory, the Nečas inequality is also stated with a lower-order term,
On a bounded connected Lipschitz domain, a compactness argument removes the lower-order term after fixing the mean, giving (1.2); see [24, 14]. Bramble [6] gives a direct proof on Lipschitz domains and explains its equivalence to the Stokes inf-sup condition. Amrouche, Ciarlet and Mardare [3] place these estimates in a broader equivalence theorem linking the Lions lemma, the closed range of the gradient, solvability of the divergence equation, and a weak form of de Rham’s theorem.
The classical Nečas constant depends on the domain geometry and may become unbounded along degenerating families. This dependence has been studied extensively through the equivalent Ladyzhenskaya–Babuška–Brezzi (LBB) formulation. Chizhonkov and Olshanskii [8] obtained explicit, asymptotically accurate estimates on model domains such as strips and rings, and related the continuous constant to discrete stability. Dobrowolski [9] established aspect-ratio estimates on stretched domains; his subsequent work [10] used coarse pressure spaces to construct preconditioners with bounds independent of the aspect ratio. Our preprint [28] gives a sharp LBB estimate for tight domains with periodic pillars. These results quantify how geometric degeneration enters the classical pressure estimate and how its effect can be compensated.
To obtain uniform stability estimates, one can incorporate the geometric scale into the pressure norm itself. For slender domains of width , Sande, Koch, Kuchta and Mardal [25] established a uniform equivalence between and the -functional norm , using a coarse partition and quasi-interpolation. For periodic pillar arrays with hole size proportional to the period , the sharp LBB estimate of [28] is complemented by the norm equivalence in [29], where in this regime. The latter proof combines a weighted Nečas estimate on a fixed filled domain with a dual pressure extension built from the restriction operators of [1, 2, 21]; its constants are uniform in the period for a fixed macroscopic domain and reference geometry. In Nečas language, these norm characterizations provide pressure estimates adapted to the scale of the specified geometric family.
Spatially varying geometric scales are common in practical flow domains, including branching vascular geometries [13], microfluidic devices employing deterministic lateral displacement (DLD) arrays [20, 26], and the pore spaces of natural rocks [23]. Sande et al. [25], Remark 3 and Example 5 also discuss a variable local width and the associated weighted pressure operator. The analytical question pursued here is to identify a canonical local scale and prove the corresponding Nečas-type inequality on arbitrary bounded connected open sets, with a constant depending only on the dimension. The boundary distance supplies such a scale intrinsically, without a prescribed channel width, period, or coarse partition.
Let , let be a bounded connected open set, and set . Let consist of the functions with . Define the distance-weighted -functional norm by
Our main result, Theorem 3.1, is the inequality
with depending only on the dimension. The geometric information is carried by in the norm, while the constant is independent of aspect ratios, perforations, and contrasts between local length scales. Since , it controls pressure in a weaker, geometrically adapted norm.
The proof starts from the classical Nečas inequality on a cube, which controls a function up to its mean with a constant independent of the cube size. A Whitney decomposition allows us to apply this estimate on slightly enlarged cubes whose sizes are comparable to the local boundary distance. Each cube has its own mean, and these local constants need not agree. We blend them into a smooth function using a partition of unity and use as a competitor in (3). Both the error and the weighted gradient are controlled by the local oscillations: the factor compensates for the derivatives of the partition functions. Bounded overlap and negative-norm localization then give (4).
If also satisfies the boundary Hardy inequality for , then integration by parts gives a reverse estimate. Combining this estimate with (4) yields the norm equivalence in Corollary 3.7:
The equivalence is uniform on any family with uniformly bounded Hardy constants. For example, Ancona’s bound for simply connected planar domains [4, 17] gives the reverse constant , independently of channel widths and their contrast; see Remark 3.8. Thus the additional geometric dependence in the two-sided norm characterization is isolated in the Hardy constant.
For the Stokes problem, this norm equivalence provides an analytical basis for pressure preconditioning through the operator-preconditioning framework of Mardal–Winther [22], building on Bramble–Pasciak [7] and Loghin–Wathen [19]. The squared negative norm of the pressure gradient is the quadratic form of the continuous pressure Schur complement, so an equivalent pressure norm supplies a corresponding Riesz map. The distance-weighted -functional motivates an inverse pressure block combining a mass inverse and a boundary-distance-weighted stiffness inverse, with no prescribed global length scale. Transferring uniform continuous bounds to a discretization requires suitable uniform discrete stability and comparison of the discrete weighted norm with . Numerical results on slender, perforated, and composite domains show that the computed smallest eigenvalues of the preconditioned pressure Schur complement remain uniformly bounded away from zero across the tested geometric variations, consistent with the geometry-independent lower bound in the continuous estimate.
The remainder of the paper is organized as follows. Section 2 introduces the negative norm of the gradient and the distance-weighted -functional norm. Section 3 proves the geometry-robust weighted Nečas inequality through local estimates on Whitney cubes and a smooth partition of unity. Section 3.4 then uses the boundary Hardy inequality to derive the norm equivalence as a corollary. Section 4 develops the Stokes preconditioning application, and Section 5 reports numerical experiments. Section 6 concludes.
Mathematical Setting
Let , , be a bounded connected open set. Write . For , define the negative norm of its gradient by
where .
To define the geometrically adapted norm, let
The natural weighted energy space is
We define the distance-weighted -functional norm by
The functional is unchanged when a constant is added to : the change of variables shows . Thus it is naturally a norm on . For completeness, if , there are such that in and in . On every , is bounded below, and hence in . It follows distributionally that in ; connectedness implies that is constant. Therefore (2.4) is a genuine norm on .
A Geometry-Robust Weighted Nečas Inequality
We prove the following distance-weighted inequality.
Theorem 3.1 (Geometry-robust distance-weighted Nečas-type inequality). Let , let be a bounded connected open set, and set . Then
The constant depends only on , independently of the domain.
The proof combines local Nečas estimates on Whitney cubes with a smooth partition of unity. We first establish the covering and local estimates, then construct a competitor for the infimum in (2.4) to obtain (3.1). All constants in the proof depend only on .
Whitney covering and partition of unity
Lemma 3.2 (Whitney covering and partition of unity). There is a countable family of closed cubes with disjoint interiors whose union is . Write for the side length of and set , where the dilation is concentric. There are positive constants , , , , , depending only on , such that the following properties hold. The sets form a locally finite open cover, and
There are functions such that
In particular, in $\Omega.
Proof. The Whitney covering and the bounds in (11)–(12) are standard; see [27 Chapter VI, Section 1], in particular Section 1.3 for the partition of unity. Combining on with gives there; outside , .
Local Nečas estimates and negative-norm localization
For an open set , let denote the negative norm in (2.1) with replaced by .
Lemma 3.3 (Local Nečas estimate on a cube). For every open cube and every ,
The constant is independent of the position and side length of .
This is the classical Nečas inequality [24], scaled from a reference cube.
Lemma 3.4 (Negative-norm localization). Let be a finite or countable family of open subsets of with almost everywhere. Then, for every ,
Proof. Fix a finite subfamily and , and write . Omitting terms with , choose with and . Since , the zero extension of each lies in , and its weak gradient is the zero extension of . Using the same notation for these extensions, set . The overlap bound gives
The definition of the global negative norm implies
Letting proves the estimate for every finite subfamily. Increasing finite subfamilies exhaust the countable case.
Proof of the main theorem
Proof of Theorem 3.1. Take the covering and partition of unity from Lemma 3.2. For , let . Lemmas 3.3 and 3.4 give
Define
Local finiteness implies . Since and , almost everywhere in we have
The second identity uses only cancellation of the partition gradients and does not differentiate . Jensen’s inequality gives
At each point at most summands are nonzero. The bound and the Cauchy–Schwarz inequality yield
Integrating these two inequalities, using Tonelli’s theorem and (3.6), gives
In particular, and , so is an admissible competitor for the infimum in (2.4). Taking square roots in (3.9) proves (3.1).
The theorem requires neither boundary regularity nor a Hardy inequality. The norm equivalence follows by combining it with the Hardy reverse estimate below.
Norm equivalence under the Hardy inequality
The main theorem supplies one side of the equivalence between the distance-weighted norm and the negative norm of the gradient on every bounded connected open set. To obtain the reverse estimate, we now introduce the boundary Hardy inequality, which holds in particular on bounded Lipschitz domains.
Lemma 3.5 (Boundary Hardy inequality on Lipschitz domains). Let be a bounded Lipschitz domain. There exists a constant , depending only on and on the Lipschitz character of , such that
This is the case , of the classical weighted Hardy inequality recalled in [18 Theorem 1.1], extended from to by density; see also [15, 11].
Lemma 3.6 (Hardy reverse estimate). Let be a bounded connected open set satisfying (3.10) with constant . Then
Proof. Let , fix , and first take . Since , integration by parts gives
Hence
For , the div–curl identity reads
In particular, . Using this estimate and the boundary Hardy inequality (19) componentwise,
we obtain
By density of in and continuity of the gradient pairing, the same bound holds for all . Dividing by and taking the supremum over gives a bound for . The Cauchy–Schwarz inequality in , followed by the infimum over , yields
This proves (20).
Corollary 3.7 (Distance-weighted norm equivalence). Under the assumptions of Lemma 3.6,
where depends only on . In particular, the equivalence holds on bounded connected Lipschitz domains, with the upper constant controlled by their Hardy constants.
Proof. Combine Theorem 3.1 with Lemma 3.6.
Remark 3.8 (Uniform Hardy constants). The Hardy constant admits geometry-independent bounds in several important classes. For bounded convex domains in any dimension, one may take [17]. For bounded simply connected planar domains, Ancona’s result gives [4]; see also Laptev–Sobolev [17], who obtain improved bounds for geometrically restricted classes of simply connected planar domains. The bound is unaffected by variations in channel width, bends, or constrictions, provided the planar domain remains simply connected.
For sufficient conditions ensuring uniform Hardy constants in multiply connected domains and in higher dimensions, see Korte–Lehrbäck–Tuominen [16].
Application to Stokes Preconditioning
The Stokes problem and pressure Schur complement
We now apply the norm equivalence to preconditioning the steady incompressible Stokes problem on a bounded connected Lipschitz domain:
Here is the viscosity, is the body force, and is prescribed velocity data with zero net boundary flux. We set in all experiments. After lifting the boundary data, the variational formulation uses the velocity space with norm and the pressure space . The classical Nečas inequality (1.2) is equivalent to the Stokes inf-sup condition, with for the optimal Nečas constant and the Stokes inf-sup constant ; see [6].
Let and be an inf-sup stable conforming finite-element pair. For unit viscosity, let be the matrix of and the matrix of . After lifting the boundary data, the discrete Stokes problem has the form
Eliminating the velocity gives the pressure Schur complement . Its quadratic form is
where is the coefficient vector of . Thus a block solver needs an approximation to as well as a velocity solver. Forming is generally expensive because it contains .
The corresponding continuous Schur complement has quadratic form , by the definition in (2.1). A pressure mass inverse uses the norm to approximate this form. The classical estimates give
so the mass-based bound can deteriorate as decreases. For the weighted pressure norm, Corollary 3.7 gives
This identifies the distance-weighted norm as a pressure metric whose equivalence constants are controlled by the dimension and the Hardy constant. Approximating the Schur complement by the operator associated with this norm follows the operator-preconditioning framework of [22, 19].
From the weighted norm to a pressure preconditioner
Assume for a pressure space containing constants, and let approximate the boundary distance. Since is bounded, . In a basis of the mean-zero pressure space, let and be the matrices of
All pressure matrices and inverses in this section are restricted to the mean-zero space; the weighted stiffness matrix is assumed positive definite there. The stiffness form imposes natural Neumann conditions on the auxiliary pressure problem.
Restricting the infimum in (9) to and using the discrete distance gives
Restricting to have zero mean does not change this minimum: removing its mean reduces the first term and leaves the second term unchanged. In coefficient vectors, (26) becomes
The minimizing vector satisfies . Hence , and the minimum is
We use this norm matrix as the pressure preconditioner. Its inverse is the sum
This additive inverse can be viewed in the space decomposition and subspace correction framework of Xu [30], with the two components and measured by the mass and weighted stiffness energies, respectively. Applying amounts to adding the results of a pressure mass solve and a distance-weighted stiffness solve. The weight uses local geometric information directly, whereas a constant-scale inverse block assigns one coefficient to the whole domain.
The matrix identity (27) is exact. To obtain uniform spectral bounds for from (25), one additionally needs uniform comparison of the discrete supremum in (24) with the continuous negative norm, and of (26) with . If these comparisons hold uniformly, then
where denotes the ratio of the largest to smallest eigenvalue. The constants depend on the comparison bounds as well as the dimension and the Hardy constant. Thus the continuous result motivates the discrete block, while its spectral quality and the effect of approximate auxiliary solves are assessed in Section 5.
For the full Stokes system, we use an upper triangular block preconditioner [19], with approximating :
where approximates .
Numerical Results
We begin with the unit square to verify the basic performance of the distance-weighted pressure block from Section 4 and examine its sensitivity to mesh refinement. Slender channels and periodic pillar arrays provide benchmarks with a natural global length scale, for which existing analyses motivate scale-dependent pressure preconditioners [25, 29]. Comparisons with the pressure mass matrix and a constant-scale sum-space block test whether the boundary-distance weight recovers the effectiveness of these scale-specific choices. To examine local adaptation, we extend these settings to tapered channels, arrays with nonuniform pillar counts, and composite porous–channel domains. These variants test whether the same weight remains effective when different parts of a domain have competing geometric scales, without choosing a new global scale for each configuration. Figure 1 and Figure 2 illustrate the test geometries.

Figure 1. Construction parameters for channels and pillar arrays. Grey circles are solid pillars; schematics are not to scale.

Figure 2. Construction of the composite domain. Grey regions are solid.
Common experimental setup
Test geometries
The square baseline provides a mesh-refinement control. Slender channels test aspect-ratio effects on pressure stability [9] and width-scaled preconditioning [25]. Tapered channels extend the test to variable local widths, as considered in [25 Remark 3 and Example 5]. Both channel families are described by
where is the maximum width and is the ratio of maximum to minimum width. The case gives the rectangular slender channel .
Periodic pillar arrays test the density-dependent stability and pore-scale pressure norms studied in [28, 29]. They are obtained by removing circular pillars from the unit square. Their centres are , , and their radius is , where is the radius relative to the period . The graded-density array tests spatially varying pore scales, a feature of heterogeneous rock geometries [23]. It also lies in the unit square, with equal-radius pillars () in four columns at , . Column contains pillars with vertical coordinates , . Thus the pillar count increases from one in the first column to in the last. Figure 1 illustrates the channel and pillar-array parameters.
The composite domain is motivated by DLD devices combining pillar arrays with open collection regions [20]. We use a simplified geometry with coexisting pore, chamber, and throat scales. It is formed by removing circular pillars and two rectangular wall blocks from . Its square porous region contains pillars with centres and radius
where and , so the vertical clearances between rows and at the outer walls are equal. The wall blocks occupy
leaving a throat of width centred at . An open chamber separates the porous region from the throat, followed by an open outlet; see Figure 2 for the construction. is the pillar count, is the radius relative to the horizontal pillar spacing, and is the throat width. Parameter ranges and fixed values for each experiment are given below.
Discretization and pressure blocks
All numerical experiments consider the two-dimensional Stokes equations (22). Velocity has prescribed parabolic profiles at the left and right boundaries, with homogeneous Dirichlet conditions on all remaining walls, including every obstacle. We use Taylor–Hood elements with continuous velocity and continuous pressure, restricted to
The boundary distance is approximated by a continuous finite-element function on triangular meshes generated with Gmsh. We use to avoid the identically zero distance interpolant on triangles whose three vertices lie on the boundary.
We use the pressure mass matrix and distance-weighted stiffness matrix from § 4.2, and let denote the unweighted Neumann stiffness matrix. We compare the pressure preconditioners
Preconditioning applies for each choice of . All inverses are interpreted on the mean-zero pressure space, with natural Neumann conditions for the auxiliary stiffness operators. We prescribe , following the reduced channel model of Sande et al. [25 Section 5]. The factor comes from averaging the parabolic velocity profile between two parallel no-slip walls. For channels, is the maximum width; for periodic arrays, it is the period; for the graded-density array, it is the horizontal distance between the centre lines of adjacent pillar columns; for the composite domain, it is the horizontal centre-to-centre pillar spacing in its porous region; and for the unit-square baseline, it is one. Figure 3 illustrates these choices. The use of this channel coefficient on other geometries specifies a reproducible baseline, rather than an optimal coefficient.

Figure 3. Reference lengths (blue arrows) for the constant-scale pressure block. Grey regions are solid; schematics are not to scale.
For a more demanding constant-coefficient comparison, we also compute for on every matrix. We denote by the best tested constant envelope. For each test case, we select the coefficient giving the smallest condition number among the five candidates. For the FGMRES comparisons with AMG auxiliary solves, we separately select the coefficient giving the fewest iterations among the same five candidates.
Spectral diagnostics
We examine the eigenproblem on , where is the pressure Schur complement. Its equivalent generalized form is
For , the right-hand matrix is ; for either sum-space block,
The smallest and largest eigenvalues of on are denoted by and , respectively. Their Rayleigh quotient characterizations are
Thus and are the optimal lower and upper constants comparing the Schur complement and preconditioner quadratic forms. We report their ratio as the spectral condition number, and list both endpoints for . For , the denominator is by (27). The corresponding continuous comparison in (25) gives
Thus and correspond to the geometry-independent lower bound and the Hardy-dependent upper bound, respectively. We assume that the discrete negative and weighted norms are uniformly comparable to their continuous counterparts in both mesh size and geometry, so these bounds carry over up to the comparison constants.
Prescribed flow and Krylov solver
There is no body force. On a vertical inlet or outlet of height , starting at , we prescribe
The inlet mean speed is one, so . The same flux is used at the outlet to ensure compatibility with incompressibility. After lifting these boundary data, the velocity correction belongs to . The lifting changes only the right-hand side, so the Schur complement uses the homogeneous velocity space introduced in § 4.1.
For each pressure block, the full system is solved with the upper triangular preconditioner (30). The exact stage uses sparse direct solves for the auxiliary blocks. The AMG stage uses one BoomerAMG V-cycle for each inverse application. Both stages use right-preconditioned FGMRES with a relative PETSc tolerance of ; converged runs must also satisfy a measured true relative residual of . All iteration counts refer to outer FGMRES iterations; the labels Exact and AMG distinguish the auxiliary solvers. All methods use the same convergence tolerances. NC denotes failure of FGMRES to converge within 500 iterations.
Refinement controls and square baseline
The square is tested on six mesh levels, ; the slender, periodic, and composite controls are refined at fixed geometry and (Table 1). The refinement factor scales the target mesh size by ; is the maximum element diameter, and is the number of mean-zero pressure degrees of freedom.
Refinement at fixed geometry. The slender width is ; the periodic parameters are , ; the composite parameters are , , . The endpoints and are for ; is the spectral condition number. Exact and AMG give its FGMRES iteration counts for the corresponding auxiliary solves.
| Geometry | Exact | AMG | |||||||||
| Square | 1 | 0.2545 | 43 | 4.46 | 4.43 | 4.35 | 3.36 | 0.534 | 1.798 | 14 | 17 |
| Square | 2 | 0.1214 | 143 | 4.67 | 5.02 | 4.66 | 3.93 | 0.539 | 2.122 | 17 | 18 |
| Square | 4 | 0.0699 | 509 | 4.82 | 5.40 | 4.84 | 4.52 | 0.539 | 2.437 | 17 | 20 |
| Square | 8 | 0.0294 | 1934 | 4.93 | 5.67 | 4.97 | 5.06 | 0.539 | 2.726 | 18 | 21 |
| Square | 16 | 0.0168 | 7546 | 5.01 | 5.87 | 5.07 | 5.53 | 0.540 | 2.983 | 18 | 21 |
| Square | 32 | 0.0081 | 29983 | 5.08 | 6.01 | 5.15 | 5.98 | 0.539 | 3.227 | 18 | 22 |
| Slender | 1 | 0.0094 | 799 | 1246.40 | 7.60 | 5.46 | 4.70 | 0.532 | 2.499 | 16 | 22 |
| Slender | 2 | 0.0051 | 2703 | 1246.39 | 8.75 | 5.97 | 5.21 | 0.539 | 2.806 | 16 | 23 |
| Periodic | 1 | 0.0216 | 4561 | 89.71 | 12.88 | 11.34 | 5.03 | 0.539 | 2.707 | 18 | 22 |
| Periodic | 2 | 0.0105 | 16529 | 90.35 | 12.90 | 12.21 | 5.48 | 0.539 | 2.952 | 18 | 23 |
| Composite | 1 | 0.0347 | 3687 | 1183.17 | 29.49 | 29.49 | 5.23 | 0.543 | 2.838 | 20 | 23 |
| Composite | 2 | 0.0175 | 13952 | 1192.33 | 29.45 | 29.45 | 5.65 | 0.543 | 3.068 | 20 | 24 |
Table 1.
The smallest eigenvalues of in Table 1 remain near 0.539 across the different geometries and mesh levels, consistent with the geometry-independent lower bound in (25). The increase in under refinement is consistent with richer finite-element spaces resolving additional pressure modes. On the convex domains, all computed upper endpoints remain below 5, the continuous upper bound obtained from . Across all four domain types, the weighted condition numbers remain modest, ranging from 3.36 to 5.98, and the FGMRES iteration counts remain stable under refinement with both exact and AMG auxiliary solves.
Slenderness and spatially varying width
For slender channels , we vary from $1/41/128$, with and . In the spectral subset, narrowing the channel from to $1/32 raises from 20.96 to 1246.39, while remains between 8.13 and 8.75 and between 5.01 and 5.21 (Table 2). Both sum-space blocks therefore compensate for uniform slenderness.
| Geometry | Parameter | |||||||
| Slender | 2703 | 1246.39 | 8.75 | 5.97 | 5.21 | 0.539 | 2.806 | |
| Slender | 1417 | 312.68 | 8.71 | 5.96 | 5.21 | 0.539 | 2.806 | |
| Slender | 682 | 79.25 | 8.59 | 5.88 | 5.15 | 0.539 | 2.779 | |
| Slender | 361 | 20.96 | 8.13 | 5.62 | 5.01 | 0.539 | 2.697 | |
| Taper | 4916 | 20.96 | 9.33 | 6.20 | 5.97 | 0.539 | 3.217 | |
| Taper | 8252 | 49.31 | 8.59 | 8.59 | 6.09 | 0.539 | 3.278 | |
| Taper | 10125 | 65.30 | 12.16 | 12.16 | 6.10 | 0.539 | 3.284 | |
| Taper | 11903 | 80.01 | 19.91 | 18.69 | 6.09 | 0.540 | 3.290 |
Table 2. Channel spectral results. Slender channels use ; tapered channels use locally refined physical meshes at and maximum width . Taper contrasts are shown at . The condition numbers compare all four blocks; the last two columns give the endpoints of .
We then fix and introduce tapering, with width contrast up to 8 for the spectral tests and 48 for the FGMRES tests . As increases from 1 to 8, rises from 9.33 to 19.91, and even the tuned increases from 6.20 to 18.69. In comparison, stays between 5.97 and 6.10 (Table 2).
A single width provides an effective global scale for a uniform channel; the distance weight also follows the changing local width in a tapered channel. Across both families, remains near 0.539, consistent with the geometry-independent lower bound. The FGMRES results in Table 3 show the same robustness to both uniform narrowing and spatial width variation. The mass block deteriorates under narrowing, while the constant-scale blocks lose robustness as the width contrast increases.
| Slender | |||||||||||
| 29 | 33 | 36 | 45 | 54 | 97 | 155 | 198 | 262 | NC | NC | |
| 24 | 24 | 23 | 26 | 26 | 25 | 25 | 26 | 26 | 26 | 26 | |
| 24 | 24 | 23 | 25 | 25 | 25 | 25 | 25 | 25 | 26 | 26 | |
| 20 | 21 | 21 | 22 | 23 | 23 | 23 | 23 | 23 | 24 | 24 | |
| Taper | 1 | 2 | 3 | 4 | 6 | 8 | 12 | 16 | 24 | 32 | 48 |
| 28 | 36 | 38 | 40 | 43 | 45 | 48 | 50 | 53 | 56 | 58 | |
| 25 | 28 | 30 | 31 | 32 | 34 | 36 | 39 | 41 | 44 | 47 | |
| 25 | 28 | 30 | 31 | 31 | 32 | 35 | 36 | 39 | 42 | 44 | |
| 23 | 24 | 25 | 25 | 25 | 25 | 26 | 25 | 25 | 26 | 25 |
Table 3. FGMRES iteration counts for channel problems with one-cycle AMG auxiliary solves. Slender channels use ; tapered channels use physical meshes at . Each column is a parameter value; NC denotes failure to converge within 500 iterations.
Obstacle density and obstacle size
For the periodic arrays defined in Section 5.1.1, the period is , the radius is , and we set . We separate changes in the overall pore scale from changes in the contrast between local scales. The density sweep fixes and uses
The obstacle count increases from 4 to 4096, with pillars and passages shrinking together. The size sweep fixes and varies over twelve values between 0.1 and 0.495. As approaches , the passages between neighbouring pillars become arbitrarily narrow, while the wider pore regions retain a scale comparable to . This increases the contrast between local boundary-distance scales within the same domain, which a single period-based coefficient cannot track.
Table 4 shows that the smallest eigenvalues of remain between 0.538 and 0.539 in both sweeps. Both sum-space blocks remain stable as density increases. As the radius increases, however, the weighted condition number changes little while the tuned constant envelope deteriorates. The FGMRES results in Table 5 show the same distinction: at , the weighted block retains stable convergence, while the mass block and all five constant candidates fail to converge within 500 iterations.
| Sweep | Parameter | |||||||
| Density | 1173 | 40.61 | 12.04 | 9.78 | 4.80 | 0.539 | 2.589 | |
| Density | 4561 | 89.71 | 12.88 | 11.34 | 5.03 | 0.539 | 2.707 | |
| Density | 18112 | 292.45 | 13.11 | 11.83 | 5.08 | 0.539 | 2.737 | |
| Size | 15394 | 28.06 | 10.26 | 8.81 | 5.51 | 0.538 | 2.965 | |
| Size | 4561 | 89.71 | 12.88 | 11.34 | 5.03 | 0.539 | 2.707 | |
| Size | 16308 | 606.01 | 54.75 | 21.74 | 5.26 | 0.539 | 2.836 | |
| Size | 46561 | 2574.97 | 202.18 | 59.14 | 5.42 | 0.539 | 2.921 |
Table 4. Obstacle spectral results. Density varies at ; size varies at . The last two columns are the endpoints of .
| Density | 2 | 3 | 4 | 6 | 8 | 10 | 12 | 16 | 24 | 32 | 48 | 64 |
| 53 | 64 | 73 | 121 | 142 | 153 | 170 | 197 | 379 | NC | NC | NC | |
| 35 | 34 | 37 | 35 | 35 | 35 | 35 | 37 | 36 | 36 | 36 | 35 | |
| 27 | 29 | 31 | 32 | 32 | 31 | 31 | 32 | 31 | 32 | 31 | 31 | |
| 21 | 22 | 22 | 22 | 23 | 23 | 23 | 23 | 24 | 24 | 24 | 24 | |
| Size | 0.1 | 0.2 | 0.25 | 0.3 | 0.35 | 0.4 | 0.425 | 0.45 | 0.46 | 0.475 | 0.49 | 0.495 |
| 42 | 61 | 73 | 97 | 140 | 182 | 268 | 428 | NC | NC | NC | NC | |
| 28 | 31 | 37 | 43 | 54 | 76 | 111 | 152 | 220 | 270 | NC | NC | |
| 28 | 31 | 31 | 33 | 37 | 45 | 57 | 76 | 89 | 132 | 283 | NC | |
| 22 | 22 | 22 | 23 | 23 | 23 | 24 | 25 | 26 | 27 | 25 | 25 | |
| Graded | 1 | 2 | 4 | 8 | 16 | 32 | 64 | 80 | 90 | 96 | 98 | 99 |
| 30 | 33 | 35 | 40 | 48 | 64 | 83 | 166 | 234 | NC | NC | NC | |
| 28 | 28 | 29 | 30 | 35 | 45 | 63 | 75 | 115 | 202 | 346 | NC | |
| 25 | 26 | 28 | 30 | 35 | 45 | 63 | 75 | 115 | 202 | 291 | NC | |
| 22 | 23 | 24 | 23 | 24 | 24 | 27 | 27 | 28 | 28 | 29 | 30 |
Table 5. FGMRES iteration counts for obstacle arrays with one-cycle AMG auxiliary solves. Each column is a parameter value; NC denotes failure to converge within 500 iterations. The density and size sweeps respectively fix and ; the graded-density sweep varies with four columns and equal radii.
Increasing pillar counts across columns
For the graded-density array defined in § 5.1.1, we increase from 1 to 99 while keeping the pillar radius and column positions fixed. This creates increasingly narrow gaps in the denser columns. The weighted block remains robust throughout the sweep, whereas the mass block and all five constant candidates fail to converge within 500 iterations at Table 5. These results illustrate the benefit of tracking local scales when the pillar density varies within one domain.
Composite porous–channel geometry
Composite porous–channel geometry. Numerical simulations of microfluidic devices, such as deterministic lateral displacement (DLD) chips, often involve flow passages of different widths within the same geometry. We illustrate this feature with a simplified composite domain defined in § 5.1.1, combining a porous array, an open chamber, and a narrow passage. The prescribed constant uses the porous horizontal pitch, .
Three independent sweeps use twelve values each: (i) from 0.2 to 0.005 at , ; (ii) at , ; and (iii) from 0.1 to 0.495 at , . This design tests whether a local pressure weight can accommodate porous, open, and narrow-channel scales within the same domain. Figure 4 illustrates the computed flow and local boundary distance on a denser composite with , , and .

Figure 4. Computed dense composite flow at , , (64 pillars): velocity magnitude and streamlines (left), mean-zero pressure (centre), and boundary distance (right).
The composite gives the clearest separation between local and global scaling because pore gaps, wide chambers, and a narrow throat coexist. The weighted block remains robust under changes in throat width, obstacle density, and obstacle radius, while the mass and constant-scale blocks deteriorate markedly (Table 6). At , the mass block and all five constant candidates fail to converge within 500 iterations. The spectral subset also shows a factor of 16.75 improvement over the five-candidate envelope at .
| Throat | 0.2 | 0.15 | 0.1 | 0.075 | 0.05 | 0.04 | 0.03 | 0.025 | 0.02 | 0.015 | 0.01 | 0.005 |
| 68 | 68 | 72 | 90 | 81 | 113 | 166 | 157 | 207 | 207 | 439 | NC | |
| 33 | 34 | 37 | 39 | 44 | 46 | 52 | 55 | 60 | 70 | 94 | 395 | |
| 33 | 34 | 37 | 39 | 44 | 46 | 52 | 55 | 60 | 70 | 94 | 395 | |
| 22 | 22 | 23 | 23 | 23 | 24 | 25 | 25 | 25 | 25 | 26 | 27 | |
| Density | 2 | 3 | 4 | 5 | 6 | 8 | 10 | 12 | 16 | 24 | 32 | 64 |
| 60 | 72 | 114 | 168 | 185 | 235 | 298 | 347 | 450 | NC | NC | NC | |
| 36 | 37 | 39 | 41 | 45 | 53 | 60 | 66 | 80 | 117 | 154 | 294 | |
| 33 | 37 | 39 | 41 | 45 | 53 | 60 | 66 | 79 | 109 | 145 | 269 | |
| 22 | 23 | 23 | 24 | 24 | 24 | 24 | 24 | 25 | 25 | 27 | 29 | |
| Size | 0.1 | 0.15 | 0.2 | 0.25 | 0.3 | 0.35 | 0.4 | 0.45 | 0.46 | 0.475 | 0.49 | 0.495 |
| 56 | 58 | 64 | 72 | 112 | 112 | 238 | NC | NC | NC | NC | NC | |
| 34 | 34 | 35 | 37 | 40 | 50 | 66 | 138 | 140 | 189 | 463 | NC | |
| 34 | 34 | 35 | 37 | 40 | 44 | 55 | 87 | 101 | 163 | 376 | NC | |
| 24 | 24 | 23 | 23 | 22 | 23 | 23 | 24 | 24 | 24 | 26 | 26 |
Table 6. FGMRES iteration counts for composite domains with one-cycle AMG auxiliary solves. Each column is a parameter value; NC denotes failure to converge within 500 iterations. Fixed parameters are as in Table 7.
The refinement control in Table 1 supports the persistence of this robustness under mesh refinement. Table 7 records the corresponding spectral subset. The weighted lower endpoints again cluster near 0.54, ranging from 0.541 to 0.547, while the upper endpoints remain bounded over these sweeps.
| Sweep | Parameter | |||||||
| Throat | 13820 | 7767.48 | 112.95 | 95.24 | 5.69 | 0.544 | 3.093 | |
| Throat | 3687 | 1183.17 | 29.49 | 29.49 | 5.23 | 0.543 | 2.838 | |
| Throat | 2831 | 283.90 | 15.81 | 15.81 | 5.06 | 0.542 | 2.743 | |
| Density | 3654 | 1156.56 | 39.70 | 30.80 | 5.23 | 0.543 | 2.838 | |
| Density | 3687 | 1183.17 | 29.49 | 29.49 | 5.23 | 0.543 | 2.838 | |
| Density | 4949 | 1223.57 | 25.62 | 25.62 | 5.35 | 0.541 | 2.895 | |
| Size | 17356 | 1185.71 | 32.79 | 32.79 | 5.69 | 0.544 | 3.093 | |
| Size | 3687 | 1183.17 | 29.49 | 29.49 | 5.23 | 0.543 | 2.838 | |
| Size | 11845 | 2105.64 | 70.71 | 62.53 | 5.63 | 0.547 | 3.083 |
Table 7. Composite spectral results. The throat sweep fixes , ; the density sweep fixes , ; the size sweep fixes , . The last two columns are the endpoints of . Larger iteration-only cases appear in Table 6.
Conclusion
Conclusion. The main result is a distance-weighted Nečas-type inequality on every bounded connected open set: , with depending only on the dimension. Local Nečas estimates on enlarged Whitney cubes and negative-norm localization control the local oscillations. A smooth partition of unity combines the cube averages into a competitor in the natural weighted energy space, with both terms in the -functional controlled by those oscillations.
Equivalence with the negative norm of the gradient follows as a corollary when the boundary Hardy inequality holds. The reverse estimate has constant , so the Hardy constant is the only domain-dependent quantity in the resulting equivalence. The corollary is uniform on families with uniformly bounded Hardy constants; for all bounded simply connected planar domains, the reverse constant can be chosen as . It motivates a pressure preconditioner that adapts to the local boundary distance, as examined in § 5.
The central numerical finding is that stays close to 0.54 across the reported geometries and mesh refinements. This common empirical lower spectral level is consistent with the geometry-independent lower bound in the continuous estimate. Across the geometric sweeps, the distance-weighted block consistently requires about 20–30 FGMRES iterations with AMG auxiliary solves. The mass and constant-scale blocks lose robustness as the geometry becomes more extreme; in the near-contact array and composite tests, the mass block and all five constant candidates fail to converge within 500 iterations. Extending these controls to graded DLD chips and geological porous media, with scalable weighted auxiliary solves, is a next step.
References
References
- [1]G. Allaire, Homogenization of the Navier–Stokes equations in open sets perforated with tiny holes I: Abstract framework, a volume distribution of holes, Archive for Rational Mechanics and Analysis, 113 (1991), pp. 209–259, https://doi.org/10.1007/BF00375065.
- [2]G. Allaire, Homogenization of the Navier–Stokes equations in open sets perforated with tiny holes II: Non-critical sizes of the holes for a volume distribution and a surface distribution of holes, Archive for Rational Mechanics and Analysis, 113 (1991), pp. 261–298, https://doi.org/10.1007/bf00375066.
- [3]C. Amirouche, P. G. Ciarlet, and C. Mardare, On a lemma of Jacques-Louis Lions and its relation to other fundamental results, Journal de Mathématiques Pures et Appliquées, 104 (2015), pp. 207–226, https://doi.org/10.1016/j.matpur.2014.11.007.
- [4]A. Ancona, On strong barriers and an inequality of Hardy for domains in ℝⁿ, Journal of the London Mathematical Society, 34 (1986), pp. 274–290, https://doi.org/10.1112/jlms/s2-34.2.274.
- [5]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.
- [6]J. H. Bramble, A proof of the inf-sup condition for the Stokes equations on Lipschitz domains, Mathematical Models and Methods in Applied Sciences, 13 (2003), pp. 361–371, https://doi.org/10.1142/S0218202503002544.
- [7]J. H. Bramble and J. E. Pasciak, A preconditioning technique for indefinite systems resulting from mixed approximations of elliptic problems, Mathematics of Computation, 50 (1988), pp. 1–17, https://doi.org/10.1090/S0025-5718-1988-0917816-8.
- [8]E. V. Chizhonkov and M. A. Olshanskii, On the domain geometry dependence of the LBB condition, ESAIM: Mathematical Modelling and Numerical Analysis, 34 (2000), pp. 935–951, https://doi.org/10.1051/m2an:2000110.
- [9]M. Dobrowolski, On the LBB constant on stretched domains, Mathematische Nachrichten, 254–255 (2003), pp. 64–67, https://doi.org/10.1002/mana.200310052.
- [10]M. Dobrowolski, On domain-robust preconditioners for the Stokes equations, Electronic Transactions on Numerical Analysis, 39 (2012), pp. 60–74, https://etna.ricam.oeaw.ac.at/vol.39.2012/pp60-74.dir/pp60-74.pdf.
- [11]M. Egert, R. Haller-Dintelmann, and J. Rehberg, Hardy’s inequality for functions vanishing on a part of the boundary, Potential Analysis, 43 (2015), pp. 49–78, https://doi.org/10.1007/s11118-015-9463-8.
- [12]H. C. Elman, D. J. Silvester, and A. J. Wathen, Finite Elements and Fast Iterative Solvers: With Applications in Incompressible Fluid Dynamics, Oxford University Press, 2014.
- [13]C. A. Figueroa, I. E. Vignon-Clementel, K. E. Jansen, T. J. R. Hughes, and C. A. Taylor, A coupled momentum method for modeling blood flow in three-dimensional deformable arteries, Computer Methods in Applied Mechanics and Engineering, 195 (2006), pp. 5685–5706, https://doi.org/10.1016/j.cma.2005.11.011.
- [14]V. Girault and P.-A. Raviart, Finite Element Methods for Navier–Stokes Equations: Theory and Algorithms, vol. 5 of Springer Series in Computational Mathematics, Springer-Verlag, 1986, https://doi.org/10.1007/978-3-642-61623-5.
- [15]P. Grisvard, Elliptic Problems in Nonsmooth Domains, vol. 69 of Classics in Applied Mathematics, SIAM, 2011. Originally published by Pitman, 1985.DOI
- [16]R. Korte, J. Lehrbäck, and H. Tuominen, The equivalence between pointwise Hardy inequalities and uniform flatness, Mathematische Annalen, 351 (2011), pp. 711–731, https://doi.org/10.1007/s00208-010-0617-0.
- [17]A. Laptev and A. V. Sobolev, Hardy inequalities for simply connected planar domains, American Mathematical Society Translations, Series 2, 225 (2008), pp. 133–140, https://doi.org/10.1090/trans2/225/09.
- [18]J. Lehrbäck, Weighted Hardy inequalities beyond Lipschitz domains, Proceedings of the American Mathematical Society, 142 (2014), pp. 1705–1715, https://doi.org/10.1090/S0002-9939-2014-11904-6.
- [19]D. Loghin and A. J. Wathen, Analysis of preconditioners for saddle-point problems, SIAM Journal on Scientific Computing, 25 (2004), pp. 2029–2049, https://doi.org/10.1137/S1064827502418203.
- [20]K. Loutherback, J. D’Silva, L. Liu, A. Wu, R. H. Austin, and J. C. Sturm, Deterministic separation of cancer cells from blood at 10 mL/min, AIP Advances, 2 (2012), 042107, https://doi.org/10.1063/1.4758131.
- [21]Y. Lu, Homogenization of Stokes equations in perforated domains: A unified approach, Journal of Mathematical Fluid Mechanics, 22 (2020), 44, https://doi.org/10.1007/s00021-020-00506-6.
- [22]K.-A. Mardal and R. Winther, Preconditioning discretizations of systems of partial dif- ferential equations, Numerical Linear Algebra with Applications, 18 (2011), pp. 1–40, https://doi.org/10.1002/nla.716.
- [23]P. Mostaghimi, M. J. Blunt, and B. Bijeljic, Computations of absolute permeability on micro-CT images, Mathematical Geosciences, 45 (2013), pp. 103–125, https://doi.org/10.1007/s11004-012-9431-4.
- [24]J. Nečas, Les méthodes directes en théorie des équations elliptiques, Academia, Prague, and Masson, Paris, 1967.
- [25]E. Sande, T. Koch, M. Kuchta, and K.-A. Mardal, On a robust inf-sup condition for the Stokes problem in slender domains – with application to preconditioning. arXiv preprint, 2025, https://arxiv.org/abs/2510.24590.
- [26]L. Shen, Y. Zhang, Y. Chen, X. Ding, P. Wen, C. Wang, P. Sun, S. Gong, J. Xu, J. Han, and Y. Chen, A high-fidelity 3D fluid-structure interaction framework for predictive microfluidic design, 2026, https://doi.org/10.64898/2026.04.28.721227. bioRxiv preprint.
- [27]E. M. Stein, Singular Integrals and Differentiability Properties of Functions, vol. 30 of Princeton Mathematical Series, Princeton University Press, Princeton, NJ, 1970.
- [28]Q. Xin, S. Gong, and J. Xu, Sharp inf-sup estimate for the Stokes equation in tight domains with periodic pillars and some numerical implications. arXiv preprint, 2026, https://arxiv.org/abs/2604.12643.
- [29]Q. Xin, Y. Xie, C.-S. Zhang, S. Gong, and J. Xu, Uniform inf-sup norm equivalence and robust operator preconditioning for Stokes flow in tight domains with periodic pillars. arXiv preprint, 2026, https://arxiv.org/abs/2609.06999.
- [30]J. Xu, Iterative methods by space decomposition and subspace correction, SIAM Review, 34 (1992), pp. 581–613, https://doi.org/10.1137/1034116.