澳门新葡8455最新网站,www.8455.com,新葡京最新官网

当前位置: 澳门新葡8455最新网站 > 学术活动 > 正文
Exact and Inexact Balancing Domain Decomposition by Constraints Algorithms
澳门新葡8455最新网站:2017年05月22日 09:02 点击数:

报告人:涂学民

报告地点:澳门新葡8455最新网站108室

报告澳门新葡8455最新网站:2017年05月26日星期五13:30-14:30

邀请人:

报告摘要:

Balancing domain decomposition by constraints (BDDC) algorithms are non-overlapping domain decomposition methods for solutions of large sparse linear algebraic systems arising from the discretization of boundary value problems. They are suitable for parallel computation. The coarse problem matrix of BDDC algorithms is generated and factored by a direct solver at the beginning of the computation. It will become a bottleneck when the computer systems with a large number of processors are used. In this talk, an inexact coarse solver for BDDC algorithms is introduced and analyzed. This solver helps remove the bottleneck. At the same time, a good convergence rate is maintained. We will also talk about the extensions of these inexact BDDC algorithms to problems arising from the mixed finite element and mortar finite element discretizations.

 

主讲人概况:

Xuemin Tu is currently an associate professor in the department of Mathematics, University of Kansas. She received her Ph.D. from Courant Institute of Mathematical Sciences, New York University in 2006. Before she joined University of Kansas, she was a Morrey Assistant Professor in the department of mathematics, University of California, Berkeley and postdoc at Lawrence Berkeley National Laboratory. Her research interests include scientific computing and numerical analysis. She currently works on data assimilation, uncertainty quantification, and domain decomposition methods.

Copyright ©版权所有:澳门新葡8455最新网站

地址:吉林省长春市人民大街5268号|邮编:130024|电话:0431-85099589|传真:0431-85098237


XML 地图 | Sitemap 地图