A new Parallel Robin-Robin (P-RR) adaptive Iterative Coupling (IC) algorithm with dynamic relaxation parameters is proposed for the Boundary Element Method (BEM), and relaxation parameters are derived for other existing IC algorithms. The performances of the new algorithm and of the modified existing algorithms are investigated in terms of convergence properties with respect to the number of sub-domains, mesh density, interface mesh conformity and BEM element types. Results show that the number of sub-domains and the refinement level of the mesh are the two dominant factors affecting the performances of the considered algorithms. The proposed P-RR algorithm shows the best overall convergence behavior for the tested large problems, thanks to its effectiveness in handling complex boundary conditions and large number of sub-domains, thus resulting very promising for efficient parallel BEM computing and large coupling problems.

Iterative coupling algorithms for large multi-domain problems with the boundary element method / Wang, Bin; Feng, Yin; Pieraccini, Sandra; Scialò, Stefano; Fidelibus, Corrado. - In: INTERNATIONAL JOURNAL FOR NUMERICAL METHODS IN ENGINEERING. - ISSN 0029-5981. - STAMPA. - 117:1(2019), pp. 1-14. [10.1002/nme.5943]

Iterative coupling algorithms for large multi-domain problems with the boundary element method

Pieraccini, Sandra;Scialò, Stefano;Fidelibus, Corrado
2019

Abstract

A new Parallel Robin-Robin (P-RR) adaptive Iterative Coupling (IC) algorithm with dynamic relaxation parameters is proposed for the Boundary Element Method (BEM), and relaxation parameters are derived for other existing IC algorithms. The performances of the new algorithm and of the modified existing algorithms are investigated in terms of convergence properties with respect to the number of sub-domains, mesh density, interface mesh conformity and BEM element types. Results show that the number of sub-domains and the refinement level of the mesh are the two dominant factors affecting the performances of the considered algorithms. The proposed P-RR algorithm shows the best overall convergence behavior for the tested large problems, thanks to its effectiveness in handling complex boundary conditions and large number of sub-domains, thus resulting very promising for efficient parallel BEM computing and large coupling problems.
File in questo prodotto:
File Dimensione Formato  
WangEtAlii17IJNME.pdf

Open Access dal 22/08/2019

Descrizione: Versione post referaggio
Tipologia: 2. Post-print / Author's Accepted Manuscript
Licenza: PUBBLICO - Tutti i diritti riservati
Dimensione 4.87 MB
Formato Adobe PDF
4.87 MB Adobe PDF Visualizza/Apri
Pubblicazioni consigliate

I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.

Utilizza questo identificativo per citare o creare un link a questo documento: https://hdl.handle.net/11583/2712029
 Attenzione

Attenzione! I dati visualizzati non sono stati sottoposti a validazione da parte dell'ateneo