Abstract
Mass-lumped continuous finite elements allow for explicit time stepping with the second-order wave equation if the resulting integration weights are positive and provide sufficient accuracy. To meet these requirements on triangular and tetrahedral meshes, the construction of continuous finite elements for a given polynomial degree on the edges involves polynomials of higher degree in the interior. The parameters describing the supporting nodes of the Lagrange interpolating polynomials and the integration weights are the unknowns of a polynomial system of equations, which is linear in the integration weights. To find candidate sets for the nodes, it is usually required that the number of equations equals the number of unknowns, although this may be neither necessary nor sufficient. Here, this condition is relaxed by requiring that the number of equations does not exceed the number of unknowns. This resulted in two new types elements of degree 6 for symmetrically placed nodes. Unfortunately, the first type is not unisolvent. There are many different elements of the second type with a large range in their associated time-stepping stability limit. To assess the efficiency of the elements of various degrees, numerical tests on a simple problem with an exact solution were performed. Efficiency was measured by the computational time required to obtain a solution at a given accuracy. For the chosen example, elements of degree 4 with fourth-order time stepping appear to be the most efficient.
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.