BDDC Domain Decomposition Algorithms for Weak Galerkin Methods

来源 :第八届工业与应用数学国际大会 | 被引量 : 0次 | 上传用户:rentianyou123
下载到本地 , 更方便阅读
声明 : 本文档内容版权归属内容提供方 , 如果您对本文有版权争议 , 可与客服联系进行内容授权或下架
论文部分内容阅读
  A Balancing domain decomposition by constraints(BDDC)algorithm is studied for solutions of large sparse linear algebraic systems arising from weak Galerkin discretization of second order elliptic boundary value problems.
其他文献
  Integer least squares(ILS)problems arise from many applications.We first review some theory about ILS estimation.
会议
  Inspired by the successive projection method,some efficient hybrid algorithms with active-set methods are presented,which make active-set methods suitable f
会议
  In this talk,we present perturbation analysis for the total least squares(TLS)problems and develop randomized algorithms for the TLS and the truncated total
会议
  For the solution of large sparse box constrained least squares problems(BLS),a new iterative method is proposed by using CG method for inner iterations and
会议
  Least squares problems appear in many important applications in science and engineering.Recently,there have been many developments in the solution of least
会议
  In this talk we review the general methodology of the Multilevel Monte Carlo method for estimation of the variance and higher order central statistical mome
会议
  We present two multilevel algorithms for the simulation of large systems of exchangeable SDEs.
会议
  We apply several well-known tricks to improve the efficiency of the Multilevel MC method for SDEs: modified equations analysis as an alternative to strong-a
会议
  In this talk,we present preliminary results on development of C++libraries for the weak Galerkin(WG)finite element methods.
会议
  In this joint work with Rob Scheichl(Bath),Christoph Schwab(Zurich),Ian Sloan(UNSW),and Elizabeth Ullmann(Hamburg),we analyze a multilevel quasi-Monte Carlo
会议