Abstract
We analyze a new algorithm for the finite element approximation of a family of eigenvalue problems for the curl operator that includes, in particular, the approximation of the helicity of a bounded domain. It exploits a tree-cotree decomposition of the graph relating the degrees of freedom of the Lagrangian finite elements and those of the first family of Nédélec finite elements to reduce significantly the dimension of the algebraic eigenvalue problem to be solved. The algorithm is well adapted to domains of general topology. Numerical experiments, including a not simply connected domain with a not connected boundary, are presented in order to assess the performance and generality of the method.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: 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.
