UNIFIED HYBRIDIZATION OF DISCONTINUOUS GALERKIN, MIXED, AND CONTINUOUS GALERKIN METHODS FOR SECOND ORDER ELLIPTIC PROBLEMS

被引:781
|
作者
Cockburn, Bernardo [1 ]
Gopalakrishnan, Jayadeep [2 ]
Lazarov, Raytcho [3 ]
机构
[1] Univ Minnesota, Sch Math, Minneapolis, MN 55455 USA
[2] Univ Florida, Dept Math, Gainesville, FL 32611 USA
[3] Texas A&M Univ, Dept Math, College Stn, TX 77843 USA
基金
美国国家科学基金会;
关键词
discontinuous Galerkin methods; mixed methods; continuous methods; hybrid methods; elliptic problems; FINITE-ELEMENT METHODS; ERROR ANALYSIS; STOKES SYSTEM; PART I;
D O I
10.1137/070706616
中图分类号
O29 [应用数学];
学科分类号
070104 ;
摘要
We introduce a unifying framework for hybridization of finite element methods for second order elliptic problems. The methods fitting in the framework are a general class of mixed-dual finite element methods including hybridized mixed, continuous Galerkin, nonconforming, and a new, wide class of hybridizable discontinuous Galerkin methods. The distinctive feature of the methods in this framework is that the only globally coupled degrees of freedom are those of an approximation of the solution defined only on the boundaries of the elements. Since the associated matrix is sparse, symmetric, and positive definite, these methods can be efficiently implemented. Moreover, the framework allows, in a single implementation, the use of different methods in different elements or subdomains of the computational domain, which are then automatically coupled. Finally, the framework brings about a new point of view, thanks to which it is possible to see how to devise novel methods displaying very localized and simple mortaring techniques, as well as methods permitting an even further reduction of the number of globally coupled degrees of freedom.
引用
下载
收藏
页码:1319 / 1365
页数:47
相关论文
共 50 条
  • [1] LOW ORDER DISCONTINUOUS GALERKIN METHODS FOR SECOND ORDER ELLIPTIC PROBLEMS
    Burman, E.
    Stamm, B.
    SIAM JOURNAL ON NUMERICAL ANALYSIS, 2008, 47 (01) : 508 - 533
  • [2] Unified analysis of discontinuous Galerkin methods for elliptic problems
    Arnold, DN
    Brezzi, F
    Cockburn, B
    Marini, LD
    SIAM JOURNAL ON NUMERICAL ANALYSIS, 2002, 39 (05) : 1749 - 1779
  • [3] SUPERCONVERGENT DISCONTINUOUS GALERKIN METHODS FOR SECOND-ORDER ELLIPTIC PROBLEMS
    Cockburn, Bernardo
    Guzman, Johnny
    Wang, Haiying
    MATHEMATICS OF COMPUTATION, 2009, 78 (265) : 1 - 24
  • [4] Discontinuous Galerkin methods for elliptic problems
    Arnold, DN
    Brezzi, F
    Cockburn, B
    Marini, D
    DISCONTINUOUS GALERKIN METHODS: THEORY, COMPUTATION AND APPLICATIONS, 2000, 11 : 89 - 101
  • [5] Locally discontinuous but globally continuous Galerkin methods for elliptic problems
    Arruda, Natalia C. B.
    Loula, Abimael F. D.
    Almeida, Regina C.
    COMPUTER METHODS IN APPLIED MECHANICS AND ENGINEERING, 2013, 255 : 104 - 120
  • [6] HIGH ORDER DISCONTINUOUS GALERKIN METHODS FOR ELLIPTIC PROBLEMS ON SURFACES
    Antonietti, Paola F.
    Dedner, Andreas
    Madhavan, Pravin
    Stangalino, Simone
    Stinner, Bjoern
    Verani, Marco
    SIAM JOURNAL ON NUMERICAL ANALYSIS, 2015, 53 (02) : 1145 - 1171
  • [7] Families of interior penalty hybridizable discontinuous Galerkin methods for second order elliptic problems
    Fabien, Maurice S.
    Knepley, Matthew G.
    Riviere, Beatrice M.
    JOURNAL OF NUMERICAL MATHEMATICS, 2020, 28 (03) : 161 - 174
  • [8] A POSTERIORI ERROR ANALYSIS FOR HYBRIDIZABLE DISCONTINUOUS GALERKIN METHODS FOR SECOND ORDER ELLIPTIC PROBLEMS
    Cockburn, Bernardo
    Zhang, Wujun
    SIAM JOURNAL ON NUMERICAL ANALYSIS, 2013, 51 (01) : 676 - 693
  • [9] Continuous Galerkin and Enriched Galerkin Methods with Arbitrary Order Discontinuous Trial Functions for the Elliptic and Parabolic Problems with Jump Conditions
    Andreas Rupp
    Sanghyun Lee
    Journal of Scientific Computing, 2020, 84
  • [10] Continuous Galerkin and Enriched Galerkin Methods with Arbitrary Order Discontinuous Trial Functions for the Elliptic and Parabolic Problems with Jump Conditions
    Rupp, Andreas
    Lee, Sanghyun
    JOURNAL OF SCIENTIFIC COMPUTING, 2020, 84 (01)