In this paper we consider a multigrid approach for solving elliptic equations over non-matching grids with domain decomposition methods. The domain is partitioned into subdomains with different mesh levels that do not match at the interface. The proposed algorithm searches for the global solution over different levels by projecting the residuals on the overlap region. This method is used in conjunction with a domain decomposition solver which only requires, in each iteration step, the solutions of several small local subproblems over finite element blocks. This algorithm is shown to converge to the solution of the corresponding Lagrange multiplier problem for non-matching grids. The convergence properties of the algorithms are analyzed and numerical examples are presented. When the multigrid and domain decomposition approaches are combined, the method is shown to be reliable and easy to implement. Furthermore the local nature of the solver allows for a straightforward implementation on multiple parallel computers and graphics processing unit (GPU) clusters.

Bornia G., Chierici A., Chirco L., Giovacchini V., Manservisi S. (2021). A multigrid local smoother approach for a domain decomposition solver over non-matching grids. NUMERICAL METHODS FOR PARTIAL DIFFERENTIAL EQUATIONS, SEP 2021, 1-29 [10.1002/num.22835].

A multigrid local smoother approach for a domain decomposition solver over non-matching grids

Giovacchini V.;Manservisi S.
2021

Abstract

In this paper we consider a multigrid approach for solving elliptic equations over non-matching grids with domain decomposition methods. The domain is partitioned into subdomains with different mesh levels that do not match at the interface. The proposed algorithm searches for the global solution over different levels by projecting the residuals on the overlap region. This method is used in conjunction with a domain decomposition solver which only requires, in each iteration step, the solutions of several small local subproblems over finite element blocks. This algorithm is shown to converge to the solution of the corresponding Lagrange multiplier problem for non-matching grids. The convergence properties of the algorithms are analyzed and numerical examples are presented. When the multigrid and domain decomposition approaches are combined, the method is shown to be reliable and easy to implement. Furthermore the local nature of the solver allows for a straightforward implementation on multiple parallel computers and graphics processing unit (GPU) clusters.
2021
Bornia G., Chierici A., Chirco L., Giovacchini V., Manservisi S. (2021). A multigrid local smoother approach for a domain decomposition solver over non-matching grids. NUMERICAL METHODS FOR PARTIAL DIFFERENTIAL EQUATIONS, SEP 2021, 1-29 [10.1002/num.22835].
Bornia G.; Chierici A.; Chirco L.; Giovacchini V.; Manservisi S.
File in questo prodotto:
Eventuali allegati, non sono esposti

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/11585/860606
 Attenzione

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

Citazioni
  • ???jsp.display-item.citation.pmc??? ND
  • Scopus 0
  • ???jsp.display-item.citation.isi??? 0
social impact