Sparsity optimized high order finite element functions for H(div) on simplices. (English) Zbl 1256.65100

The authors investigate the space of vector valued-functions with square-integrable divergence and conforming \(h_p\) finite element discretization for open bounded Lipschitz domains \(\Omega\subset \mathbb R^d\) with \(d=2,3\). A new set of of basis functions for \(H\)(div)-conforming \(h_p\) finite element spaces, which yields an optimal sparsity pattern for system matrices derived from the discretization of some convenient bilinear form, is introduced. The construction of basis functions relies on some known construction principles in the literature which concerns the sparsity of \(H\)(div))-conforming discretizations. More precise, the construction principles are related to the use of Raviart-Thomas elements, mixed-weighted Jacobi polynomials, and Dubiner basis. This construction implies the \(L_2\) orthogonality of the fluxes of the basis.
The proof of sparsity of the mass matrix requires some symbolic computation. The stated finite element basis form a hierarchical set of \(H\)(div)-conforming basis functions and hence are applicable also in general settings on unstructured (curved) simplicial meshes.


65N30 Finite element, Rayleigh-Ritz and Galerkin methods for boundary value problems involving PDEs
65N22 Numerical solution of discretized equations for boundary value problems involving PDEs
65N50 Mesh generation, refinement, and adaptive methods for boundary value problems involving PDEs
35J25 Boundary value problems for second-order elliptic equations
Full Text: DOI Link


[1] Abramowitz, M., Stegun, I. (eds): Handbook of Mathematical Functions. Dover, NY (1965) · Zbl 0171.38503
[2] Ainsworth M., Coyle J.: Hierarchical finite element bases on unstructured tetrahedral meshes. Int. J. Numer. Methods Eng. 58(14), 2103–2130 (2003) · Zbl 1042.65088
[3] Andrews, G.E., Askey, R., Roy, R.: Special functions. In: Encyclopedia of Mathematics and its Applications, vol. 71. Cambridge University Press, Cambridge (1999) · Zbl 0920.33001
[4] Arnold, D.N., Falk, R.S., Winther, R.: Differential complexes and stability of finite element methods I: the de Rham complex. In: Arnold, D., Bochev, P., Lehoucq, R., Nicolaides, R., Shaskov, M. (eds.) Compatible Spatial Discretizations. The IMA Volumes in Mathematics and its Applications, vol. 142, pp. 23–46. Springer, Berlin (2006) · Zbl 1119.65398
[5] Babuška, I., Suri, M.: The p- and h-p versions of the finite element method, an overview. Comput. Methods Appl. Mech. Eng. 80(1–3), 5–26 (1990, spectral and high order methods for partial differential equations (Como, 1989))
[6] Bećirović A., Paule P., Pillwein V., Riese A., Schneider C., Schöberl J.: Hypergeometric summation algorithms for high-order finite elements. Computing 78(3), 235–249 (2006) · Zbl 1113.65105
[7] Beuchler S., Pillwein V.: Shape functions for tetrahedral p-fem using integrated Jacobi polynomials. Computing 80, 345–375 (2007) · Zbl 1172.65384
[8] Beuchler, S., Pillwein, V.: Completions to sparse shape functions for triangular and tetrahedral p-fem. In: Langer, U., Discacciati, M., Keyes, D.E., Widlund, O.B., Zulehner, W., (eds.) Proceedings of the 17th International Conference on Domain Decomposition Methods in Science and Engineering XVII held at St. Wolfgang/Strobl, Austria, (July 3–7, 2006). Lecture Notes in Computational Science and Engineering, vol. 60, pp. 435–442, Springer, Heidelberg (2008)
[9] Beuchler, S., Pillwein, V., Zaglmayr S.: Sparsity optimized high order finite element functions for H(div) on simplices. Technical Report 2010-04, DK Computational Mathematics, JKU Linz (2010) · Zbl 1256.65100
[10] Beuchler S., Schöberl J.: New shape functions for triangular p-fem using integrated Jacobi polynomials. Numer. Math. 103, 339–366 (2006) · Zbl 1095.65101
[11] Bossavit, A.: Computational electromagnetism: variational formulation, complementary, edge elements. In: Electromagnetism. Academic Press, London (1989) · Zbl 0688.73076
[12] Brezzi F., Fortin M.: Mixed and Hybrid Finite Element Methods. Springer, Berlin (1991) · Zbl 0788.73002
[13] Demkowicz L.: Computing with hp Finite Elements. CRC Press/Taylor & Francis, Boca Raton/ London (2006)
[14] Demkowicz L., Buffa A.: H 1, H(curl) and H(div)-conforming projection-based interpolation in three dimensions. quasi-optimal p-interpolation estimates. Comput. Methods Appl. Mech. Eng. 194, 267–296 (2005) · Zbl 1143.78365
[15] Demkowicz, L., Kurtz, J., Pardo, D., Paszyński, M., Rachowicz, W., Zdunek, A.: Computing with hp-adaptive finite elements. In: Frontiers: three dimensional elliptic and Maxwell problems with applications. Applied Mathematics and Nonlinear Science Series, vol. 2. Chapman & Hall/CRC Press, Boca Raton (2008) · Zbl 1148.65001
[16] Demkowicz L., Monk P., Vardapetyan L., Rachowicz W.: De Rham diagram for hp finite element spaces. Comput. Math. Appl. 39(7–8), 29–38 (2000) · Zbl 0955.65084
[17] Dubiner M.: Spectral methods on triangles and other domains. J. Sci. Comput. 6, 345 (1991) · Zbl 0742.76059
[18] Girault, V., Raviart, P.-A.: Finite element methods for Navier–Stokes equations. In: Theory and Algorithms. Springer Series in Computational Mathematics, vol. 5. Springer, Berlin (1986) · Zbl 0585.65077
[19] Karniadakis G.M., Sherwin S.J.: Spectral/HP Element Methods for CFD. Oxford University Press, Oxford (1999) · Zbl 0954.76001
[20] Koornwinder, T.: Two-variable analogues of the classical orthogonal polynomials. In: Theory and Application of Special Functions (Proc. Advanced Sem., Math. Res. Center, Univ. Wisconsin, Madison, Wis., 1975). Math. Res. Center, Univ. Wisconsin, Publ. No. 35, pp. 435–495. Academic Press, New York (1975) · Zbl 0326.33002
[21] Melenk J.M., Gerdes K., Schwab C.: Fully discrete hp-finite elements: fast quadrature. Comput. Methods Appl. Mech. Eng. 190, 4339–4364 (1999) · Zbl 0985.65141
[22] Nédélec J.C.: Mixed finite elements in $${\(\backslash\)mathbb{R}\^3}$$ . Numerische Mathematik 35(35), 315–341 (1980) · Zbl 0419.65069
[23] Nédélec J.C.: A new family of mixed finite elements in $${\(\backslash\)mathbb{R}\^3}$$ . Numerische Mathematik 50(35), 57–81 (1986) · Zbl 0625.65107
[24] Orszag, S.A.: Spectral methods for problems in complex geometries. J. Comp. Phys. 37–80 (1980) · Zbl 0476.65078
[25] Paule, P., Pillwein, V., Schneider, C., Schöberl, J.: Hypergeometric Summation Techniques for High Order Finite Elements. In: PAMM, vol. 6, pp. 689–690. Wiley InterScience, Weinheim (2006). doi: 10.1002/pamm.200610325 · Zbl 1113.65105
[26] Raviart, P.A., Thomas, J.M.: A mixed finite element method for 2nd order elliptic problems. In: Mathematical aspects of finite element methods. Lecture Notes in Mathematics, vol. 606. Berlin (1977) · Zbl 0362.65089
[27] Schöberl, J., Zaglmayr, S.: High order Nédélec elements with local complete sequence properties. COMPEL 24(2) (2005) · Zbl 1135.78337
[28] Schwab C.: p- and hp-finite element methods. Theory and applications in solid and fluid mechanics. Clarendon Press, Oxford (1998) · Zbl 0910.73003
[29] Sherwin S.J.: Hierarchical hp finite elements in hybrid domains. Finite Elem. Anal. Des. 27, 109–119 (1997) · Zbl 0896.65074
[30] Sherwin S.J., Karniadakis G.E.: A new triangular and tetrahedral basis for high-order finite element methods. Int. J. Numer. Methods Eng. 38, 3775–3802 (1995) · Zbl 0837.73075
[31] Solin P., Segeth K., Dolezel I.: Higher-Order Finite Element Methods. CRC Press/Chapman & Hall, Boca Raton/London (2003)
[32] Szabo B., Duester A., Rank E.: The p-version of the finite element method. In: Stein, E., Borst, R., Hughes, T.J. (eds) Encyclopedia of Computational Mechanics, Wiley, London (2004)
[33] Tricomi F.G., Vorlesungen über F.G.: Orthogonalreihen. Springer, Berlin (1955)
[34] Zaglmayr, S.: High Order Finite Elements for Electromagnetic Field Computation. PhD thesis, Johannes Kepler University, Linz, Austria (2006)
This reference list is based on information provided by the publisher or from digital mathematics libraries. Its items are heuristically matched to zbMATH identifiers and may contain data conversion errors. It attempts to reflect the references listed in the original paper as accurately as possible without claiming the completeness or perfect precision of the matching.