Abstract
We combine recently developed finite element algorithms based on Bernstein polynomials [M. Ainsworth, G. Andriamaro, and O. Davydov, SIAM J. Sci. Comput., 33 (2011), pp. 3087--3109; R. C. Kirby, Numer. Math., 117 (2011), pp. 631--652] with the explicit basis construction of the finite element exterior calculus [D. N. Arnold, R. S. Falk, and R. Winther, Comput. Methods Appl. Mech. Engrg., 198 (2009), pp. 1660--1672] to give a family of algorithms for the de Rham complex on simplices that achieves stiffness matrix construction and matrix-free action in optimal complexity. These algorithms are based on realizing the exterior calculus bases as short combinations of Bernstein polynomials. Numerical results confirm optimal scaling of the algorithms and favorable comparison with FEniCS at high polynomial order as well. Additional empirical studies show that very high accuracy is achieved in the mixed discretization of the Poisson equation and the Maxwell eigenvalue problem as the polynomial degree increases.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.