Domain decomposition methods for partial differential equations

偏微分方程的域分解方法

• 批准号: 250303-2011
• 负责人: Lui, ShiuHong(Shaun)
• 金额: $ 0.73万
• 依托单位: University of Manitoba
• 依托单位国家: 加拿大
• 项目类别: Discovery Grants Program - Individual
• 财政年份: 2013
• 资助国家: 加拿大
• 起止时间: 2013-01-01 至 2014-12-31
• 项目状态: 已结题
• 来源: https://www.nserc-crsng.gc.ca/ase-oro/Details-Detailles_eng.asp?id=525006
• 关键词: Domain; decomposition; methods; partial; differential

Many problems in science and engineering are posed as partial differential equations (PDEs). For instance, conservations of mass, momentum and energy can be expressed as PDEs. Except for very simple cases, no analytic solution is available and we often rely on a numerical solution of the PDEs. This grant proposal deals with a class of methods called domain decomposition methods. In modern scientific computing, the problems are so large that no single computer can handle the computational and memory demands. The idea is to split up the domain into smaller subdomains and on a parallel computer, assign each processor to a subdomain. We solve the PDE on each subdomain in parallel and then stitch together these solutions to form the global solution. These are iterative methods, meaning that typically, the computed solution converges to the exact solution after infinitely many iterations. Of course in practice, the iteration is stopped when a prescribed error tolerance is satisfied. The goal is a numerical scheme which converges optimally, that is, at a rate which is independent of the discretization parameter. Another important issue is how to define the boundary condition(s) along each interior boundary. There is a subclass of methods, called Optimized Schwarz methods, which cleverly chooses free parameter(s) in the interior boundary conditions to optimize the convergence rate. We shall work on second-order PDEs as well as more difficult fourth-order PDEs. The latter PDEs are more difficult because they are far more ill-conditioned than second-order PDEs - the rate of convergence of traditional iterative methods is far slower for the fourth-order case. This program will implement these new algorithms as well as develop a theory of convergence rate of the methods. If successful, these methods will allow scientists and engineers to solve more complex problems and/or solve problems with a higher resolution.

科学和工程中的许多问题都可以归结为偏微分方程。 例如，质量守恒、动量守恒和能量守恒可以用偏微分方程表示。 除了非常简单的情况下，没有解析解是可用的，我们经常依赖于一个数值解的偏微分方程。 这个拨款提案涉及一类称为域分解方法的方法。 在现代科学计算中，问题是如此之大，以至于没有一台计算机可以处理计算和内存需求。 其思想是将域分割成更小的子域，并在并行计算机上将每个处理器分配给子域。我们并行求解每个子域上的偏微分方程，然后将这些解缝合在一起形成全局解。 这些是迭代方法，这意味着通常，计算的解在无限次迭代后收敛到精确解。 当然，在实践中，当满足规定的误差容限时，迭代停止。 我们的目标是一个数值计划，收敛最佳，也就是说，在一个速度是独立的离散化参数。 另一个重要的问题是如何定义沿沿着每个内部边界的边界条件。 有一个子类的方法，称为优化的施瓦茨方法，它巧妙地选择自由参数（s）的内部边界条件，以优化收敛速度。 我们将研究二阶偏微分方程以及更困难的四阶偏微分方程。 后者的偏微分方程更困难，因为它们比二阶偏微分方程更病态-传统迭代方法的收敛速度在四阶情况下要慢得多。该程序将实现这些新的算法，以及开发的方法的收敛速度的理论。 如果成功，这些方法将使科学家和工程师能够解决更复杂的问题和/或以更高的分辨率解决问题。