• Italiano
  • English



Giovedì 12 maggio ore 14:30 seminario BAT-MAT prof. Luca Desiderio "ACA based acceleration of the Energetic Galerkin BEM for 2D wave propagation problems"

Ciclo di Seminari BAT-MAT (Biscuits And Tea - Maths)

Giovedì 12/05/2022 alle ore 14.30, per il ciclo di seminari BAT-MAT, presso l’aula B del plesso di Matematica e Informatica, il ricercatore del nostro dipartimento prof. Luca Desiderio terrà un seminario dal titolo:

ACA based acceleration of the Energetic Galerkin BEM for 2D wave propagation problems.

Tutti gli interessati sono invitati a partecipare, al termine del seminario verrà offerto un piccolo rinfresco in Common room.

Gli organizzatori: Davide AddonaPaolo BaroniNicoletta Tardini.


We consider scalar and vector wave propagation problems in 2D unbounded domains, reformulated in terms of space-time Boundary Integral Equations (BIEs). For their solution, we employ a weak formulation related to the energy of the system and we solve them by a Galerkin-type Boundary Element Method (BEM): this energetic approach allows to overcome the instabilities rising from the discretization of the standard weak formulation applied to this kind of integral problems. However it results that, when standard Lagrangian basis functions are considered, the BEM matrices have Toeplitz lower triangular block structure, where blocks are in general fully populated, and the overall memory cost of the energetic BEM is O(M2N), M and N being the number of the space degrees of freedom and the total number of time steps performed, respectively. This drawback prevents the application of such method to large scale realistic problems. As a possible remedy, we propose a fast technique based on the Adaptive Cross Approximation (ACA). The core of this procedure is the approximation of sufficiently large time blocks of the energetic BEM matrix through the ACA algorithm, which allows to compute only few of the original entries. This leads to reduced assembly time, which for the energetic BEM is generally relevant, coupled with reduced memory storage requirements. Additionally, the consequent acceleration of the matrix/vector multiplication together with a marching in time procedure, leads to remarkable reduction of the computational solution time. The effectiveness of the proposed method is theoretically demonstrated and several numerical results are presented and discussed.

Pubblicato Lunedì, 9 Maggio, 2022 - 12:06 | ultima modifica Lunedì, 9 Maggio, 2022 - 12:08