2 research outputs found
Advanced techniques in scientific computing: application to electromagnetics
Mención Internacional en el tÃtulo de doctorDurante los últimos años, los componentes de radiofrecuencia que
forman parte de un sistema de comunicaciones necesitan simulaciones
cada vez más exigentes desde el punto de vista de recursos computacionales.
Para ello, se han desarrollado diferentes técnicas con el método de
los elementos finitos (FEM) como la conocida como adaptatividad hp,
que consiste en estimar el error en el problema electromagnético para
generar mallas de elementos adecuadas al problema que obtienen una
aproximación de forma más efectiva que las mallas estándar; o métodos
de descomposición de dominios (DDM), basado en la división del problema
original en problemas más pequeños que se pueden resolver en
paralelo. El principal problema de las técnicas de adaptatividad es que
ofrecen buenas prestaciones para problemas bidimensionales, mientras
que en tres dimensiones el tiempo de generación de las mallas adaptadas
es prohibitivo. Por otra parte, DDM se ha utilizado satisfactoriamente
para la simulación de problemas eléctricamente muy grandes y de gran
complejidad, convirtiéndose en uno de los temas más actuales en la comunidad
de electromagnetismo computacional.
El principal objetivo de este trabajo es estudiar la viabilidad de algoritmos
escalables (en términos de paralelización) combinando DDM no
conformes y adaptatividad automática en tres dimensiones. Esto permitir
Ãa la ejecución de algoritmos de adaptatividad independiente en cada
subdominio de DDM. En este trabajo se presenta y discute un prototipo
que combina técnicas de adaptatividad y DDM, que aún no se han tratado en detalle en la comunidad cientÃfica. Para ello, se implementan
tres bloques fundamentales: i) funciones de base para los elementos finitos
que permitan órdenes variables dentro de la misma malla; ii) DDM no
conforme y sin solapamiento; y iii) algoritmos de adaptatividad en tres
dimensiones. Estos tres bloques se han implementado satisfactoriamente
en un código FEM mediante un método sistemático basado en el método
de las soluciones manufacturadas (MMS). Además, se ha llevado a cabo
una paralelización a tres niveles: a nivel de algoritmo, con DDM; a nivel
de proceso, con MPI (Message Passing Interface); y a nivel de hebra, con
OpenMP; todo en un código modular que facilita el mantenimiento y la
introducción de nuevas caracterÃsticas.
Con respecto al primer bloque fundamental, se ha desarrollado una
familia de funciones base con un enfoque sistemático que permite la
expansión correcta del espacio de funciones. Por otra parte, se han introducido
funciones de base jerárquicas de otros autores (con los que el
grupo al que pertenece el autor de la tesis ha colaborado estrechamente
en los últimos años) para facilitar la introducción de diferentes órdenes
de aproximación en el mismo mallado.
En lo relativo a DDM, se ha realizado un estudio cuantitativo del
error generado por las disconformidades en la interfaz entre subdominios,
incluidas las discontinuidades generadas por un algoritmo de adaptatividad.
Este estudio es fundamental para el correcto funcionamiento
de la adaptatividad, y no ha sido evaluado con detalle en la comunidad
cientÃfica.
Además, se ha desarrollado un algoritmo de adaptatividad con prismas
triangulares, haciendo especial énfasis en las peculiaridades debidas
a la elección de este elemento. Finalmente, estos tres bloques básicos
se han utilizado para desarrollar, y discutir, un prototipo que une las
técnicas de adaptatividad y DDM.In the last years, more and more accurate and demanding simulations
of radiofrequency components in a system of communications are
requested by the community. To address this need, some techniques have
been introduced in finite element methods (FEM), such as hp adaptivity
(which estimates the error in the problem and generates tailored meshes
to achieve more accuracy with less unknowns than in the case of uniformly
refined meshes) or domain decomposition methods (DDM, consisting
of dividing the whole problem into more manageable subdomains
which can be solved in parallel). The performance of the adaptivity techniques
is good up to two dimensions, whereas for three dimensions the
generation time of the adapted meshes may be prohibitive. On the other
hand, large scale simulations have been reported with DDM becoming a
hot topic in the computational electromagnetics community.
The main objective of this dissertation is to study the viability of
scalable (in terms of parallel performance) algorithms combining nonconformal
DDM and automatic adaptivity in three dimensions. Specifically,
the adaptivity algorithms might be run in each subdomain independently.
This combination has not been detailed in the literature
and a proof of concept is discussed in this work. Thus, three building
blocks must be introduced: i) basis functions for the finite elements
which support non-uniform approximation orders p; ii) non-conformal
and non-overlapping DDM; and iii) adaptivity algorithms in 3D. In this
work, these three building blocks have been successfully introduced in a FEM code with a systematic procedure based on the method of manufactured
solutions (MMS). Moreover, a three-level parallelization (at the
algorithm level, with DDM; at the process level, with message passing
interface (MPI), and at the thread level, with OpenMP) has been developed
using the paradigm of modular programming which eases the
software maintenance and the introduction of new features.
Regarding first building block, a family of basis functions which follows
a sound mathematical approach to expand the correct space of
functions is developed and particularized for triangular prisms. Also,
to ease the introduction of different approximation orders in the same
mesh, hierarchical basis functions from other authors are used as a black
box. With respect to DDM, a thorough study of the error introduced
by the non-conformal interfaces between subdomains is required for the
adaptivity algorithm. Thus, a quantitative analysis is detailed including
non-conformalities generated by independent refinements in neighbor
subdomains. This error has not been assessed with detail in the literature
and it is a key factor for the adaptivity algorithm to perform properly.
An adaptivity algorithm with triangular prisms is also developed and
special considerations for the implementation are explained. Finally, on
top of these three building blocks, the proof of concept of adaptivity
with DDM is discussed.Programa Oficial de Doctorado en Multimedia y ComunicacionesPresidente: Daniel Segovia Vargas.- Secretario: David Pardo Zubiaur.- Vocal: Romanus Dyczij-Edlinge
Investigation of general-purpose computing on graphics processing units and its application to the finite element analysis of electromagnetic problems
In this dissertation, the hardware and API architectures of GPUs are investigated, and the corresponding acceleration techniques are applied on the traditional frequency domain finite element method (FEM), the element-level time-domain methods, and the nonlinear discontinuous Galerkin method. First, the assembly and the solution phases of the FEM are parallelized and mapped onto the granular GPU processors. Efficient parallelization strategies for the finite element matrix assembly on a single GPU and on multiple GPUs are proposed. The parallelization strategies for the finite element matrix solution, in conjunction with parallelizable preconditioners are investigated to reduce the total solution time. Second, the element-level dual-field domain decomposition (DFDD-ELD) method is parallelized on GPU. The element-level algorithms treat each finite element as a subdomain, where the elements march the fields in time by exchanging fields and fluxes on the element boundary interfaces with the neighboring elements. The proposed parallelization framework is readily applicable to similar element-level algorithms, where the application to the discontinuous Galerkin time-domain (DGTD) methods show good acceleration results. Third, the element-level parallelization framework is further adapted to the acceleration of nonlinear DGTD algorithm, which has potential applications in the field of optics. The proposed nonlinear DGTD algorithm describes the third-order instantaneous nonlinear effect between the electromagnetic field and the medium permittivity. The Newton-Raphson method is incorporated to reduce the number of nonlinear iterations through its quadratic convergence. Various nonlinear examples are presented to show the different Kerr effects observed through the third-order nonlinearity. With the acceleration using MPI+GPU under large cluster environments, the solution times for the various linear and nonlinear examples are significantly reduced