A graph-based algorithm for the approximation of the spectrum of the curl operator
A graph-based algorithm for the approximation of the spectrum of the curl operator
"A graph-based algorithm for the approximation of the spectrum of the curl operator", organizado por CITMAga. Será impartido por Ana Alonso. Dipartimento di Matematica. Università degli Studi di Trento.
Data: 23 de xaneiro de 2025.
Hora: 10:00 h.
Duración: 1 hora
Lugar: Aula Magna da Facultade de Matemáticas (USC) e online por MS Teams a través do enlace Teams Meeting.
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 significantly reduce 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, will be presented in order to illustrate the performance and generality of the method.
(Joint work with Jessika Camaño, Universidad Católica de la Santísima Concepción, Departamento de Matemática y Física Aplicadas, Concepción, Chile).