- The paper introduces an exact divergence-form splitting that removes the Dirac measure from the conservation equation without regularizing the data, allowing mixed finite element methods to handle poles located at mesh vertices and coefficient interfaces.
- The analysis proves sharp quasi-uniform flux convergence of order h^(2/p−1) for 1<p<2, while graded meshes restore first-order complexity O(N^−1/2); scalar errors remain asymptotically first-order up to a logarithmic factor.
- The paper establishes an Lp residual estimator and numerical results confirm the predicted rates, while showing that divergent discrete L2 flux norms reflect the exact singularity rather than a failure of the method.
The failure is one of duality, not of regularity
The paper considers the diffusion problem −(A∇u)=f1+δx0 in a bounded simply connected Lipschitz domain Ω⊂R2 with Dirichlet data, where A is symmetric uniformly elliptic. Its central diagnosis is that for a mixed method a Dirac source is not primarily an approximation problem but a duality problem (2608.17575). A mixed formulation tests the conservation equation against the scalar space, which by design is a Lebesgue space; since δx0 lies in the dual of no Lebesgue space, the pairing is undefined at the continuous level, before any mesh exists. The standard escapes—point evaluation on continuous spaces, discrete representers, or regularization—all act on the datum, and the representer route additionally requires x0 to lie in the interior of an element, which conflicts with fitting the mesh to coefficient interfaces.
The remedy changes the unknown rather than the datum. An explicit field
f2(x):=2π1∣x−x0∣2x−x0,divf2=δx0,
is subtracted from the physical flux, giving the modified flux σ:=−A∇u−f2 with divσ=f1. The conservation law becomes an ordinary Lp equation testable against the full Lebesgue space; the singular field survives only in the constitutive equation, where H\"older's inequality suffices. Eliminating σ rewrites the problem as Ω⊂R20, exactly equivalent to the original problem with no parameter introduced and no datum perturbed, but with right-hand side in divergence form generated by an Ω⊂R21 field—the standard data class for second-order elliptic problems. The field Ω⊂R22 depends on Ω⊂R23 alone: not on Ω⊂R24, not on lower-order terms, and not on the discretization, so only load assembly changes and Ω⊂R25 may be a mesh vertex.
The paper contrasts this with the ideal splitting using Ω⊂R26 from a singular solution of the operator itself, which returns Ω⊂R27 to Ω⊂R28 when available (e.g., Ω⊂R29 a constant scalar matrix near A0). Matching is defined as square-integrability of the modified flux near the pole; for a discontinuous coefficient it is a condition coupling traces from all sides, and matching the singular potential is shown to differ from matching the singular flux. In every unmatched configuration analyzed—coefficient jumps or anisotropy at the pole—the mismatch retains a homogeneous A1 part, so that A2 for every A3 but A4. The entire error analysis must therefore leave the Hilbert scale.
Flux error analysis below the Hilbert exponent
The analytic input is Dur\'an's A5 stability estimate for the solenoidal projection onto the discrete kernel, stated as Hypothesis (SP) or its two-term form (SPA6), in which the degenerating A7-dependence multiplies only a data-oscillation term. Under (SP) the paper proves a quasi-best approximation bound over the equilibrated affine subspace A8 with no data-oscillation term; under (SPA9) the leading constant does not degenerate as δx00. A notable limitation is conceded here explicitly: Dur\'an's result requires a smooth domain, quasi-uniform meshes, and a Lipschitz scalar coefficient, and its stream-function reduction is two-dimensional; outside that setting the stability estimate is kept as a hypothesis.
On quasi-uniform fitted meshes the flux error is exactly of order δx01. The upper bound combines the patch construction with elementwise interpolation; the matching lower bound comes from the single element carrying the pole via a scaling argument requiring only that the leading δx02 part of δx03 be nonzero there. This establishes that the slow rate is a property of the singularity, not of the method. Two further technical contributions are needed: first, an example of a piecewise anisotropic coefficient (two sectors meeting at the pole) for which the canonical Raviart–Thomas normal moments of δx04 are non-integrable on edges through the pole, so the degrees of freedom themselves are undefined—an equilibrated comparison flux is instead constructed by local flux balance on the patch, solvable because the splitting has removed the measure from the divergence theorem; second, grading past the barrier. Balancing local indicators yields graded meshes with exponent δx05 restoring first-order complexity, δx06, versus δx07 on quasi-uniform families (δx08 at δx09).
The scalar variable
Two routes transfer the flux estimates to the potential. The unconditional route uses a discrete x00 inf–sup condition obtained by lifting the divergence directly in the graph-norm dual, avoiding the inverse inequality whose factor x01 would destroy convergence entirely. Under dual regularity (piecewise x02 of the dual problem), a Douglas–Roberts duality argument gains the factor x03, converting the flux rate into a first-order bound on x04 independent of x05. Combined with the Pythagorean identity splitting x06 into best approximation plus the projected error, the total scalar error is asymptotically the best x07 approximation of x08, of order x09 under a nonvanishing logarithmic leading term. The logarithm is accumulated over all dyadic annuli between f2(x):=2π1∣x−x0∣2x−x0,divf2=δx0,0 and a fixed radius—a property of the singularity and of f2(x):=2π1∣x−x0∣2x−x0,divf2=δx0,1, not of the method—and grading removes it.
A posteriori estimation in the Lebesgue scale
The a posteriori theory rests on a residual norm equivalence in f2(x):=2π1∣x−x0∣2x−x0,divf2=δx0,2: for f2(x):=2π1∣x−x0∣2x−x0,divf2=δx0,3 and f2(x):=2π1∣x−x0∣2x−x0,divf2=δx0,4,
f2(x):=2π1∣x−x0∣2x−x0,divf2=δx0,5
with the f2(x):=2π1∣x−x0∣2x−x0,divf2=δx0,6 well-posedness of the Dirichlet problem replacing the Hilbert-space coercivity unavailable for f2(x):=2π1∣x−x0∣2x−x0,divf2=δx0,7. Filling the flux slot with f2(x):=2π1∣x−x0∣2x−x0,divf2=δx0,8 yields a computable estimator combining the constitutive residual against a recovered potential f2(x):=2π1∣x−x0∣2x−x0,divf2=δx0,9 with the data oscillation σ:=−A∇u−f20—no bubble functions, jump terms, or flux reconstruction. It is reliable and locally efficient for the augmented pair σ:=−A∇u−f21; reliability for the flux alone follows, while efficiency for the flux alone would require control of the recovery error, which the equivalence does not supply. The paper also notes that reliability and efficiency alone say nothing about an adaptive loop driven by the estimator without a priori control of the solve-and-recover pair.
Numerical verification
Three problems with σ:=−A∇u−f22 are computed with the σ:=−A∇u−f23–σ:=−A∇u−f24 pair at σ:=−A∇u−f25: a coefficient jump across an interface through the pole, a constant anisotropic matrix, and the sector coefficient for which the canonical interpolant does not exist. On adaptive meshes all reported orders lie between σ:=−A∇u−f26 and σ:=−A∇u−f27 in σ:=−A∇u−f28, attaining the first-order complexity predicted by the graded analysis, with effectivity indices between σ:=−A∇u−f29 and divσ=f10 stable in divσ=f11. On uniform refinement the measured flux order agrees with divσ=f12 to three decimals at divσ=f13 and divσ=f14 (e.g., divσ=f15 vs. divσ=f16), and divσ=f17 against divσ=f18 at divσ=f19 with a level-by-level rise consistent with the far-field correction scaling Lp0. The scalar order is Lp1 and Lp2-independent, exhibiting the refined duality estimate over both the naive bound (which predicts no convergence) and the basic estimate. Strikingly, the same computation produces a divergent Lp3 growing like Lp4—matching the exact-flux law—while the Lp5 error decays at order Lp6: no Lp7 error analysis can describe these computations, and the divergence reflects the norm, not a defect of the method.
Limitations and open questions
Several assumptions bear directly on the results. Hypothesis (SP) is unverified on polygons, adaptive meshes, and discontinuous or anisotropic coefficients. Assumption (A3)—the Lp8 well-posedness used for reliability—is invoked at Lp9 for the computed coefficients without being established there. Dual regularity fails on nonconvex polygons. Efficiency for the flux alone, plain convergence of the adaptive loop built on this estimator, extension beyond two dimensions (where Dur\'an's technique does not apply), the full operator with lower-order terms, and method-specific analyses for DG, hybridizable, finite volume, and nonconforming discretizations applied to the divergence-form equation are all left open, several deferred to separate papers.
Conclusion
The paper replaces a measure-valued load by an exact divergence-form lifting that depends on the pole alone, returning the Dirac problem to a standard data class while paying the price of analyzing the modified flux in σ0, σ1. Within that scale it delivers sharp a priori rates on quasi-uniform and graded meshes, first-order scalar accuracy asymptotically equal to best approximation, and a reliable, locally efficient residual estimator, with numerical results confirming each predicted rate—including the exact exponent σ2 and the logarithmic divergence of the discrete flux in σ3.