The classical overlapping Schwarz algorithm is here extended to the triangular/tetrahedral spectral element (TSEM) discretization of elliptic problems. This discretization, based on Fekete nodes, is a generalization to nontensorial elements of the tensorial Gauss–Lobatto–Legendre quadrilateral spectral elements (QSEM). The overlapping Schwarz preconditioners are based on partitioning the domain of the problem into overlapping subdomains, solving local problems on these subdomains, and solving an additional coarse problem associated with either the subdomain mesh or the spectral element mesh. The overlap size is generous, i.e., one element wide, in the TSEM case, while it is minimal or variable in the QSEM case. The results of several numerical experiments show that the convergence rate of the proposed preconditioning algorithm is independent of the number of subdomains $N$ and the spectral degree $p$ in case of generous overlap; otherwise it depends inversely on the overlap size. The proposed preconditioners are also robust with respect to arbitrary jumps of the coefficients of the elliptic operator across subdomains.
Overlapping Schwarz methods for Fekete and Gauss-Lobatto spectral elements / L.F. Pavarino, E. Zampieri, R. Pasquetti, F. Rapetti. - In: SIAM JOURNAL ON SCIENTIFIC COMPUTING. - ISSN 1064-8275. - 29:3(2007), pp. 1073-1092.
Overlapping Schwarz methods for Fekete and Gauss-Lobatto spectral elements
L.F. PavarinoPrimo
;E. ZampieriSecondo
;
2007
Abstract
The classical overlapping Schwarz algorithm is here extended to the triangular/tetrahedral spectral element (TSEM) discretization of elliptic problems. This discretization, based on Fekete nodes, is a generalization to nontensorial elements of the tensorial Gauss–Lobatto–Legendre quadrilateral spectral elements (QSEM). The overlapping Schwarz preconditioners are based on partitioning the domain of the problem into overlapping subdomains, solving local problems on these subdomains, and solving an additional coarse problem associated with either the subdomain mesh or the spectral element mesh. The overlap size is generous, i.e., one element wide, in the TSEM case, while it is minimal or variable in the QSEM case. The results of several numerical experiments show that the convergence rate of the proposed preconditioning algorithm is independent of the number of subdomains $N$ and the spectral degree $p$ in case of generous overlap; otherwise it depends inversely on the overlap size. The proposed preconditioners are also robust with respect to arbitrary jumps of the coefficients of the elliptic operator across subdomains.File | Dimensione | Formato | |
---|---|---|---|
SIAM_JSC2007.pdf
accesso aperto
Tipologia:
Publisher's version/PDF
Dimensione
581.44 kB
Formato
Adobe PDF
|
581.44 kB | Adobe PDF | Visualizza/Apri |
Pubblicazioni consigliate
I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.