pith. sign in

arxiv: 1907.01790 · v1 · pith:7VIMVUUInew · submitted 2019-07-03 · 🧮 math.NA · cs.NA

BPX preconditioners for isogeometric analysis using analysis-suitable T-splines

Durkbin Cho , Rafael V\'azquez This is my paper

Pith reviewed 2026-05-25 10:22 UTC · model grok-4.3

classification 🧮 math.NA cs.NA
keywords BPX preconditionerisogeometric analysisT-splinesmultilevel methodsoptimal complexityanalysis-suitable T-splineslocal refinement
0
0 comments X

The pith

Two BPX preconditioners achieve optimal complexity for isogeometric analysis on analysis-suitable T-meshes.

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

The paper develops two additive multilevel BPX preconditioners for discretizations of scalar elliptic problems using isogeometric analysis on locally refined T-meshes. A specific refinement strategy ensures the T-meshes possess a multilevel structure and the T-splines remain analysis-suitable, which permits definition of a dual basis and a stable projector. One variant applies local smoothing only to functions affected by each newly added edge from bisection, while the second smooths all functions affected after completing all edges at the same level. Both preconditioners are proved to deliver optimal complexity.

Core claim

We prove that both methods have optimal complexity, and present several numerical experiments to confirm our theoretical results, and also to compare the practical performance of the proposed preconditioners.

What carries the argument

BPX preconditioners built from local smoothing operators on the multilevel structure of analysis-suitable T-meshes, using the dual basis and stable projector.

If this is right

  • Condition numbers of the preconditioned operators remain bounded independently of the number of levels and mesh size.
  • The resulting solvers have optimal computational complexity for the elliptic problems considered.
  • The two smoothing variants differ in the functions included at each level but both retain the optimality property.

Where Pith is reading between the lines

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

  • The approach could extend to vector-valued or other elliptic problems if the same multilevel and analysis-suitable properties can be maintained.
  • Practical trade-offs between the two variants may appear in adaptive simulations where setup cost versus iteration count matters.
  • The construction connects classical BPX ideas from finite elements directly to locally refined spline spaces.

Load-bearing premise

The chosen refinement strategy produces T-meshes with a multilevel structure in which the T-splines are analysis-suitable.

What would settle it

Observation of condition numbers or iteration counts that grow unbounded with the number of refinement levels when either preconditioner is applied.

Figures

Figures reproduced from arXiv: 1907.01790 by Durkbin Cho, Rafael V\'azquez.

Figure 1
Figure 1. Figure 1: Computation of the index vector for two basis functions, for bicubic (left) and biquartic [PITH_FULL_IMAGE:figures/full_fig_p008_1.png] view at source ↗
Figure 2
Figure 2. Figure 2: An extended T-mesh and the corresponding B´ezier mesh for degree [PITH_FULL_IMAGE:figures/full_fig_p010_2.png] view at source ↗
Figure 3
Figure 3. Figure 3: Two bisections bτk−1 (lower left in bold black) and bτk (upper right in bold black) of the same generation, and their respective collections Φk−1 and Φk of bicubic T-spline functions where anchors near each bisection represent the associated T-splines newly appeared or modified To each Φk, we associate a subspace Vk := span Φk, for k = 0, . . . , N. (13) 11 [PITH_FULL_IMAGE:figures/full_fig_p011_3.png] view at source ↗
Figure 4
Figure 4. Figure 4: (3, 3)-neighborhood (in sky blue) of an element τ in blue (left). To obtain an admissible T-mesh, before bisecting τ it is necessary to bisect the elements in the neighborhood with lower generation (right) Remark 4.3 The result in [33] does not take into account the repeated knots of the open knot vector. However, the same ideas apply using the definitions above, because the bisection of zero measure eleme… view at source ↗
Figure 5
Figure 5. Figure 5: For the chosen element Q (in black), we represent the furthest element τk above and to the left such that, when τk is bisected, Q is contained in ωk, for bilinear (red horizontally hatched), biquadratic (blue left diagonally hatched), bicubic (black right diagonally hatched) and biquartic (green vertically hatched). Remark 4.5 As already mentioned at the beginning of this section, the results can be extend… view at source ↗
Figure 6
Figure 6. Figure 6: For the chosen element Q (in black), we represent the furthest element Q0 (horizontally hatched) such that there is a function that contains both elements in its support, and the furthest element (diagonally hatched) such that its bisection affects a function, anchored at the blue dot, that is in Φk and contains Q0 in its support. Thus, Q0 ⊂ ωk and Q ⊂ ωek. For the bilinear (left), biquadratic (middle) and… view at source ↗
Figure 7
Figure 7. Figure 7: The fourth generation T-meshes in the first numerical test, and the corresponding B´ezier [PITH_FULL_IMAGE:figures/full_fig_p024_7.png] view at source ↗
Figure 8
Figure 8. Figure 8: B´ezier mesh of the curved L-shaped domain with four levels, biquadratic case. For [PITH_FULL_IMAGE:figures/full_fig_p026_8.png] view at source ↗
Figure 9
Figure 9. Figure 9: The alternative refinement for the biquadratic case: T-mesh (left) and corresponding [PITH_FULL_IMAGE:figures/full_fig_p028_9.png] view at source ↗
read the original abstract

We propose and analyze optimal additive multilevel solvers for isogeometric discretizations of scalar elliptic problems for locally refined T-meshes. Applying the refinement strategy in Morgenstern and Peterseim (2015, Comput. Aided Geom. Design, 34, 50-66) we can guarantee that the obtained T-meshes have a multilevel structure, and that the associated T-splines are analysis-suitable, for which we can define a dual basis and a stable projector. Taking advantage of the multilevel structure, we develop two BPX preconditioners: the first on the basis of local smoothing only for the functions affected by a newly added edge by bisection, and the second smoothing for all the functions affected after adding all the edges of the same level. We prove that both methods have optimal complexity, and present several numerical experiments to confirm our theoretical results, and also to compare the practical performance of the proposed preconditioners.

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 manuscript proposes two BPX-type additive multilevel preconditioners for isogeometric discretizations of elliptic problems on locally refined analysis-suitable T-meshes. Using the refinement strategy from Morgenstern and Peterseim (2015), the T-meshes are guaranteed to have a multilevel structure allowing definition of a dual basis and stable projector. The authors prove optimal complexity for both preconditioners (one based on local smoothing for newly added edges, the other for all functions at the same level) and support the theory with numerical experiments comparing their performance.

Significance. If the central claims hold, the work provides theoretically justified optimal-complexity solvers for a practically relevant class of locally refined IGA problems. The explicit proofs of optimality and the accompanying numerical validation constitute clear strengths.

major comments (2)
  1. [Main theorem on optimal complexity (analysis section)] The proof of optimal complexity (condition-number bound independent of h and number of levels) rests on the stability constants of the projector and the additive decomposition remaining uniform under arbitrary sequences of the allowed bisections. The manuscript should explicitly cite or prove the relevant uniformity result from Morgenstern and Peterseim (2015) in the main theorem establishing the O(1) bound.
  2. [Construction and analysis of the preconditioners] § on construction of the two BPX variants: the first variant smooths only functions affected by a single new edge, while the second smooths all functions at the same level. The analysis must confirm that both variants inherit the same uniform stability constants from the multilevel structure; otherwise the optimality claim for the first variant is not fully supported.
minor comments (2)
  1. [Abstract and introduction] The abstract and introduction could more clearly distinguish the two proposed BPX variants by name or label for easier reference in the numerical section.
  2. [Numerical experiments] Figure captions in the numerical experiments section should include the specific T-mesh configurations and refinement depths used.

Simulated Author's Rebuttal

2 responses · 0 unresolved

We thank the referee for the careful reading and constructive suggestions. We address the two major comments below and will incorporate revisions to strengthen the explicit references to uniformity results and the analysis of both preconditioner variants.

read point-by-point responses

  1. Referee: [Main theorem on optimal complexity (analysis section)] The proof of optimal complexity (condition-number bound independent of h and number of levels) rests on the stability constants of the projector and the additive decomposition remaining uniform under arbitrary sequences of the allowed bisections. The manuscript should explicitly cite or prove the relevant uniformity result from Morgenstern and Peterseim (2015) in the main theorem establishing the O(1) bound.

    Authors: We agree that an explicit citation strengthens the presentation. The uniformity of the stability constants (independent of the number of bisections) is a direct consequence of the multilevel structure and analysis-suitability guaranteed by the refinement strategy in Morgenstern and Peterseim (2015). In the revised manuscript we will insert a direct reference to the relevant theorem from that work (on uniform bounds for the dual basis and projector) immediately preceding the statement of our main condition-number theorem. revision: yes

  2. Referee: [Construction and analysis of the preconditioners] § on construction of the two BPX variants: the first variant smooths only functions affected by a single new edge, while the second smooths all functions at the same level. The analysis must confirm that both variants inherit the same uniform stability constants from the multilevel structure; otherwise the optimality claim for the first variant is not fully supported.

    Authors: Both variants are analyzed via the same abstract additive Schwarz framework (Section 4) that relies only on the uniform stability of the multilevel decomposition and the projector, which hold independently of which subset of basis functions is smoothed at each level. The local-smoothing variant (new-edge only) corresponds to a subspace decomposition whose constants are bounded by those of the full-level variant. We will add an explicit sentence in the analysis section confirming that the uniform constants carry over verbatim to the local variant, thereby supporting the optimality claim for both. revision: yes

Circularity Check

0 steps flagged

No significant circularity; derivation relies on external cited refinement strategy

full rationale

The paper applies the refinement strategy from the externally cited Morgenstern and Peterseim (2015) work to guarantee multilevel T-meshes and analysis-suitable T-splines admitting a dual basis and stable projector. It then constructs two BPX preconditioners exploiting this structure and proves optimal complexity using standard multilevel analysis. No step reduces by definition or construction to the paper's own fitted inputs or prior self-citations; the cited result is independent (different authors) and supplies the required uniform stability properties without the present work re-deriving or assuming them tautologically. The derivation is therefore self-contained against external benchmarks.

Axiom & Free-Parameter Ledger

0 free parameters · 1 axioms · 0 invented entities

The paper depends on the external refinement strategy to guarantee the multilevel structure and analysis-suitable properties needed for the dual basis and stable projector; no free parameters or invented entities are mentioned in the abstract.

axioms (1)
  • domain assumption The refinement strategy in Morgenstern and Peterseim (2015) produces T-meshes with multilevel structure and analysis-suitable T-splines admitting a dual basis and stable projector.
    Explicitly invoked in the abstract as the foundation enabling the multilevel BPX construction.

pith-pipeline@v0.9.0 · 5691 in / 1336 out tokens · 36030 ms · 2026-05-25T10:22:17.298266+00:00 · methodology

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

43 extracted references · 43 canonical work pages

  1. [1]

    Bazilevs, L

    Y. Bazilevs, L. Beir˜ao da Veiga, J. A. Cottrell, T. J. R. Hughes, and G. Sangalli, Isogeometric analysis: approximation, stability and error estimates for h-refined meshes, Math. Models Methods Appl. Sci., 16 (2006), pp. 1031–1090

    work page 2006

  2. [2]

    Bazilevs, V

    Y. Bazilevs, V. Calo, J. A. Cottrell, J. A. Evans, T. J. R. Hughes, S. Lipton, M. Scott, and T. Sederberg , Isogeometric analysis using T-splines , Comput. Methods Appl. Mech. Engrg., 199 (2010), pp. 229 – 263

    work page 2010

  3. [3]

    Beir˜ao da Veiga, L

    L. Beir˜ao da Veiga, L. F. Pavarino, S. Scacchi, O. B. Widlund, and S. Zampini , Isogeometric BDDC preconditioners with deluxe scaling , SIAM J. Sci. Comput., 36 (2014), pp. A1118–A1139. 31

    work page 2014

  4. [4]

    Beir˜ao da Veiga, A

    L. Beir˜ao da Veiga, A. Buffa, D. Cho, and G. Sangalli , Analysis-Suitable T-splines are Dual-Compatible, Comput. Methods Appl. Mech. Engrg., 249–252 (2012), pp. 42 – 51

    work page 2012

  5. [5]

    Beir ˜ao da Veiga, A

    L. Beir ˜ao da Veiga, A. Buffa, G. Sangalli, and R. V ´azquez, Analysis-suitable T- splines of arbitrary degree: Definition, linear independence and approximation properties , Math. Models Methods Appl. Sci., 23 (2013), pp. 1979–2003

    work page 2013

  6. [6]

    Beir˜ao da Veiga, A

    L. Beir˜ao da Veiga, A. Buffa, G. Sangalli, and R. V ´azquez, Mathematical analysis of variational isogeometric methods , Acta Numer., 23 (2014), pp. 157–287

    work page 2014

  7. [7]

    Beir˜ao da Veiga, D

    L. Beir˜ao da Veiga, D. Cho, L. F. Pavarino, and S. Scacchi , BDDC preconditioners for isogeometric analysis, Math. Models Methods Appl. Sci., 23 (2013), pp. 1099 – 1142

    work page 2013

  8. [8]

    Methods Appl

    , Isogeometric Schwarz preconditioners for linear elasticity systems , Comput. Methods Appl. Mech. Engrg., 253 (2013), pp. 439 – 454

    work page 2013

  9. [9]

    J. H. Bramble, J. E. Pasciak, J. P. Wang, and J. Xu , Convergence estimates for multigrid algorithms without regularity assumptions , Math. Comp., 57 (1991), pp. 23–45

    work page 1991

  10. [10]

    J. H. Bramble, J. E. Pasciak, and J. Xu , Parallel multilevel preconditioners , Math. Comp., 55 (1990), pp. 1–22

    work page 1990

  11. [11]

    S. C. Brenner and L. R. Scott, The mathematical theory of finite element methods, vol. 15 of Texts in Applied Mathematics, Springer-Verlag, New York, 1994

    work page 1994

  12. [12]

    Bressan, A

    A. Bressan, A. Buffa, and G. Sangalli , Characterization of analysis-suitable T-splines , Comput. Aided Geom. Design, 39 (2015), pp. 17 – 49

    work page 2015

  13. [13]

    Buffa, H

    A. Buffa, H. Harbrecht, A. Kunoth, and G. Sangalli , BPX-preconditioning for iso- geometric analysis, Comput. Methods Appl. Mech. Engrg., 265 (2013), pp. 63 – 70

    work page 2013

  14. [14]

    L. Chen, R. H. Nochetto, and J. Xu , Optimal multilevel methods for graded bisection grids, Numer. Math., 120 (2012), pp. 1–34

    work page 2012

  15. [15]

    J. A. Cottrell, T. J. R. Hughes, and Y. Bazilevs , Isogeometric Analysis: toward integration of CAD and FEA , John Wiley & Sons, 2009

    work page 2009

  16. [16]

    de Boor, A practical guide to splines , vol

    C. de Boor, A practical guide to splines , vol. 27 of Applied Mathematical Sciences, Springer- Verlag, New York, revised ed., 2001

    work page 2001

  17. [17]

    de Falco, A

    C. de Falco, A. Reali, and R. V ´azquez, GeoPDEs: a research tool for Isogeometric Analysis of PDEs , Adv. Engrg. Softw., 42 (2011), pp. 1020–1034

    work page 2011

  18. [18]

    Dokken, T

    T. Dokken, T. Lyche, and K. F. Pettersen , Polynomial splines over locally refined box-partitions, Comput. Aided Geom. Design, 30 (2013), pp. 331–356

    work page 2013

  19. [19]

    Donatelli, C

    M. Donatelli, C. Garoni, C. Manni, S. Serra-Capizzano, and H. Speleers , Robust and optimal multi-iterative techniques for IgA Galerkin linear systems, Comput. Methods Appl. Mech. Engrg., 284 (2015), pp. 230–264

    work page 2015

  20. [20]

    , Symbol-Based Multigrid Methods for Galerkin B-Spline Isogeometric Analysis , SIAM J. Numer. Anal., 55 (2017), pp. 31–62. 32

    work page 2017

  21. [21]

    D ¨orfel, B

    M. D ¨orfel, B. J ¨uttler, and B. Simeon , Adaptive isogeometric analysis by local h- refinement with T-splines , Comput. Methods Appl. Mech. Engrg., 199 (2010), pp. 264 – 275

    work page 2010

  22. [22]

    Gahalaut, J

    K. Gahalaut, J. Kraus, and S. Tomar, Multigrid methods for isogeometric discretization, Comput. Methods Appl. Mech. Engrg., 253 (2013), pp. 413 – 425

    work page 2013

  23. [23]

    Hofreither and S

    C. Hofreither and S. Takacs , Robust multigrid for isogeometric analysis based on stable splittings of spline spaces , SIAM J. Num. Anal., 55 (2017), pp. 2004–2024

    work page 2017

  24. [24]

    Hofreither, S

    C. Hofreither, S. Takacs, and W. Zulehner, A robust multigrid method for Isogeometric Analysis in two dimensions using boundary correction , Comput. Methods Appl. Mech. Engrg., 316 (2017), pp. 22 – 42

    work page 2017

  25. [25]

    Hofreither and W

    C. Hofreither and W. Zulehner, Mass smoothers in geometric multigrid for isogeometric analysis, in Curves and surfaces, vol. 9213 of Lecture Notes in Comput. Sci., Springer, Cham, 2015, pp. 272–279

    work page 2015

  26. [26]

    8962 of Lecture Notes in Comput

    , Spectral analysis of geometric multigrid methods for isogeometric analysis , in Numerical methods and applications, vol. 8962 of Lecture Notes in Comput. Sci., Springer, Cham, 2015, pp. 123–129

    work page 2015

  27. [27]

    T. J. R. Hughes, J. A. Cottrell, and Y. Bazilevs , Isogeometric analysis: CAD, fi- nite elements, NURBS, exact geometry and mesh refinement , Comput. Methods Appl. Mech. Engrg., 194 (2005), pp. 4135–4195

    work page 2005

  28. [28]

    K. A. Johannessen, T. Kvamsdal, and T. Dokken , Isogeometric analysis using LR B- splines, Comput. Methods Appl. Mech. Engrg., 269 (2014), pp. 471 – 514

    work page 2014

  29. [29]

    S. K. Kleiss, C. Pechstein, B. J¨uttler, and S. Tomar, IETI—isogeometric tearing and interconnecting, Comput. Methods Appl. Mech. Engrg., 247/248 (2012), pp. 201–215

    work page 2012

  30. [30]

    Li and M

    X. Li and M. A. Scott , Analysis-suitable T-splines: Characterization, refineability, and approximation, Math. Models Methods Appl. Sci., 24 (2014), pp. 1141–1164

    work page 2014

  31. [31]

    X. Li, J. Zheng, T. Sederberg, T. Hughes, and M. Scott , On linear independence of T-spline blending functions , Comput. Aided Geom. Design, 29 (2012), pp. 63 – 76

    work page 2012

  32. [32]

    Morgenstern, Globally structured three-dimensional analysis-suitable T-splines: defini- tion, linear independence and m-graded local refinement, SIAM J

    P. Morgenstern, Globally structured three-dimensional analysis-suitable T-splines: defini- tion, linear independence and m-graded local refinement, SIAM J. Numer. Anal., 54 (2016), pp. 2163–2186

    work page 2016

  33. [33]

    Morgenstern and D

    P. Morgenstern and D. Peterseim , Analysis-suitable adaptive T-mesh refinement with linear complexity, Comput. Aided Geom. Design, 34 (2015), pp. 50–66

    work page 2015

  34. [34]

    L. F. Pavarino and S. Scacchi , Isogeometric block FETI-DP preconditioners for the Stokes and mixed linear elasticity systems , Comput. Methods Appl. Mech. Engrg., 310 (2016), pp. 694–710

    work page 2016

  35. [35]

    Sangalli and M

    G. Sangalli and M. Tani, Isogeometric preconditioners based on fast solvers for the Sylvester equation, SIAM J. Sci. Comput., 38 (2016), pp. A3644–A3671

    work page 2016

  36. [36]

    L. L. Schumaker , Spline functions: basic theory , Cambridge Mathematical Library, Cam- bridge University Press, Cambridge, third ed., 2007. 33

    work page 2007

  37. [37]

    Sederberg, J

    T. Sederberg, J. Zheng, A. Bakenov, and A. Nasri , T-splines and T-NURCCSs, ACM Trans. Graph., 22 (2003), pp. 477–484

    work page 2003

  38. [38]

    V ´azquez, A new design for the implementation of isogeometric analysis in Octave and Matlab: GeoPDEs 3.0 , Comput

    R. V ´azquez, A new design for the implementation of isogeometric analysis in Octave and Matlab: GeoPDEs 3.0 , Comput. Math. Appl., 72 (2016), pp. 523 – 554

    work page 2016

  39. [39]

    Vuong, C

    A.-V. Vuong, C. Giannelli, B. J ¨uttler, and B. Simeon , A hierarchical approach to adaptive local refinement in isogeometric analysis, Comput. Methods Appl. Mech. Engrg., 200 (2011), pp. 3554–3567

    work page 2011

  40. [40]

    X. Wei, Y. Zhang, L. Liu, and T. J. Hughes , Truncated T-splines: Fundamentals and methods, Comput. Methods Appl. Mech. Engrg., (2016), pp. –. In press

    work page 2016

  41. [41]

    Xu , Iterative methods by space decomposition and subspace correction , SIAM Rev., 34 (1992), pp

    J. Xu , Iterative methods by space decomposition and subspace correction , SIAM Rev., 34 (1992), pp. 581–613

    work page 1992

  42. [42]

    , An introduction to multigrid convergence theory , in Iterative methods in scientific com- puting (Hong Kong, 1995), Springer, Singapore, 1997, pp. 169–241

    work page 1995

  43. [43]

    J. Xu, L. Chen, and R. H. Nochetto , Optimal multilevel methods for H(grad), H(curl), and H(div) systems on graded and unstructured grids , in Multiscale, nonlinear and adaptive approximation, Springer, Berlin, 2009, pp. 599–659. 34

    work page 2009