ISOGEOMETRIC SCHWARZ PRECONDITIONERS FOR THE BIHARMONIC PROBLEM

Citations

WEB OF SCIENCE

6
Citations

SCOPUS

1

초록

A scalable overlapping Schwarz preconditioner for the biharmonic Dirichlet problem discretized by isogeometric analysis is constructed, and its convergence rate is analyzed. The proposed preconditioner is based on solving local biharmonic problems on overlapping subdomains that form a partition of the CAD domain of the problem and on solving an additional coarse biharmonic problem associated with the subdomain coarse mesh. An h-analysis of the preconditioner shows an optimal convergence rate bound that is scalable in the number of subdomains and is cubic in the ratio between subdomain and overlap sizes. Numerical results in 2D and 3D confirm this analysis and also illustrate the good convergence properties of the preconditioner with respect to the isogeometric polynomial degree p and regularity k.

키워드

domain decomposition methods; overlapping Schwarz; biharmonic problem; scalable preconditioners; isogeometric analysis; finite elements; B-splines; NURBS; BDDC PRECONDITIONERS; MULTIGRID METHODS; ELEMENT METHOD; APPROXIMATION; NURBS
제목
ISOGEOMETRIC SCHWARZ PRECONDITIONERS FOR THE BIHARMONIC PROBLEM
저자
Cho, D.; Pavarino, L. F.; Scacchi, S.
DOI
10.1553/etna_vol49s81
발행일
2018
유형
Article
저널명
Electronic Transactions on Numerical Analysis
권
49
페이지
81 ~ 102