A numerical method for coupled 3D-1D problems with discontinuous solutions at the interfaces is derived and discussed. This extends a previous work on the subject where only continuous solutions were considered. Thanks to properly defined function spaces a well posed 3D-1D problem is obtained from the original fully 3D problem and the solution is then found by a PDE-constrained optimization reformulation. This is a domain decomposition strategy in which unknown interface variables are introduced and a suitably defined cost functional, expressing the error in fulfilling interface conditions, is minimized constrained by the constitutive equations on the subdomains. The resulting discrete problem is robust with respect to geometrical complexity thanks to the use of independent discretizations on the various subdomains. Meshes of different sizes can be used without affecting the conditioning of the discrete linear system, and this is a peculiar aspect of the considered formulation. An efficient solving strategy is further proposed, based on the use of a gradient based solver and yielding a method ready for parallel implementation. A numerical experiment on a problem with known analytical solution shows the accuracy of the method, and two examples on more complex configurations are proposed to address the applicability of the approach to practical problems.

A PDE-constrained optimization method for 3D-1D coupled problems with discontinuous solutions / Berrone, Stefano; Grappein, Denise; Scialo', Stefano. - In: NUMERICAL ALGORITHMS. - ISSN 1017-1398. - (2023). [10.1007/s11075-023-01579-w]

A PDE-constrained optimization method for 3D-1D coupled problems with discontinuous solutions

Stefano Berrone;Denise Grappein;Stefano Scialò
2023

Abstract

A numerical method for coupled 3D-1D problems with discontinuous solutions at the interfaces is derived and discussed. This extends a previous work on the subject where only continuous solutions were considered. Thanks to properly defined function spaces a well posed 3D-1D problem is obtained from the original fully 3D problem and the solution is then found by a PDE-constrained optimization reformulation. This is a domain decomposition strategy in which unknown interface variables are introduced and a suitably defined cost functional, expressing the error in fulfilling interface conditions, is minimized constrained by the constitutive equations on the subdomains. The resulting discrete problem is robust with respect to geometrical complexity thanks to the use of independent discretizations on the various subdomains. Meshes of different sizes can be used without affecting the conditioning of the discrete linear system, and this is a peculiar aspect of the considered formulation. An efficient solving strategy is further proposed, based on the use of a gradient based solver and yielding a method ready for parallel implementation. A numerical experiment on a problem with known analytical solution shows the accuracy of the method, and two examples on more complex configurations are proposed to address the applicability of the approach to practical problems.
File in questo prodotto:
File Dimensione Formato  
s11075-023-01579-w.pdf

accesso aperto

Descrizione: Articolo pubblicato
Tipologia: 2a Post-print versione editoriale / Version of Record
Licenza: Creative commons
Dimensione 1.64 MB
Formato Adobe PDF
1.64 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/2979683