%0 Generic %1 anderson2019modular %A Anderson, Robert %A Andrej, Julian %A Barker, Andrew %A Bramwell, Jamie %A Camier, Jean-Sylvain %A Cerveny, Jakub %A Dobrev, Veselin %A Dudouit, Yohann %A Fisher, Aaron %A Kolev, Tzanio %A Pazner, Will %A Stowell, Mark %A Tomov, Vladimir %A Dahm, Johann %A Medina, David %A Zampini, Stefano %D 2019 %K 65n30-pdes-bvps-finite-elements 65-04-numerical-analysis-software-source-code %R 10.1016/j.camwa.2020.06.009 %T MFEM: a modular finite element methods library %U http://arxiv.org/abs/1911.09220 %X MFEM is an open-source, lightweight, flexible and scalable C++ library for modular finite element methods that features arbitrary high-order finite element meshes and spaces, support for a wide variety of discretization approaches and emphasis on usability, portability, and high-performance computing efficiency. MFEM's goal is to provide application scientists with access to cutting-edge algorithms for high-order finite element meshing, discretizations and linear solvers, while enabling researchers to quickly and easily develop and test new algorithms in very general, fully unstructured, high-order, parallel and GPU-accelerated settings. In this paper we describe the underlying algorithms and finite element abstractions provided by MFEM, discuss the software implementation, and illustrate various applications of the library.

@misc{anderson2019modular, abstract = {MFEM is an open-source, lightweight, flexible and scalable C++ library for modular finite element methods that features arbitrary high-order finite element meshes and spaces, support for a wide variety of discretization approaches and emphasis on usability, portability, and high-performance computing efficiency. MFEM's goal is to provide application scientists with access to cutting-edge algorithms for high-order finite element meshing, discretizations and linear solvers, while enabling researchers to quickly and easily develop and test new algorithms in very general, fully unstructured, high-order, parallel and GPU-accelerated settings. In this paper we describe the underlying algorithms and finite element abstractions provided by MFEM, discuss the software implementation, and illustrate various applications of the library.}, added-at = {2020-07-16T06:31:18.000+0200}, author = {Anderson, Robert and Andrej, Julian and Barker, Andrew and Bramwell, Jamie and Camier, Jean-Sylvain and Cerveny, Jakub and Dobrev, Veselin and Dudouit, Yohann and Fisher, Aaron and Kolev, Tzanio and Pazner, Will and Stowell, Mark and Tomov, Vladimir and Dahm, Johann and Medina, David and Zampini, Stefano}, biburl = {https://www.bibsonomy.org/bibtex/2490ae77b6dbde4427ed67c7fccc736d8/gdmcbain}, doi = {10.1016/j.camwa.2020.06.009}, interhash = {8ec976e6c12aab0b5d6620c19c03a03d}, intrahash = {490ae77b6dbde4427ed67c7fccc736d8}, keywords = {65n30-pdes-bvps-finite-elements 65-04-numerical-analysis-software-source-code}, note = {cite arxiv:1911.09220Comment: 36 pages, 21 figures}, timestamp = {2020-08-24T06:59:39.000+0200}, title = {MFEM: a modular finite element methods library}, url = {http://arxiv.org/abs/1911.09220}, year = 2019 }