A finite element framework based on bivariate simplex splines on triangle configurations

被引:11
|
作者
Cao, Juan [1 ,2 ]
Chen, Zhonggui [3 ]
Wei, Xiaodong [4 ,5 ]
Zhang, Yongjie Jessica [4 ]
机构
[1] Xiamen Univ, Sch Math Sci, Xiamen 361005, Fujian, Peoples R China
[2] Xiamen Univ, Fujian Prov Key Lab Math Modeling & High Performa, Xiamen 361005, Fujian, Peoples R China
[3] Xiamen Univ, Dept Comp Sci, Xiamen 361000, Fujian, Peoples R China
[4] Carnegie Mellon Univ, Dept Mech Engn, Pittsburgh, PA 15213 USA
[5] Ecole Polytech Fed Lausanne, Inst Math, CH-1015 Lausanne, Switzerland
基金
中国国家自然科学基金;
关键词
Simplex spline; TCB-splines; Isogeometric analysis; Triangulation; ISOGEOMETRIC ANALYSIS; GEOMETRIC DESIGN; T-SPLINES; B-SPLINES; MESHES; SPACES; CONSTRUCTION; CONVERGENCE; EQUATIONS; NURBS;
D O I
10.1016/j.cma.2019.112598
中图分类号
T [工业技术];
学科分类号
08 ;
摘要
Recently, triangle configuration based bivariate simplex splines (referred to as TCB-spline) have been introduced to the geometric computing community. TCB-splines retain many attractive theoretic properties of classical B-splines, such as partition of unity, local support, polynomial reproduction and automatic inbuilt high-order smoothness. In this paper, we propose a computational framework for isogeometric analysis using TCB-splines. The centroidal Voronoi tessellation method is used to generate a set of knots that are distributed evenly over the domain. Then, knot subsets are carefully selected by a so-called link triangulation procedure (LTP), on which shape functions are defined in a recursive manner. To achieve high-precision numerical integration, triangle faces served as background integration cells are obtained by triangulating the entire domain restricted to all knot lines, i.e., line segments defined by any two knots in a knot subset. Various numerical examples are carried out to demonstrate the efficiency, flexibility and optimal convergence rates of the proposed method. (C) 2019 Elsevier B.V. All rights reserved.
引用
收藏
页数:21
相关论文
共 50 条
  • [1] Surface reconstruction using bivariate simplex splines on Delaunay configurations
    Cao, Juan
    Li, Xin
    Wang, Guozhao
    Qin, Hong
    COMPUTERS & GRAPHICS-UK, 2009, 33 (03): : 341 - 350
  • [2] A finite element method by using bivariate splines for one dimensional heat equations
    Qu, Kai
    Wang, Zhiping
    Jiang, Bo
    Journal of Information and Computational Science, 2013, 10 (12): : 3659 - 3666
  • [3] Computing bivariate splines in scattered data fitting and the finite-element method
    Schumaker, Larry L.
    NUMERICAL ALGORITHMS, 2008, 48 (1-3) : 237 - 260
  • [4] Computing bivariate splines in scattered data fitting and the finite-element method
    Larry L. Schumaker
    Numerical Algorithms, 2008, 48 : 237 - 260
  • [5] Bivariate B-splines from convex configurations
    Schmitt, Dominique
    JOURNAL OF COMPUTER AND SYSTEM SCIENCES, 2021, 120 : 42 - 61
  • [6] Bivariate simplex B-splines: A new paradigm
    Neamtu, M
    SPRING CONFERENCE ON COMPUTER GRAPHICS, PROCEEDINGS, 2001, : 71 - 78
  • [7] An adaptive DG finite element method by using bivariate splines for linear parabolic PDEs
    Wang, Renhong
    Qu, Kai
    Wu, Jinming
    Journal of Information and Computational Science, 2010, 7 (03): : 753 - 758
  • [8] AN ALGORITHM FOR CONSTRUCTING CONFIGURATIONS OF KNOTS FOR BIVARIATE B-SPLINES
    MEYLING, RHJG
    SIAM JOURNAL ON NUMERICAL ANALYSIS, 1987, 24 (03) : 706 - 724
  • [9] Bivariate B-Splines from Convex Pseudo-circle Configurations
    Schmitt, Dominique
    FUNDAMENTALS OF COMPUTATION THEORY, FCT 2019, 2019, 11651 : 335 - 349
  • [10] Simplex-splines on the Clough-Tocher element
    Lyche, Tom
    Merrien, Jean-Louis
    COMPUTER AIDED GEOMETRIC DESIGN, 2018, 65 : 76 - 92