This paper introduces a domain decomposition preconditioner for elliptic equations with rough coefficients. The coarse space of the domain decomposition method is constructed via the so-called rough polyharmonic splin...This paper introduces a domain decomposition preconditioner for elliptic equations with rough coefficients. The coarse space of the domain decomposition method is constructed via the so-called rough polyharmonic splines （RPS for short）. As an approximation space of the eUiptic problem, RPS is known to recover the quasi-optimal convergence rate and attain the quasi-optimal localization property. The authors lay out the formulation of the RPS based domain decomposition preconditioner, and numerically verify the performance boost of this method through several examples.展开更多
基金supported by the National Natural Science Foundation of China(No.11471214)the One Thousand Plan of China for young scientists
文摘This paper introduces a domain decomposition preconditioner for elliptic equations with rough coefficients. The coarse space of the domain decomposition method is constructed via the so-called rough polyharmonic splines （RPS for short）. As an approximation space of the eUiptic problem, RPS is known to recover the quasi-optimal convergence rate and attain the quasi-optimal localization property. The authors lay out the formulation of the RPS based domain decomposition preconditioner, and numerically verify the performance boost of this method through several examples.
