A two-level additive Schwarz preconditioner based on the overlapping domain decomposition approach is proposed for the local C0 discontinuous Galerkin (LCDG) method of Kirchhoff plates.Then with the help of an intergr...A two-level additive Schwarz preconditioner based on the overlapping domain decomposition approach is proposed for the local C0 discontinuous Galerkin (LCDG) method of Kirchhoff plates.Then with the help of an intergrid transfer operator and its error estimates,it is proved that the condition number is bounded by O(1 + (H4/δ4)),where H is the diameter of the subdomains and δ measures the overlap among subdomains.And for some special cases of small overlap,the estimate can be improved as O(1 + (H3/δ3)).At last,some numerical results are reported to demonstrate the high efficiency of the two-level additive Schwarz preconditioner.展开更多
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.展开更多
This paper presents a high-order coupled compact integrated RBF(CC IRBF)approximation based domain decomposition(DD)algorithm for the discretisation of second-order differential problems.Several Schwarz DD algorithms,...This paper presents a high-order coupled compact integrated RBF(CC IRBF)approximation based domain decomposition(DD)algorithm for the discretisation of second-order differential problems.Several Schwarz DD algorithms,including one-level additive/multiplicative and two-level additive/multiplicative/hybrid,are employed.The CCIRBF based DD algorithms are analysed with different mesh sizes,numbers of subdomains and overlap sizes for Poisson problems.Our convergence analysis shows that the CCIRBF two-level multiplicative version is the most effective algorithm among various schemes employed here.Especially,the present CCIRBF two-level method converges quite rapidly even when the domain is divided into many subdomains,which shows great promise for either serial or parallel computing.For practical tests,we then incorporate the CCIRBF into serial and parallel two-level multiplicative Schwarz.Several numerical examples,including those governed by Poisson and Navier-Stokes equations are analysed to demonstrate the accuracy and efficiency of the serial and parallel algorithms implemented with the CCIRBF.Numerical results show:(i)the CCIRBF-Serial and-Parallel algorithms have the capability to reach almost the same solution accuracy level of the CCIRBF-Single domain,which is ideal in terms of computational calculations;(ii)the CCIRBF-Serial and-Parallel algorithms are highly accurate in comparison with standard finite difference,compact finite difference and some other schemes;(iii)the proposed CCIRBF-Serial and-Parallel algorithms may be used as alternatives to solve large-size problems which the CCIRBF-Single domain may not be able to deal with.The ability of producing stable and highly accurate results of the proposed serial and parallel schemes is believed to be the contribution of the coarse mesh of the two-level domain decomposition and the CCIRBF approximation.It is noted that the focus of this paper is on the derivation of highly accurate serial and parallel algorithms for second-order differential problems.The scope of this work does not cover a thorough analysis of computational time.展开更多
We present a parallel Schwarz type domain decomposition preconditioned recycling Krylov subspace method for the numerical solution of stochastic indefinite elliptic equations with two random coefficients.Karhunen-Loev...We present a parallel Schwarz type domain decomposition preconditioned recycling Krylov subspace method for the numerical solution of stochastic indefinite elliptic equations with two random coefficients.Karhunen-Loeve expansions are used to represent the stochastic variables and the stochastic Galerkin method with double orthogonal polynomials is used to derive a sequence of uncoupled deterministic equations.We show numerically that the Schwarz preconditioned recycling GMRES method is an effective technique for solving the entire family of linear systems and,in particular,the use of recycled Krylov subspaces is the key element of this successful approach.展开更多
文摘A two-level additive Schwarz preconditioner based on the overlapping domain decomposition approach is proposed for the local C0 discontinuous Galerkin (LCDG) method of Kirchhoff plates.Then with the help of an intergrid transfer operator and its error estimates,it is proved that the condition number is bounded by O(1 + (H4/δ4)),where H is the diameter of the subdomains and δ measures the overlap among subdomains.And for some special cases of small overlap,the estimate can be improved as O(1 + (H3/δ3)).At last,some numerical results are reported to demonstrate the high efficiency of the two-level additive Schwarz preconditioner.
基金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.
基金the National Natural Science Foundation of China(granted No.10571017,10701015,60373015 and 60533020)National Basic Research Program of China(granted No.2005CB221300)
文摘This paper presents a high-order coupled compact integrated RBF(CC IRBF)approximation based domain decomposition(DD)algorithm for the discretisation of second-order differential problems.Several Schwarz DD algorithms,including one-level additive/multiplicative and two-level additive/multiplicative/hybrid,are employed.The CCIRBF based DD algorithms are analysed with different mesh sizes,numbers of subdomains and overlap sizes for Poisson problems.Our convergence analysis shows that the CCIRBF two-level multiplicative version is the most effective algorithm among various schemes employed here.Especially,the present CCIRBF two-level method converges quite rapidly even when the domain is divided into many subdomains,which shows great promise for either serial or parallel computing.For practical tests,we then incorporate the CCIRBF into serial and parallel two-level multiplicative Schwarz.Several numerical examples,including those governed by Poisson and Navier-Stokes equations are analysed to demonstrate the accuracy and efficiency of the serial and parallel algorithms implemented with the CCIRBF.Numerical results show:(i)the CCIRBF-Serial and-Parallel algorithms have the capability to reach almost the same solution accuracy level of the CCIRBF-Single domain,which is ideal in terms of computational calculations;(ii)the CCIRBF-Serial and-Parallel algorithms are highly accurate in comparison with standard finite difference,compact finite difference and some other schemes;(iii)the proposed CCIRBF-Serial and-Parallel algorithms may be used as alternatives to solve large-size problems which the CCIRBF-Single domain may not be able to deal with.The ability of producing stable and highly accurate results of the proposed serial and parallel schemes is believed to be the contribution of the coarse mesh of the two-level domain decomposition and the CCIRBF approximation.It is noted that the focus of this paper is on the derivation of highly accurate serial and parallel algorithms for second-order differential problems.The scope of this work does not cover a thorough analysis of computational time.
基金The research was supported in part by DOE under DE-FC02-04ER25595,and in part by NSF under grants CCF-0634894,and CNS-0722023.
文摘We present a parallel Schwarz type domain decomposition preconditioned recycling Krylov subspace method for the numerical solution of stochastic indefinite elliptic equations with two random coefficients.Karhunen-Loeve expansions are used to represent the stochastic variables and the stochastic Galerkin method with double orthogonal polynomials is used to derive a sequence of uncoupled deterministic equations.We show numerically that the Schwarz preconditioned recycling GMRES method is an effective technique for solving the entire family of linear systems and,in particular,the use of recycled Krylov subspaces is the key element of this successful approach.
