Locally adapted meshes and polynomial degrees can greatly improve spectral element accuracy and applicability. A balancing domain decomposition by constraints (BDDC) preconditioner is constructed and analysed for both continuous (CG) and discontinuous (DG) Galerkin discretizations of scalar elliptic problems, built by nodal spectral elements with variable polynomial degrees. The DG case is reduced to the CG case via the auxiliary space method. The proposed BDDC preconditioner is proved to be scalable in the number of subdomains and quasi-optimal in both the ratio of local polynomial degrees and element sizes and the ratio of subdomain and element sizes. Several numerical experiments in the plane confirm the obtained theoretical convergence rate estimates, and illustrate the preconditioner performance for both CG and DG discretizations. Different configurations with locally adapted polynomial degrees are studied, as well as the preconditioner robustness with respect to discontinuities of the elliptic coefficients across subdomain boundaries. These results apply also to other dual-primal preconditioners defined by the same set of primal constraints, such as FETI-DP preconditioners.

BDDC preconditioners for continuous and discontinuous Galerkin methods using spectral/hp elements with variable local polynomial degree / C. Canuto, L.F. Pavarino, A.B. Pieri. - In: IMA JOURNAL OF NUMERICAL ANALYSIS. - ISSN 0272-4979. - 34:3(2014), pp. 879-903. [10.1093/imanum/drt037]

BDDC preconditioners for continuous and discontinuous Galerkin methods using spectral/hp elements with variable local polynomial degree

L.F. Pavarino
Secondo
;
2014

Abstract

Locally adapted meshes and polynomial degrees can greatly improve spectral element accuracy and applicability. A balancing domain decomposition by constraints (BDDC) preconditioner is constructed and analysed for both continuous (CG) and discontinuous (DG) Galerkin discretizations of scalar elliptic problems, built by nodal spectral elements with variable polynomial degrees. The DG case is reduced to the CG case via the auxiliary space method. The proposed BDDC preconditioner is proved to be scalable in the number of subdomains and quasi-optimal in both the ratio of local polynomial degrees and element sizes and the ratio of subdomain and element sizes. Several numerical experiments in the plane confirm the obtained theoretical convergence rate estimates, and illustrate the preconditioner performance for both CG and DG discretizations. Different configurations with locally adapted polynomial degrees are studied, as well as the preconditioner robustness with respect to discontinuities of the elliptic coefficients across subdomain boundaries. These results apply also to other dual-primal preconditioners defined by the same set of primal constraints, such as FETI-DP preconditioners.
auxiliary space method; BDDC; discontinuous Galerkin method; dual-primal preconditioner; elliptic problems; FETI-DP
Settore MAT/08 - Analisi Numerica
Article (author)
File in questo prodotto:
File Dimensione Formato  
IMA J Numer Anal-2014-Canuto-879-903.pdf

accesso riservato

Tipologia: Publisher's version/PDF
Dimensione 656.2 kB
Formato Adobe PDF
656.2 kB Adobe PDF   Visualizza/Apri   Richiedi una copia
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/2434/249320
Citazioni
  • ???jsp.display-item.citation.pmc??? ND
  • Scopus 27
  • ???jsp.display-item.citation.isi??? 25
social impact