pith. sign in

arxiv: 2605.28380 · v2 · pith:OMMO72PInew · submitted 2026-05-27 · 🧮 math.NA · cs.NA

Preconditioned Reconstructed Discontinuous Approximation For Elliptic Interface Problem on Unfitted Mesh

Ruo Li , Qicheng Liu , Fanyi Yang , Shuhai Zhao This is my paper

Pith reviewed 2026-07-02 23:19 UTC · model grok-4.3

classification 🧮 math.NA cs.NA
keywords elliptic interface problemsunfitted meshesdiscontinuous Galerkin methodspreconditioningreconstructed approximationsNitsche penaltymultigrid solvers
0
0 comments X

The pith

Suitable constraints on local least squares reconstruction establish a norm equivalence that lets the lowest-order system precondition high-order unfitted schemes for elliptic interface problems.

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

The paper develops a preconditioned unfitted finite element method for elliptic interface problems using reconstructed discontinuous approximations. By imposing suitable constraints on the local least squares reconstruction, the authors ensure stability near cut elements and prove a norm equivalence between the high-order space and the lowest-order piecewise constant space. This equivalence permits construction of an optimal preconditioner from the lowest-order system on the same mesh for any high-order scheme. The resulting scheme achieves high-order accuracy with one degree of freedom per element, and the condition number of the preconditioned system remains bounded independently of mesh size, coefficient contrast, and interface location. Multigrid methods solve the lowest-order system efficiently.

Core claim

The central discovery is that constraints on the local least squares reconstruction in the reconstructed discontinuous approximation space ensure stability and create a norm equivalence to the piecewise constant space on unfitted meshes. This equivalence enables an optimal preconditioner derived directly from the lowest-order system, leading to a method that combines cut discontinuous Galerkin formulation with Nitsche's technique, achieves arbitrarily high order with one DOF per element, and maintains uniform condition number bounds.

What carries the argument

The norm equivalence between the high-order reconstructed discontinuous approximation space and the lowest-order piecewise constant space, achieved through constraints on local least squares reconstruction.

Load-bearing premise

The imposed constraints on the local least squares reconstruction must produce both stability near cut elements and the norm equivalence to the lowest-order space.

What would settle it

Numerical experiments showing the condition number growing with the interface cut position or coefficient contrast would falsify the uniform boundedness claim.

Figures

Figures reproduced from arXiv: 2605.28380 by Fanyi Yang, Qicheng Liu, Ruo Li, Shuhai Zhao.

Figure 1
Figure 1. Figure 1: The unfitted mesh and the interfaces in two dimensions [PITH_FULL_IMAGE:figures/full_fig_p017_1.png] view at source ↗
Figure 2
Figure 2. Figure 2: The unfitted mesh and the interfaces in three dimensions. Example 1. In the first example, we solve an interface problem with a circular interface centered at the origin with the radius r = 0.6, see [PITH_FULL_IMAGE:figures/full_fig_p017_2.png] view at source ↗
Figure 3
Figure 3. Figure 3: The numerical errors under the energy norm (left)/L 2 norm (right) in Example 1. We next focus on the resulting linear system arising from the bilinear form (14). The condition numbers to the linear systems and the preconditioned systems for all degrees 1 ≤ m ≤ 4 are gathered in Tab. 1. We find that the condition number of Am grows like O(h −2 ) while the condition number of A −1 0 Am increases very slight… view at source ↗
Figure 4
Figure 4. Figure 4: The numerical errors under the energy norm (left)/L 2 norm (right) in Example 2. m h 1/10 1/20 1/40 1/80 1 κ(A −1 0 Am) 11.57 13.83 15.61 16.77 κ(Am) 2.60e+3 1.06e+4 4.24e+4 1.50e+5 2 κ(A −1 0 Am) 37.42 48.52 62.48 68.61 κ(Am) 2.48e+3 9.27e+3 4.42e+4 1.55e+5 3 κ(A −1 0 Am) 106.69 169.07 211.36 243.75 κ(Am) 8.99e+3 3.53e+4 1.29e+5 5.10e+5 4 κ(A −1 0 Am) 387.42 526.75 675.55 679.57 κ(Am) 1.00e+4 4.34e+4 1.52… view at source ↗
Figure 5
Figure 5. Figure 5: The numerical errors under the energy norm (left)/L 2 norm (right) in Example 3. convergence rates under both norms are optimal, which match the theoretical analysis. For this test, the condition numbers of the resulting linear systems are shown in Tab. 9. It can be observed that the condition number κ(Am) grows at the speed O(h −2 ), while the condition number κ(A −1 0 Am) increases only marginally as the… view at source ↗
Figure 6
Figure 6. Figure 6: The numerical errors under the energy norm (left)/L 2 norm (right) in Example 4. degrees. It can be seen that in two and three dimensions, the reconstructed method always has better efficiency, in the sense that it uses fewer degrees of freedom to achieve a comparable numerical error. In Tab. 11, we list the ratio of the number of degrees of freedom required by the two methods to reach [PITH_FULL_IMAGE:fi… view at source ↗
Figure 7
Figure 7. Figure 7: The L 2 numerical errors in number of degrees of freedom for RDA/DG methods in two and three dimensions [PITH_FULL_IMAGE:figures/full_fig_p023_7.png] view at source ↗
Figure 8
Figure 8. Figure 8: The stability constant Λm in two dimensions [PITH_FULL_IMAGE:figures/full_fig_p025_8.png] view at source ↗
Figure 9
Figure 9. Figure 9: The stability constant Λm in three dimensions. References 1. L. Adams and Z. Li, The immersed interface/multigrid methods for interface problems, SIAM J. Sci. Comput. 24 (2002), no. 2, 463–479. 2. R. A. Adams and J. J. F. Fournier, Sobolev Spaces, second ed., Pure and Applied Mathematics (Amsterdam), vol. 140, Elsevier/Academic Press, Amsterdam, 2003. 3. N. An and H. Chen, A partially penalty immersed inte… view at source ↗
read the original abstract

In this paper, we develop an efficient preconditioned unfitted finite element method for the elliptic interface problem, based on the reconstructed discontinuous approximation. The key idea is to impose suitable constraints on the local least squares reconstruction. These constraints ensure the stability near cut interface elements and, more importantly, establish a norm equivalence between the high-order space and the lowest-order piecewise constant space. This result allows us to construct an optimal preconditioner directly from the lowest-order system on the same unfitted mesh for any high-order scheme. The resulting method combines a cut discontinuous Galerkin formulation with Nitsche's penalty technique. The approximation space achieves arbitrarily high order accuracy with only one degree of freedom per element. We prove optimal error estimates and show that the condition number of the preconditioned system is uniformly bounded independently of the mesh size, coefficient contrast, and the location of the interface relative to the mesh. Multigrid algorithms are further designed to efficiently approximate the inverse of the lowest-order system matrix. Numerical experiments in two and three dimensions confirm the optimal convergence rates and demonstrate the robustness and efficiency of the proposed preconditioning method.

Editorial analysis

A structured set of objections, weighed in public.

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

Referee Report

2 major / 2 minor

Summary. The paper develops a preconditioned unfitted discontinuous Galerkin method for elliptic interface problems based on reconstructed discontinuous approximations. Suitable constraints are imposed on local least-squares reconstructions to achieve stability near cut elements and a norm equivalence between the high-order space and the lowest-order piecewise-constant space. This equivalence enables construction of an optimal preconditioner from the lowest-order system on the same unfitted mesh. The method uses a cut DG formulation with Nitsche penalties, achieves high-order accuracy with one DOF per element, proves optimal error estimates, and establishes that the preconditioned condition number is uniformly bounded independent of mesh size h, coefficient contrast, and interface location. Multigrid solvers are designed for the lowest-order system, with numerical experiments in 2D and 3D confirming optimal convergence and robustness.

Significance. If the claimed uniform norm equivalence and condition-number bound hold without hidden dependence on cut geometry, the approach would offer a practical route to high-order unfitted discretizations with robust, mesh-independent preconditioning for interface problems. The reduction of the preconditioner to a lowest-order system on the identical unfitted mesh, combined with the one-DOF-per-element high-order space, is a notable technical feature that could simplify implementation for complex geometries.

major comments (2)
  1. [§4] §4 (Analysis of the reconstructed space), statement and proof of the norm equivalence (likely Lemma 4.3 or Theorem 4.4): the argument that the equivalence constant between the high-order reconstructed space and the lowest-order piecewise-constant space is independent of cut position must explicitly control the case of arbitrarily small cut fractions. The local least-squares reconstruction matrix can become severely ill-conditioned when an element is cut by a very small volume fraction; the imposed constraints need to be shown to restore uniform stability without additional assumptions on the minimum cut ratio.
  2. [§5] §5 (Preconditioner construction and condition-number bound): the proof that the preconditioned operator has a condition number bounded independently of the coefficient contrast and interface location relies directly on the norm equivalence from §4. If the equivalence constant deteriorates for small cuts, the claimed uniform bound on the preconditioned condition number does not follow.
minor comments (2)
  1. [Abstract] The abstract and introduction should clarify whether the lowest-order system used for preconditioning is solved exactly or approximated by the multigrid method when reporting the overall solver complexity.
  2. [Numerical experiments] Numerical experiments section: include a table or plot showing the condition number of the preconditioned system versus the minimum cut ratio (e.g., for cut fractions down to 10^{-6}) to empirically support the uniformity claim.

Simulated Author's Rebuttal

2 responses · 0 unresolved

We thank the referee for the careful reading and for identifying the need for explicit control of small-cut cases in the analysis. We address the two major comments below. The manuscript will be revised to strengthen the relevant proofs with additional details on uniformity with respect to arbitrarily small cut fractions, while preserving the claimed independence of the bounds.

read point-by-point responses

  1. Referee: [§4] §4 (Analysis of the reconstructed space), statement and proof of the norm equivalence (likely Lemma 4.3 or Theorem 4.4): the argument that the equivalence constant between the high-order reconstructed space and the lowest-order piecewise-constant space is independent of cut position must explicitly control the case of arbitrarily small cut fractions. The local least-squares reconstruction matrix can become severely ill-conditioned when an element is cut by a very small volume fraction; the imposed constraints need to be shown to restore uniform stability without additional assumptions on the minimum cut ratio.

    Authors: We agree that an explicit verification for arbitrarily small cut fractions is necessary to make the uniformity fully rigorous. The constraints imposed on the local least-squares reconstruction are constructed precisely to enforce that the reconstructed polynomial is controlled by its average value on the cut element, which prevents the degeneracy that would otherwise arise from ill-conditioning of the reconstruction matrix. In the current proof of Lemma 4.3 the equivalence constants are derived via a combination of the constraint equations and inverse inequalities that are independent of the volume fraction; however, the dependence on the cut ratio is not written out in a separate estimate. We will add a dedicated remark (or short subsection) immediately after Lemma 4.3 that isolates the small-cut case, shows that the constraint matrix remains uniformly invertible, and confirms that the equivalence constants remain bounded independently of the cut fraction. This revision will be included in the next version of the manuscript. revision: yes

  2. Referee: [§5] §5 (Preconditioner construction and condition-number bound): the proof that the preconditioned operator has a condition number bounded independently of the coefficient contrast and interface location relies directly on the norm equivalence from §4. If the equivalence constant deteriorates for small cuts, the claimed uniform bound on the preconditioned condition number does not follow.

    Authors: The condition-number bound stated in Theorem 5.1 is obtained by transferring the norm equivalence of the reconstructed space to the lowest-order piecewise-constant space and then invoking the known uniform bound for the lowest-order cut DG system. Because the equivalence constants will be shown to be independent of the cut fraction in the revised §4, the same independence carries over to the preconditioned condition number. Consequently the statement of Theorem 5.1 remains unchanged, but its proof will be updated with a forward reference to the new remark in §4. We therefore view the revision as partial: only the supporting analysis is augmented, not the final theorem. revision: partial

Circularity Check

0 steps flagged

No significant circularity; derivation relies on independent proof of norm equivalence

full rationale

The paper's core claim is a proof of optimal error estimates and a uniform bound on the preconditioned condition number, achieved by imposing constraints on local least-squares reconstruction to establish a norm equivalence between the high-order reconstructed space and the lowest-order piecewise-constant space. This equivalence then permits constructing the preconditioner directly from the lowest-order system on the same unfitted mesh. No step reduces a claimed prediction or result to a fitted parameter or self-citation by construction; the lowest-order system is independent, and the equivalence is presented as a proved consequence of the constraints rather than a definitional renaming. The derivation chain is therefore self-contained.

Axiom & Free-Parameter Ledger

0 free parameters · 1 axioms · 0 invented entities

The central claim depends on the domain assumption that the imposed constraints produce the required norm equivalence and stability, which is not derived from more basic principles in the abstract but posited as the key idea enabling the preconditioner.

axioms (1)
  • domain assumption Suitable constraints on the local least squares reconstruction ensure stability near cut interface elements and establish a norm equivalence between the high-order space and the lowest-order piecewise constant space.
    This is explicitly stated as the key idea in the abstract that allows construction of the optimal preconditioner from the lowest-order system.

pith-pipeline@v0.9.1-grok · 5733 in / 1467 out tokens · 28996 ms · 2026-07-02T23:19:05.037296+00:00 · methodology

Review history (2 revisions) →

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.

Reference graph

Works this paper leans on

52 extracted references

  1. [1]

    Adams and Z

    L. Adams and Z. Li, The immersed interface/multigrid methods for interface problems , SIAM J. Sci. Comput. 24 (2002), no. 2, 463–479

    2002

  2. [2]

    R. A. Adams and J. J. F. Fournier, Sobolev Spaces, second ed., Pure and Applied Mathematics (Amsterdam), vol. 140, Elsevier/Academic Press, Amsterdam, 2003

    2003

  3. [3]

    An and H

    N. An and H. Chen, A partially penalty immersed interface finite element method for anisotropic elliptic interface problems, Numer. Methods Partial Differential Equations 30 (2014), no. 6, 1984–2028

    2014

  4. [4]

    Badia and F

    S. Badia and F. Verdugo, Robust and scalable domain decomposition solvers for unfitted finite element methods , J. Comput. Appl. Math. 344 (2018), 740–759

    2018

  5. [5]

    Badia, F

    S. Badia, F. Verdugo, and A. Martín, The aggregated unfitted finite element method for elliptic problems , Comput. Methods Appl. Mech. Engrg. 336 (2018), 533–553

    2018

  6. [6]

    J. W. Barrett and C. M. Elliott, Fitted and unfitted finite-element methods for elliptic equations with smooth interfaces, IMA J. Numer. Anal. 7 (1987), no. 3, 283–300

    1987

  7. [7]

    Burman, Ghost penalty , C

    E. Burman, Ghost penalty , C. R. Math. Acad. Sci. Paris 348 (2010), no. 21-22, 1217–1220

    2010

  8. [8]

    Burman, M

    E. Burman, M. Cicuttin, G. Delay, and A. Ern, An unfitted hybrid high-order method with cell agglomeration for elliptic interface problems , SIAM J. Sci. Comput. 43 (2021), no. 2, A859–A882

    2021

  9. [9]

    Burman and P

    E. Burman and P. Hansbo, Fictitious domain finite element methods using cut elements: II. A stabilized Nitsche method, Appl. Numer. Math. 62 (2012), no. 4, 328–341

    2012

  10. [10]

    A stabilized Nitsche method for Stokes’ problem , ESAIM Math

    , Fictitious domain methods using cut elements: III. A stabilized Nitsche method for Stokes’ problem , ESAIM Math. Model. Numer. Anal. 48 (2014), no. 3, 859–874

    2014

  11. [11]

    Burman, P

    E. Burman, P. Hansbo, M. G. Larson, and S. Zahedi, Cut finite element methods , Acta Numer. 34 (2025), 1–121. MR 4926311

    2025

  12. [12]

    Z. Cai, X. Ye, and S. Zhang, Discontinuous Galerkin finite element methods for interface problems: a priori and a posteriori error estimations , SIAM J. Numer. Anal. 49 (2011), no. 5, 1761–1787

    2011

  13. [13]

    W. Cao, X. Zhang, Z. Zhang, and Q. Zou, Superconvergence of immersed finite volume methods for one-dimensional interface problems, J. Sci. Comput. 73 (2017), no. 2-3, 543–565

    2017

  14. [14]

    Chalmers and T

    N. Chalmers and T. Warburton, Low-order preconditioning of high-order triangular finite elements , SIAM J. Sci. Comput. 40 (2018), no. 6, A4040–A4059

    2018

  15. [15]

    Chen and J

    Z. Chen and J. Zou, Finite element methods and their convergence for elliptic and parabolic interface problems , Numer. Math. 79 (1998), no. 2, 175–202

    1998

  16. [16]

    H. Chu, Y. Song, H. Ji, and Y. Cai, Multigrid algorithm for immersed finite element discretizations of elliptic interface problems, J. Sci. Comput. 98 (2024), no. 1, Paper No. 26, 35. 26 R. LI, Q.-C. LIU, F.-Y. YANG, AND S.-H. ZHAO

    2024

  17. [17]

    T. Cui, W. Leng, H. Liu, L. Zhang, and W. Zheng, High-order numerical quadratures in a tetrahedron with an implicitly defined curved interface , ACM Trans. Math. Software 46 (2020), no. 1, Art. 3, 18

    2020

  18. [18]

    A. Ern, A. F. Stephansen, and P. Zunino, A discontinuous Galerkin method with weighted averages for advection- diffusion equations with locally small and anisotropic diffusivity , IMA J. Numer. Anal. 29 (2009), no. 2, 235–256

    2009

  19. [19]

    Gross and A

    S. Gross and A. Reusken, Analysis of optimal preconditioners for CutFEM , Numer. Linear Algebra Appl. 30 (2023), no. 5, Paper No. e2486, 23

    2023

  20. [20]

    Guo and T

    R. Guo and T. Lin, A higher degree immersed finite element method based on a Cauchy extension for elliptic interface problems, SIAM J. Numer. Anal. 57 (2019), no. 4, 1545–1573

    2019

  21. [21]

    Gürkan and A

    C. Gürkan and A. Massing, A stabilized cut discontinuous Galerkin framework for elliptic boundary value and interface problems, Comput. Methods Appl. Mech. Engrg. 348 (2019), 466–499

    2019

  22. [22]

    Methods Appl

    , A stabilized cut discontinuous Galerkin framework for elliptic boundary value and interface problems , Comput. Methods Appl. Mech. Engrg. 348 (2019), 466–499

    2019

  23. [23]

    Guzmán and M

    J. Guzmán and M. Olshanskii, Inf-sup stability of geometrically unfitted Stokes finite elements , Math. Comp. 87 (2018), no. 313, 2091–2112

    2018

  24. [24]

    Hansbo and P

    A. Hansbo and P. Hansbo, An unfitted finite element method, based on Nitsche’s method, for elliptic interface problems, Comput. Methods Appl. Mech. Engrg. 191 (2002), no. 47-48, 5537–5552

    2002

  25. [25]

    Hansbo, M

    P. Hansbo, M. G. Larson, and S. Zahedi, A cut finite element method for a Stokes interface problem , Appl. Numer. Math. 85 (2014), 90–114

    2014

  26. [26]

    Huang and J

    J. Huang and J. Zou, Uniform a priori estimates for elliptic and static Maxwell interface problems , Discrete Contin. Dyn. Syst. Ser. B 7 (2007), no. 1, 145–170

    2007

  27. [27]

    Huang, H

    P. Huang, H. Wu, and Y. Xiao, An unfitted interface penalty finite element method for elliptic interface problems , Comput. Methods Appl. Mech. Engrg. 323 (2017), 439–460

    2017

  28. [28]

    T. J. R. Hughes, G. Engel, L. Mazzei, and M. G. Larson, A comparison of discontinuous and continuous Galerkin methods based on error estimates, conservation, robustness and efficiency , Discontinuous Galerkin methods (New- port, RI, 1999), Lect. Notes Comput. Sci. Eng., vol. 11, Springer, Berlin, 2000, pp. 135–146

    1999

  29. [29]

    Johansson and M

    A. Johansson and M. G. Larson, A high order discontinuous Galerkin Nitsche method for elliptic problems with fictitious boundary, Numer. Math. 123 (2013), no. 4, 607–628

    2013

  30. [30]

    O. A. Karakashian and F. Pascal, Convergence of adaptive discontinuous Galerkin approximations of second-order elliptic problems , SIAM J. Numer. Anal. 45 (2007), no. 2, 641–665

    2007

  31. [31]

    R. B. Kellogg, Higher order singularities for interface problems , The mathematical foundations of the finite element method with applications to partial differential equations (Proc. Sympos., Univ. Maryland, Baltimore, Md., 1972), 1972, pp. 589–602. MR 0433926

    1972

  32. [32]

    Lehrenfeld and A

    C. Lehrenfeld and A. Reusken, Optimal preconditioners for Nitsche-XFEM discretizations of interface problems , Numer. Math. 135 (2017), no. 2, 313–332

    2017

  33. [33]

    R. J. LeVeque and Z. Li, The immersed interface method for elliptic equations with discontinuous coefficients and singular sources, SIAM J. Numer. Anal. 31 (1994), no. 4, 1019–1044

    1994

  34. [34]

    R. Li, Q. Liu, and F. Yang, A reconstructed discontinuous approximation on unfitted meshes to H(curl) and H(div) interface problems, Comput. Methods Appl. Mech. Engrg. 403 (2023), no. part A, Paper No. 115723, 27

    2023

  35. [35]

    , Preconditioned nonsymmetric/symmetric discontinuous Galerkin method for elliptic problem with recon- structed discontinuous approximation , J. Sci. Comput. 100 (2024), no. 3, Paper No. 88, 32

    2024

  36. [36]

    R. Li, P. Ming, Z. Sun, and Z. Yang, An arbitrary-order discontinuous Galerkin method with one unknown per element, J. Sci. Comput. 80 (2019), no. 1, 268–288

    2019

  37. [37]

    R. Li, P. Ming, and F. Tang, An efficient high order heterogeneous multiscale method for elliptic problems , Multiscale Model. Simul. 10 (2012), no. 1, 259–283

    2012

  38. [38]

    R. Li, Z. Sun, and F. Yang, Solving eigenvalue problems in a discontinuous approximate space by patch reconstruction , SIAM J. Sci. Comput. 41 (2019), no. 5, A3381–A3400

    2019

  39. [39]

    Li and F

    R. Li and F. Yang, A discontinuous Galerkin method by patch reconstruction for elliptic interface problem on unfitted mesh, SIAM J. Sci. Comput. 42 (2020), no. 2, A1428–A1457

    2020

  40. [40]

    Ruo Li, Qicheng Liu, and Fanyi Yang, Preconditioned nonsymmetric/symmetric discontinuous Galerkin method for elliptic problem with reconstructed discontinuous approximation , J. Sci. Comput. 100 (2024), no. 3, Paper No. 88, 32

    2024

  41. [41]

    Li, The immersed interface method using a finite element formulation , Appl

    Z. Li, The immersed interface method using a finite element formulation , Appl. Numer. Math. 27 (1998), no. 3, 253–267

    1998

  42. [42]

    T. Lin, Y. Lin, and X. Zhang, Partially penalized immersed finite element methods for elliptic interface problems , SIAM J. Numer. Anal. 53 (2015), no. 2, 1121–1144

    2015

  43. [43]

    H. Liu, L. Zhang, X. Zhang, and W. Zheng, Interface-penalty finite element methods for interface problems in H 1, H(curl), and H(div), Comput. Methods Appl. Mech. Engrg. 367 (2020), 113137, 16

    2020

  44. [44]

    Ludescher, S

    T. Ludescher, S. Gross, and A. Reusken, A multigrid method for unfitted finite element discretizations of elliptic interface problems, SIAM J. Sci. Comput. 42 (2020), no. 1, A318–A342. PRECONDITIONED RDA METHOD FOR EIP 27

    2020

  45. [45]

    Neiva and S

    E. Neiva and S. Badia, Robust and scalable h-adaptive aggregated unfitted finite elements for interface elliptic problems, Comput. Methods Appl. Mech. Engrg. 380 (2021), Paper No. 113769, 26

    2021

  46. [46]

    Pazner, Efficient low-order refined preconditioners for high-order matrix-free continuous and discontinuous Galerkin methods , SIAM J

    W. Pazner, Efficient low-order refined preconditioners for high-order matrix-free continuous and discontinuous Galerkin methods , SIAM J. Sci. Comput. 42 (2020), no. 5, A3055–A3083

    2020

  47. [47]

    Pazner, T

    W. Pazner, T. Kolev, and C. R. Dohrmann, Low-order preconditioning for the high-order finite element de Rham complex, SIAM J. Sci. Comput. 45 (2023), no. 2, A675–A702

    2023

  48. [48]

    Vaněk, M

    P. Vaněk, M. Brezina, and J. Mandel, Convergence of algebraic multigrid based on smoothed aggregation , Numer. Math. 88 (2001), no. 3, 559–579

    2001

  49. [49]

    Vaněk, J

    P. Vaněk, J. Mandel, and M. Brezina, Algebraic multigrid by smoothed aggregation for second and fourth order elliptic problems, vol. 56, 1996, International GAMM-Workshop on Multi-level Methods (Meisdorf, 1994), pp. 179–196

    1996

  50. [50]

    X. S. Wang, L.T. Zhang, and W. K. Liu, On computational issues of immersed finite element methods , J. Comput. Phys. 228 (2009), no. 7, 2535–2551

    2009

  51. [51]

    Wu and Y

    H. Wu and Y. Xiao, An unfitted hp-interface penalty finite element method for elliptic interface problems , J. Comput. Math. 37 (2019), no. 3, 316–339

    2019

  52. [52]

    Yang, The least squares finite element method for elasticity interface problem on unfitted mesh , ESAIM Math

    F. Yang, The least squares finite element method for elasticity interface problem on unfitted mesh , ESAIM Math. Model. Numer. Anal. 58 (2024), no. 2, 695–721. CAPT, LMAM and School of Mathematical Sciences, Peking University, Beijing 100871, P.R. China Email address : rli@math.pku.edu.cn Hangzhou International Innovation Institute of Beihang University, ...

    2024