Pith. sign in

REVIEW 3 major objections 6 minor 42 references

Isogeometric collocation with smooth mixed degree splines over planar multi-patch domains

T0 review · 3 major / 6 minor · reviewed 2026-08-12 · deepseek-v4-flash

Challenge this review Re-run · record.json Download PDF Read on arXiv ↗ Review JSON

Pith's one-line read A modified C^s-smooth mixed degree spline space confines the high degree p=2s+1 to inner edges and extraordinary vertices, enabling isogeometric collocation for Poisson and biharmonic equations on multi-patch domains with far fewer…

desk verdict Solid extension of mixed-degree isogeometric collocation with genuine DoF savings; the superconvergent-point selection is heuristic and partly deferred to referenced figures, but the numerical evidence is consistent and the paper deserves peer review. read the letter →

arxiv 2411.13338 v1 pith:CNZLSTK6 submitted 2024-11-20 math.NA cs.NA

Mario Kapl , Aljaž Kosmač , Vito Vitrih This is my paper · ORCID
classification math.NAcs.NA MSC 65N3565D1768U07
keywords isogeometricanalysiscollocationmixeddegreesplinespacemulti-patchdomainGrevillepointssuperconvergentPoissonequationbiharmonic
verification ladder T0 review T1 audit T2 compute T3 formal

The pith

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

The reading

The paper aims to make isogeometric collocation practical on planar multi-patch domains by constructing $C^s$-smooth discretization spaces that have the minimal possible degree $p=s+1$ almost everywhere, using the high degree $p=2s+1$ only in small neighborhoods of inner edges and of vertices with patch valency greater than one. It introduces two sets of collocation points for these mixed degree spaces, the mixed degree Greville points and the mixed degree superconvergent points, and uses them to solve Poisson's equation with $s=2$ and the biharmonic equation with $s=4$ in strong form. The numerical experiments on bilinear and bilinear-like $G^s$ multi-patch domains indicate the expected $h$-refinement convergence orders, with superconvergent points reaching up to $O(h^4)$ in the $L^2$ norm on one-patch domains while the space uses far fewer degrees of freedom than a uniform degree $p=2s+1$ space. A sympathetic reader would care because collocation avoids numerical integration, and the mixed degree construction attacks the main cost barrier of smooth multi-patch discretizations, which is the need for high spline degrees everywhere.

What carries the argument

The machinery is the mixed degree underlying spline space $S^{(p_1,p_2),s}_h([0,1]^2)$, defined as the direct sum $S_1([0,1]^2) \oplus \bar{S}_1([0,1]^2) \oplus S_2([0,1]^2)$, where $p_1=s+1$ and $p_2=2s+1$. The subspace $S_1$ contains degree-$p_1$ B-splines whose derivatives of order up to $s$ vanish on the boundary portions corresponding to inner edges, $S_2$ contains degree-$p_2$ B-splines with nonvanishing derivatives there, and $\bar{S}_1$ contains truncated degree-$p_1$ B-splines added to restore completeness. The paper's adaptation restricts the high-degree part to inner edges and to vertices of valency greater than one, in contrast to the earlier mixed degree space that used high degree near all edges and vertices. On top of this space sit two sets of collocation points: mixed degree Greville points, which assign one Greville point to every basis function of the mixed degree space, and mixed degree superconvergent points, obtained by taking clustered subsets of the known univariate superconvergent points so that their cardinality matches the Greville count. The global linear systems are formed by inserting these points into the strong form of the PDE; for multi-patch domains the systems are slightly overdetermined and solved by least squares, and for a two-patch L-shape a subset selection of superconvergent points produces a square system.

What would settle it

Solve Poisson's equation on a bilinear multi-patch domain with an extraordinary vertex of valency 5, using the $C^2$-smooth space $W^2_h$ with mixed degree superconvergent points, and measure the $L^2$ error under $h$-refinement with $h=1/8,1/16,1/32,1/64$; if the rate is $O(h^2)$ rather than $O(h^3)$, the claimed superconvergence for multi-patch domains fails. Equivalently, compute the Galerkin residual $D^s(u-u_h)$ at the mixed degree superconvergent points for a known manufactured solution and compare its vanishing rate with that at the mixed degree Greville points.

Watch

Extended reading notes

Core claim

The paper's central claim is that the adapted $C^s$-smooth mixed degree isogeometric spline space has minimal possible degree $p=s+1$ everywhere on the multi-patch domain except in a small neighborhood of inner edges and of vertices of patch valency greater than one, where degree $p=2s+1$ is required, and that this space supports isogeometric collocation for Poisson's equation with $s=2$ and the biharmonic equation with $s=4$. The space is built from a modified mixed degree underlying spline space on the unit square, and the construction yields basis functions that are linearly independent, locally supported, nonnegative, and form a partition of unity, together with an explicit dimension formula. For the collocation points, the paper generalizes Greville points to the mixed degree setting and defines mixed degree superconvergent points via clustered subsets of known one-dimensional superconvergent points. The reported numerical results show, for Greville points, convergence orders of $O(h^{p_1-1})=O(h^2)$ in all tested norms for both equations; for superconvergent points, the observed orders rise to $O(h^{p_1+1})=O(h^4)$ in $L^2$ on one-patch domains for Poisson, to $O(h^{p_1-1})=O(h^4)$ in $L^2$, $H^1$, $H^2$ for the biharmonic equation on one-patch domains, and to $O(h^3)$ on the tested multi-patch domains in most norms. The method also extends to bilinear-like $G^s$ parameterizations, allowing curved boundaries.

Load-bearing premise

The higher convergence orders claimed for the mixed degree superconvergent points rest on the unproven premise that clustered subsets of one-dimensional superconvergent points, selected to match the mixed degree Greville cardinality, retain their superconvergence for the tensor-product mixed-degree multi-patch spaces; the paper only tests this numerically on the chosen domains.

Editorial extensions

If this is right

  • Poisson's and the biharmonic equation can be solved by strong-form collocation on planar multi-patch domains using a discretization space that is mostly of degree $p=s+1$ rather than $p=2s+1$ everywhere, cutting the number of degrees of freedom substantially at equal mesh size.
  • The mixed degree superconvergent points give higher convergence orders than the mixed degree Greville points: up to $O(h^4)$ in the $L^2$ norm on one-patch domains for Poisson's equation, $O(h^4)$ in $L^2$, $H^1$, $H^2$ for the biharmonic equation on one-patch domains, and $O(h^3)$ on the tested multi-patch domains in most norms.
  • The method works for bilinear-like $G^s$ multi-patch parameterizations, so multi-patch domains with curved boundaries can be handled by the same construction.
  • On multi-patch domains the collocation system is slightly overdetermined and is solved by least squares; for a two-patch L-shape, a subset of superconvergent points yields a square linear system with the same observed convergence orders.
  • The high degree $p=2s+1$ is still required near inner edges and at vertices of patch valency greater than one, so the savings are limited to the interior of patches and near ordinary boundary vertices.

Reading between the lines

Editorial extensions of the paper, not claims the author makes directly.

  • If the clustered-selection premise behind the mixed degree superconvergent points fails on other geometries, the $L^2$ and $H^1$ advantages over Greville points could shrink from $O(h^3)$ back to $O(h^2)$ on multi-patch domains, so the superconvergence claim is the least certain part of the paper.
  • The square-system subset strategy demonstrated for one L-shape two-patch domain may generalize to multi-patch configurations with extraordinary vertices, but the paper leaves that extension open.
  • The same mostly-low-degree collocation idea could be applied to Kirchhoff-Love plates and shells or to multi-patch surfaces and volumes, as the authors suggest for future work.
  • A rigorous error analysis for collocation at mixed degree superconvergent points, rather than numerical evidence alone, would be needed to guarantee the observed convergence orders on general multi-patch domains.
Share X Bluesky LinkedIn Reddit HN

Editorial analysis

A structured set of objections, weighed in public.

Desk editor's note, referee report, and a circularity audit.

Referee Report

3 major / 6 minor

Summary. The paper develops an isogeometric collocation method for the Poisson and biharmonic equations over planar multi-patch domains, using a C^s-smooth mixed-degree spline space adapted from the authors' earlier construction [20]. The space uses degree p=s+1 in most of the domain and degree p=2s+1 only near inner edges and vertices of valency greater than one. Two sets of collocation points are introduced: mixed-degree Greville points and mixed-degree superconvergent points, the latter obtained by taking clustered subsets of known one-dimensional superconvergent points. Numerical experiments on bilinear and bilinear-like G^s multi-patch domains report convergence orders under h-refinement for the L2 norm and H^m seminorms, and an L-shape two-patch example demonstrates three strategies for selecting superconvergent points, including one that yields a square linear system.

Significance. If the mixed-degree superconvergent points behave as claimed, the method offers a substantial reduction in degrees of freedom relative to the uniformly high-degree space of [29], while preserving or improving the convergence orders observed in earlier collocation work. The paper contains several strengths: the construction of the mixed-degree space is detailed and the five geometric variants are explicitly catalogued in Appendix A; the geometries used in the examples are fully specified, including the control points for the curved bilinear-like G^4 domain in Appendix B; and the numerical results are generated with an external manufactured solution rather than fitted to the method. The convergence rates are consistent across the tested domains and both collocation point sets.

major comments (3)
  1. [Section 4.2, Eq. (14) and Fig. 4] The mixed-degree superconvergent points are constructed by selecting 'clustered subsets' of the univariate superconvergent points in (14), but the exact selection rule is not given: the text refers to [28, Fig. 3] and [21, Fig. 3] and says the redundant points are skipped 'in a clustered way' and that other cases are 'straightforward' modifications. Because the convergence orders reported in Section 5 for these points (e.g., O(h^4) in L2 for one-patch Poisson, O(h^3) for multi-patch) are the basis for the method's accuracy advantage over the Greville points, the selection procedure must be precisely described in this manuscript. Moreover, no proof or analysis is provided that the tensor-product mixed-degree multi-patch space inherits superconvergence at these clustered points; if the clustering breaks superconvergence on other geometries with different valencies or more complex G^s maps, the convergence would degrade to the Greville order O(h^2), eliminating the headline improvement. At minimum, the paper should state that this is a heuristic and provide a reproducible algorithm for the clustering.
  2. [Section 5, Tables 2 and 3, Figs. 8–11] The abstract and introduction claim that the method solves the PDEs with 'a much lower number of degrees of freedom' compared to the C^s-smooth spline space [29] with degree p=2s+1 everywhere, but no quantitative comparison is presented. The numerical section reports errors and system dimensions for the proposed method only; there is no table or figure comparing accuracy versus degrees of freedom with [29] (or with the earlier collocation papers [28,21]). Since the entire motivation of the mixed-degree construction is the reduction of degrees of freedom, a direct comparison should be included to substantiate the claim.
  3. [Section 3.1, Eq. (8) and dimension formula] The linear independence, partition of unity, and the general dimension formula of the adapted mixed-degree underlying space are asserted with the phrase 'One can show (cf. [20])' and the formula is stated without proof. The adapted space differs from the space in [20] because the set of edges treated as 'inner' depends on the patch configuration (four, three, two adjacent, two opposite, or one inner edge), and the direct sum decomposition (8) is the basis for the collocation system size. If the dimension formula or the basis property fails for any of the five variants, the reported system dimensions in Tables 2 and 3 and the least-squares step would be invalid. The paper should either prove these properties for all five variants or explicitly identify which results in [20] carry over verbatim and which require adaptation.
minor comments (6)
  1. [Section 4.1, first sentence] Typo: 'dedicted' should be 'dedicated'.
  2. [Section 4.2, text after Eq. (14)] The phrase 'The modifications to all other cases are straightforward and follow the concept visualized in Fig. 2' is too vague for reproducibility; please provide at least one worked example of a non-four-inner-edge case, or a reference to a precise algorithmic description.
  3. [Section 5, Figures 8–11] The convergence orders are reported by visual inspection of log-log plots with reference slopes. Since the orders are a central numerical claim, a table listing the estimated convergence rates for each domain, norm, and point set (or a statement of the fitted rates) would be more informative and less ambiguous.
  4. [Example 3, Tables 2 and 3] The tables give the dimensions of the linear systems but not the dimension of the spline space W^s_h; adding the latter would clarify the degree of overdetermination and allow the reader to verify the 'reduced DOFs' claim directly.
  5. [Section 6, Conclusion] The paper explicitly states that the extension to extraordinary vertices and the generalization of the square-system strategy are future work; this limitation should be mentioned earlier, e.g., at the end of Section 4 or in the introduction, so that the scope of the present contribution is clear from the outset.
  6. [References] Reference [20] is an arXiv preprint; if the final version is published, the citation should be updated. Also, the superconvergent points in (14) for S^{3,2} and S^{5,2} are stated without derivation; adding the defining polynomials (as is done for the degree-9 case) would make the section more self-contained.

Circularity Check

0 steps flagged · score 2.0 of 10

No significant circularity: the convergence claims are tested against an external manufactured solution; self-citations supply the underlying spline-space construction and the clustered-point heuristic but do not define the predicted errors.

full rationale

The derivation chain is not circular. The adapted C^s-smooth mixed degree spline space is explicitly constructed in Section 3 and Appendix A; the citation to [20] supplies the underlying mixed-degree space and basis properties ('One can show (cf. [20]) ...'), which are prerequisites rather than the target convergence results. The mixed degree Greville points and mixed degree superconvergent points are defined in Section 4 from univariate Greville and superconvergent points; the clustering rule is deferred to [28, Fig. 3] and [21, Fig. 3], and the superconvergence of the clustered tensor-product points on multi-patch domains is only verified numerically, so this is a correctness and reproducibility risk rather than a circular step. Every numerical claim is benchmarked against the manufactured solution u(x1,x2)=cos(x1)sin(x2) for both the Poisson and biharmonic problems, with no fitted parameters and with the observed orders reported as empirical findings. The main caveats are unproven heuristics and deferred proofs, not a reduction of an output to an input.

Assumptions & free parameters 1 free parameters · 4 assumptions · 0 invented entities

The central claims rest on the authors' prior construction of the mixed-degree spline space [20], on empirically calibrated superconvergent point clusters, and on the standard parametric pull-back of strong-form operators. No new physical entities are introduced; the only hand-chosen element is the clustered point selection rule, which is not fitted to the solution but is a heuristic that influences the reported convergence orders.

free parameters (1)
  • Clustered subset selection for mixed degree superconvergent points = Heuristic selection rule, no fitted number
    The paper picks k out of 2(k-1) superconvergent points in the interior subdomain [h,1-h] 'in a clustered way' and omits k points near the boundary to match the cardinality of the mixed degree Greville points (Section 4.2 and Fig. 4). This manual choice affects the achieved convergence rates and is not derived from theory.
assumptions (4)
  • domain assumption The modified mixed degree underlying spline space S^{(p1,p2),s}_h([0,1]^2) has a basis of linearly independent, nonnegative, locally supported functions that form a partition of unity in all five edge-configuration variants.
    Invoked in Section 3.1 with 'One can show (cf. [20])'; the proof is deferred to the authors' preprint [20] and the new boundary-adjacent variants are not proven here.
  • domain assumption The clustered subsets of univariate superconvergent points for S^{p,r}_h are exactly those tabulated in [28] (s=2) and [21] (s=4), and their superconvergence extends to the tensor-product mixed degree setting.
    Used in Section 4.2 to assemble mixed degree superconvergent points; no proof of superconvergence in the new multi-patch mixed-degree setting is given, only numerical evidence.
  • domain assumption Bilinear-like G^s multi-patch parameterizations from [26,29] allow the same C^s spline space construction and collocation operator as bilinear parameterizations.
    The extension to curved boundaries (Domains E and F) relies on the G^s framework of prior papers; the numerical examples assume the method transfers unchanged.
  • standard math The strong-form differential operators can be pulled back to the parameter domain via the formulas in Eqs. (4) and (7), taken from [3,21].
    Standard differential-geometric identities for the Laplacian and biharmonic operator on parametric surfaces; the paper cites [3,21].

how reviews work

0 comments
Cite this review

Pith. "Pith review of Isogeometric collocation with smooth mixed degree splines over planar multi-patch domains." pith.science (2026). https://pith.science/paper/CNZLSTK6

@misc{pith2026241113338,
  author       = {Pith},
  title        = {Pith review of: Isogeometric collocation with smooth mixed degree splines over planar multi-patch domains},
  year         = {2026},
  howpublished = {\url{https://pith.science/paper/CNZLSTK6}},
  note         = {Machine review of arXiv:2411.13338}
}
read the original abstract

We present a novel isogeometric collocation method for solving the Poisson's and the biharmonic equation over planar bilinearly parameterized multi-patch geometries. The proposed approach relies on the use of a modified construction of the C^s-smooth mixed degree isogeometric spline space [20] for s=2 and s=4 in case of the Poisson's and the biharmonic equation, respectively. The adapted spline space possesses the minimal possible degree p=s+1 everywhere on the multi-patch domain except in a small neighborhood of the inner edges and of the vertices of patch valency greater than one where a degree p=2s+1 is required. This allows to solve the PDEs with a much lower number of degrees of freedom compared to employing the C^s-smooth spline space [29] with the same high degree p=2s+1 everywhere. To perform isogeometric collocation with the smooth mixed degree spline functions, we introduce and study two different sets of collocation points, namely first a generalization of the standard Greville points to the set of mixed degree Greville points and second the so-called mixed degree superconvergent points. The collocation method is further extended to the class of bilinear-like G^s multi-patch parameterizations [26], which enables the modeling of multi-patch domains with curved boundaries, and is finally tested on the basis of several numerical examples.

Figures

Figures reproduced from arXiv: 2411.13338 by the authors.

Figure 1
Figure 1. Examples of a two-patch domain Ω (left) and of a three-patch domain Ω (right) with the patches Ω(i) and their associated geometry mappings F (i) , with the edges Γ(i) (violet) and with the vertices Ξ(i) (blue), where x (i) 1 = F (i) (ξ1, 0) and x (i) 2 = F (i) (0, ξ2). To use the isogeometric approach for solving problem (2), we first have to express the global collocation points yj , j ∈ J , with respect to local c… view at source ↗
Figure 2
Figure 2. The positions of extrema of all basis functions of the space [PITH_FULL_IMAGE:figures/full_fig_p007_2.png] view at source ↗
Figure 3
Figure 3. The mixed degree Greville points for the spaces [PITH_FULL_IMAGE:figures/full_fig_p012_3.png] view at source ↗
Figures from the paper (10 more)
Figure 4
Figure 4. Figure 4: All mixed degree superconvergent points for the spaces [PITH_FULL_IMAGE:figures/full_fig_p013_4.png]
Figure 5
Figure 5. Figure 5: Top row: Plots of the bilinear one-patch Domain A, given in (17), left, bilinear three-patch Domain B, [PITH_FULL_IMAGE:figures/full_fig_p015_5.png]
Figure 6
Figure 6. Figure 6: Top row: Plots of the biquadratic one-patch Domain D, given in (20), left, the bilinear-like [PITH_FULL_IMAGE:figures/full_fig_p016_6.png]
Figure 7
Figure 7. Figure 7: The L-shape Domain G, given by (23), left, and the domain together with the exact solution (15), right. [PITH_FULL_IMAGE:figures/full_fig_p017_7.png]
Figure 8
Figure 8. Figure 8: Example 1. Plots of the relative errors (16) computed with respect to the [PITH_FULL_IMAGE:figures/full_fig_p017_8.png]
Figure 9
Figure 9. Figure 9: Example 1. Plots of the relative errors (16) computed with respect to the [PITH_FULL_IMAGE:figures/full_fig_p018_9.png]
Figure 10
Figure 10. Figure 10: Example 2. Plots of the relative errors (16) computed with respect to the [PITH_FULL_IMAGE:figures/full_fig_p019_10.png]
Figure 11
Figure 11. Figure 11: Example 2. Plots of the relative errors (16) computed with respect to the [PITH_FULL_IMAGE:figures/full_fig_p020_11.png]
Figure 12
Figure 12. Figure 12: Example 3. Different sets of mixed degree superconvergent points (for [PITH_FULL_IMAGE:figures/full_fig_p021_12.png]
Figure 13
Figure 13. Figure 13: Example 3. Different sets of superconvergent points (for [PITH_FULL_IMAGE:figures/full_fig_p022_13.png]

Discussion (0). Continue with ORCID to comment.

Reference graph

Works this paper leans on

42 extracted references · 42 canonical work pages

  1. [20]

    M. Kapl, A. Kosmaˇ c, and V. Vitrih. A C s-smooth mixed degree and regularity isogeometric spline space over planar multi-patch domains. https://arxiv.org/abs/2407.17046, 2024. 25

    work page Pith review arXiv 2024

  2. [29]

    Kapl and V

    M. Kapl and V. Vitrih. C s-smooth isogeometric spline spaces over planar multi-patch pa- rameterizations. Advances in Computational Mathematics , 47:47, 2021

    work page 2021

  3. [28]

    Kapl and V

    M. Kapl and V. Vitrih. Isogeometric collocation on planar multi-patch domains. Comput. Methods Appl. Mech. Engrg. , 360:112684, 2020

    work page 2020

  4. [21]

    M. Kapl, A. Kosmaˇ c, and V. Vitrih. Isogeometric collocation for solving the biharmonic equation over planar multi-patch domains. Computer Methods in Applied Mechanics and Engineering, 424:116882, 2024

    work page 2024

  5. [1]

    Anitescu, Y

    C. Anitescu, Y. Jia, Y. J. Zhang, and T. Rabczuk. An isogeometric collocation method using superconvergent points. Comput. Methods Appl. Mech. Engrg. , 284:1073–1097, 2015

    work page 2015

  6. [2]

    Auricchio, L

    F. Auricchio, L. Beir˜ ao da Veiga, T. J. R. Hughes, A. Reali, and G. Sangalli. Isogeometric collocation methods. Math. Models Methods Appl. Sci. , 20(11):2075–2107, 2010

    work page 2010

  7. [3]

    Bartezzaghi, L

    A. Bartezzaghi, L. Ded` e, and A. Quarteroni. Isogeometric analysis of high order partial differential equations on surfaces. Comput. Methods Appl. Mech. Engrg., 295:446 – 469, 2015

    work page 2015

  8. [4]

    Beir˜ ao da Veiga, A

    L. Beir˜ ao da Veiga, A. Buffa, G. Sangalli, and R. V´ azquez. Mathematical analysis of varia- tional isogeometric methods. Acta Numerica, 23:157–287, 5 2014

    work page 2014

Show all 42 references
  1. [5]

    Bercovier and T

    M. Bercovier and T. Matskewich. Smooth B´ ezier Surfaces over Unstructured Quadrilateral Meshes. Lecture Notes of the Unione Matematica Italiana, Springer, 2017

    2017

  2. [6]

    Blidia, B

    A. Blidia, B. Mourrain, and G. Xu. Geometrically smooth spline bases for data fitting and simulation. Comput. Aided Geom. Des. , 78:101814, 2020

    2020

  3. [7]

    Casquero, L

    H. Casquero, L. Liu, Y. Zhang, A. Reali, and H. Gomez. Isogeometric collocation us- ing analysis-suitable T-splines of arbitrary degree. Comput. Methods Appl. Mech. Engrg. , 301:164–186, 2016

    2016

  4. [8]

    C.L. Chan, C. Anitescu, and T. Rabczuk. Isogeometric analysis with strong multipatch C1-coupling. Comput. Aided Geom. Design , 62:294–310, 2018

    2018

  5. [9]

    C.L. Chan, C. Anitescu, and T. Rabczuk. Strong multipatch C 1-coupling for isogeometric analysis on 2D and 3D domains. Comput. Methods Appl. Mech. Engrg. , 357:112599, 2019

    2019

  6. [10]

    Collin, G

    A. Collin, G. Sangalli, and T. Takacs. Analysis-suitable G 1 multi-patch parametrizations for C1 isogeometric spaces. Comput. Aided Geom. Des. , 47:93 – 113, 2016

    2016

  7. [11]

    J. A. Cottrell, T. J. R. Hughes, and Y. Bazilevs. Isogeometric Analysis: Toward Integration of CAD and FEA . John Wiley & Sons, Chichester, England, 2009

    2009

  8. [12]

    Fahrendorf, L

    F. Fahrendorf, L. De Lorenzis, and H. Gomez. Reduced integration at superconvergent points in isogeometric analysis. Comput. Methods Appl. Mech. Engrg. , 328:390–410, 2018

    2018

  9. [13]

    Farahat, B

    A. Farahat, B. J¨ uttler, M. Kapl, and T. Takacs. Isogeometric analysis with C 1-smooth functions over multi-patch surfaces. Comput. Methods Appl. Mech. Engrg. , 403:115706, 2023

    2023

  10. [14]

    Farahat, M

    A. Farahat, M. Kapl, A. Kosmaˇ c, and V. Vitrih. A locally based construction of analysis- suitable G1 multi-patch spline surfaces. Comput. Math. Appl. , 168:46–57, 2024

    2024

  11. [15]

    G. Farin. Curves and Surfaces for Computer-Aided Geometric Design . Academic Press, 1997

    1997

  12. [16]

    Gomez and L

    H. Gomez and L. De Lorenzis. The variational collocation method. Comput. Methods Appl. Mech. Engrg., 309:152–181, 2016

    2016

  13. [17]

    Gomez, A

    H. Gomez, A. Reali, and G. Sangalli. Accurate, efficient, and (iso)geometrically flexible collocation methods for phase-field models. J. Comput. Phys. , 262:153–171, 2014

    2014

  14. [18]

    Hoschek and D

    J. Hoschek and D. Lasser. Fundamentals of computer aided geometric design . A K Peters Ltd., Wellesley, MA, 1993

    1993

  15. [19]

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

    2005

  16. [22]

    M. Kapl, G. Sangalli, and T. Takacs. An isogeometric C 1 subspace on unstructured multi- patch planar domains. Comput. Aided Geom. Des. , 69:55–75, 2019

    2019

  17. [23]

    M. Kapl, G. Sangalli, and T. Takacs. A family of C 1 quadrilateral finite elements. Adv. Comp. Math. , 47(6):82, 2021

    2021

  18. [24]

    Kapl and V

    M. Kapl and V. Vitrih. Space of C 2-smooth geometrically continuous isogeometric functions on planar multi-patch geometries: Dimension and numerical experiments. Comput. Math. Appl., 73(10):2319–2338, 2017

    2017

  19. [25]

    Kapl and V

    M. Kapl and V. Vitrih. Space of C 2-smooth geometrically continuous isogeometric functions on two-patch geometries. Comput. Math. Appl. , 73(1):37–59, 2017

    2017

  20. [26]

    Kapl and V

    M. Kapl and V. Vitrih. Dimension and basis construction for C 2-smooth isogeometric spline spaces over bilinear-like G2 two-patch parameterizations. J. Comput. Appl. Math. , 335:289– 311, 2018

    2018

  21. [27]

    Kapl and V

    M. Kapl and V. Vitrih. Solving the triharmonic equation over multi-patch planar domains using isogeometric analysis. J. Comput. Appl. Math. , 358:385–404, 2019

    2019

  22. [30]

    Karˇ ciauskas and J

    K. Karˇ ciauskas and J. Peters. Refinable G1 functions on G1 free-form surfaces. Comput. Aided Geom. Des., 54:61–73, 2017

    2017

  23. [31]

    Karˇ ciauskas and J

    K. Karˇ ciauskas and J. Peters. Refinable bi-quartics for design and analysis. Comput.-Aided Des., pages 204–214, 2018

    2018

  24. [32]

    Lai and L

    M.-J. Lai and L. L. Schumaker. Spline functions on triangulations, volume 110 of Encyclopedia of Mathematics and its Applications . Cambridge University Press, Cambridge, 2007

    2007

  25. [33]

    Maurin, F

    F. Maurin, F. Greco, L. Coox, D. Vandepitte, and W. Desmet. Isogeometric collocation for Kirchhoff-Love plates and shells. Comput. Methods Appl. Mech. Engrg. , 329:396–420, 2018

    2018

  26. [34]

    Montardini, G

    M. Montardini, G. Sangalli, and L. Tamellini. Optimal-order isogeometric collocation at Galerkin superconvergent points. Comput. Methods Appl. Mech. Engrg. , 316:741–757, 2017

    2017

  27. [35]

    Mourrain, R

    B. Mourrain, R. Vidunas, and N. Villamizar. Dimension and bases for geometrically con- tinuous splines on surfaces of arbitrary topology. Comput. Aided Geom. Des. , 45:108 – 133, 2016

    2016

  28. [36]

    Nguyen, K

    T. Nguyen, K. Karˇ ciauskas, and J. Peters. C 1 finite elements on non-tensor-product 2d and 3d manifolds. Applied Mathematics and Computation , 272:148–158, 2016

    2016

  29. [37]

    Nguyen and J

    T. Nguyen and J. Peters. Refinable C 1 spline elements for irregular quad layout. Comput. Aided Geom. Des., 43:123–130, 2016

    2016

  30. [38]

    Reali and H

    A. Reali and H. Gomez. An isogeometric collocation approach for Bernoulli-Euler beams and Kirchhoff plates. Comput. Methods Appl. Mech. Engrg. , 284:623–636, 2015

    2015

  31. [39]

    Schillinger, J

    D. Schillinger, J. A. Evans, A. Reali, M. A. Scott, and T. J.R. Hughes. Isogeometric colloca- tion: Cost comparison with Galerkin methods and extension to adaptive hierarchical NURBS discretizations. Comput. Methods Appl. Mech. Engrg. , 267:170 – 232, 2013. 26

    2013

  32. [40]

    Toshniwal, H

    D. Toshniwal, H. Speleers, and T. J. R. Hughes. Smooth cubic spline spaces on unstructured quadrilateral meshes with particular emphasis on extraordinary points: Geometric design and isogeometric analysis considerations. Comput. Methods Appl. Mech. Engrg. , 327:411– 458, 2017

    2017

  33. [41]

    Wei, X Li, K

    X. Wei, X Li, K. Qian, T. J. R Hughes, Y. J Zhang, and H. Casquero. Analysis-suitable unstructured T-splines: Multiple extraordinary points per face. Comput. Methods Appl. Mech. Engrg., 391:114494, 2022

    2022

  34. [42]

    Wen. Z., Md. S. Faruque, X. Li, X. Wei, and H. Casquero. Isogeometric analysis using G-spline surfaces with arbitrary unstructured quadrilateral layout. Comput. Methods Appl. Mech. Engrg., 408:115965, 2023. 27

    2023

Pith tools

Reviewed August 12, 2026 · model on record in the stance chip above.