Advertisement

Calcolo

, 55:42 | Cite as

A graph approach for the construction of high order divergence-free Raviart–Thomas finite elements

  • A. Alonso Rodríguez
  • J. Camaño
  • E. De Los Santos
  • F. Rapetti
Article
  • 85 Downloads

Abstract

We propose and analyze an efficient algorithm for the computation of a basis of the space of divergence-free Raviart–Thomas finite elements. The algorithm is based on graph techniques. The key point is to realize that, with very natural degrees of freedom for fields in the space of Raviart–Thomas finite elements of degree \(r+1\) and for elements of the space of discontinuous piecewise polynomial functions of degree \(r \ge 0\), the matrix associated with the divergence operator is the incidence matrix of a particular graph. By choosing a spanning tree of this graph, it is possible to identify an invertible square submatrix of the divergence matrix and to compute easily the moments of a field in the space of Raviart–Thomas finite elements with assigned divergence. This approach extends to finite elements of high degree the method introduced by Alotto and Perugia (Calcolo 36:233–248, 1999) for finite elements of degree one. The analyzed approach is used to construct a basis of the space of divergence-free Raviart–Thomas finite elements. The numerical tests show that the performance of the algorithm depends neither on the topology of the domain nor or the polynomial degree r.

Keywords

High order Raviart–Thomas finite elements Divergence-free finite elements Spanning tree Oriented graph Incidence matrix 

Mathematics Subject Classification

65N30 05C05 

Notes

Acknowledgements

The second author was partially supported by CONICYT-Chile through Fondecyt project 1180859 and the project AFB170001 of the PIA Program: Concurso Apoyo a Centros Cientificos y Tecnologicos de Excelencia con Financiamiento Basal. The third author was partially supported by a CONICYT (Chile) fellowship.

References

  1. 1.
    Alonso Rodríguez, A., Bertolazzi, E., Valli, A.: Simple finite element schemes for the solution of the curl-div system. arXiv:1512.08532v1 (2015)
  2. 2.
    Alonso Rodríguez, A., Camaño, J., Ghiloni, R., Valli, A.: Graphs, spanning trees and divergence-free finite elements in domains of general topology. IMA J. Numer. Anal. 37, 1986–2003 (2017)MathSciNetzbMATHGoogle Scholar
  3. 3.
    Alonso Rodríguez, A., Valli, A.: Finite element potentials. Appl. Numer. Math. 95, 2–14 (2015)MathSciNetCrossRefGoogle Scholar
  4. 4.
    Alotto, P., Perugia, I.: Mixed finite element methods and tree-cotree implicit condensation. Calcolo 36, 233–248 (1999)MathSciNetCrossRefGoogle Scholar
  5. 5.
    Bonazzoli, M., Rapetti, F.: High-order finite elements in numerical electromagnetism: degrees of freedom and generators in duality. Numer. Algorithms 74, 111–136 (2017)MathSciNetCrossRefGoogle Scholar
  6. 6.
    Cai, W., Wu, J., Xin, J.: Divergence-free \(\cal{H}({\rm div})\)-conforming hierarchical bases for magnetohydrodynamics (MHD). Commun. Math. Stat. 1, 19–35 (2013)MathSciNetCrossRefGoogle Scholar
  7. 7.
    Cai, Z., Parashkevov, R.R., Russell, T.F., Wilson, J.D., Ye, X.: Domain decomposition for a mixed finite element method in three dimensions. SIAM J. Numer. Anal. 41, 181–194 (2003)MathSciNetCrossRefGoogle Scholar
  8. 8.
    Cantarella, J., DeTurck, D., Gluck, H.: Vector calculus and the topology of domains in 3-space. Am. Math. Mon. 109, 409–442 (2002)MathSciNetCrossRefGoogle Scholar
  9. 9.
    Dubois, F.: Discrete vector potential representation of a divergence-free vector field in three-dimensional domains: numerical analysis of a model problem. SIAM J. Numer. Anal. 27, 1103–1141 (1990)MathSciNetCrossRefGoogle Scholar
  10. 10.
    Griffiths, D.F.: An approximately divergence-free \(9\)-node velocity element (with variations) for incompressible flows. Intern. J. Numer. Methods Fluids 1, 323–346 (1981)MathSciNetCrossRefGoogle Scholar
  11. 11.
    Gustafson, K., Hartman, R.: Divergence-free bases for finite element schemes in hydrodynamics. SIAM J. Numer. Anal. 20, 697–721 (1983)MathSciNetCrossRefGoogle Scholar
  12. 12.
    Hall, C.A., Ye, X.: Construction of null bases for the divergence operator associated with incompressible Navier–Stokes equations. Linear Algebra Appl. 171, 9–52 (1992)MathSciNetCrossRefGoogle Scholar
  13. 13.
    Hecht, F.: Construction d’une base de fonctions \(P_{1}\) non conforme à divergence nulle dans \({\bf R}^{3}\). RAIRO Anal. Numér. 15, 119–150 (1981)MathSciNetCrossRefGoogle Scholar
  14. 14.
    Le Borne, S., Cook II, D.: Construction of a discrete divergence-free basis through orthogonal factorization in \(\cal{H}\)-arithmetic. Computing 81, 215–238 (2007)MathSciNetCrossRefGoogle Scholar
  15. 15.
    Monk, P.: Finite element methods for Maxwell’s equations. In: Numerical Mathematics and Scientific Computation, Oxford University Press, New York (2003)Google Scholar
  16. 16.
    Nédélec, J.-C.: Mixed finite elements in \({\bf R}^3\). Numer. Math. 35, 315–341 (1980)MathSciNetCrossRefGoogle Scholar
  17. 17.
    Rapetti, F., Dubois, F., Bossavit, A.: Discrete vector potentials for nonsimply connected three-dimensional domains. SIAM J. Numer. Anal. 41, 1505–1527 (2003)MathSciNetCrossRefGoogle Scholar
  18. 18.
    Raviart, P.-A., Thomas, J.-M.: A mixed finite element method for 2nd order elliptic problems. In: Mathematical Aspects of Finite Element Methods (Proceedings of Conference on Consiglio Nazionale delle Ricerche Rome, 1975), Lecture Notes in Mathematics, vol. 606, pp. 292–315 (1977)Google Scholar
  19. 19.
    Scheichl, R.: Decoupling three-dimensional mixed problems using divergence-free finite elements. SIAM J. Sci. Comput. 23, 1752–1776 (2002)MathSciNetCrossRefGoogle Scholar
  20. 20.
    Thulasiraman, K., Swamy, M.: Graphs: Theory and Algorithms. Wiley, New York (1992)CrossRefGoogle Scholar
  21. 21.
    Wang, J., Wang, Y., Ye, X.: A robust numerical method for Stokes equations based on divergence-free \(H({\rm div})\) finite element methods. SIAM J. Sci. Comput. 31, 2784–2802 (2009)MathSciNetCrossRefGoogle Scholar

Copyright information

© Istituto di Informatica e Telematica del Consiglio Nazionale delle Ricerche 2018

Authors and Affiliations

  1. 1.Dipartimento di MatematicaUniversità di TrentoPovo, TrentoItaly
  2. 2.Departamento de Matemática y Física AplicadasUniversidad Católica de la Santísima ConcepciónConcepciónChile
  3. 3.CI2MAUniversidad de ConcepciónConcepciónChile
  4. 4.Departamento de Ingeniería MatemáticaUniversidad de ConcepciónConcepciónChile
  5. 5.Dep. de Mathématiques J.-A. DieudonnéUniv. Côte d’AzurNice cedex 02France

Personalised recommendations