返回
摘要
En 中文
A method is investigated for solving stationary or time-dependent discrete Stokes equations. It uses one of the standard flavors of algebraic multigrid for coupled partial differential equations, which, however, is not applied directly to the linear system stemming from discretization, but to an equivalent system obtained with a simple algebraic transformation (which may be seen as a form of preconditioning in the literal sense). A two-grid analysis is provided, showing that the eigenvalues of the preconditioned matrix are within a region of the complex plane that is both bounded and away from the origin, independently of the mesh or grid size, as well as of other main problem parameters. On the other hand, whereas the approach can in principle be combined with any type of algebraic multigrid scheme, an investigation of the properties of the coarse grid matrices reveals that plain aggregation has to be preferred to maintain nice two-grid convergence at coarser levels. Eventually, numerical experiments are reported showing that the resulting method is both robust and cost effective, being significantly faster than a state-of-the-art competitor which combines MINRES with optimal block diagonal preconditioning.
Keyword:
algebraic multigrid
AMC
Stokes problem
saddle point
multigrid
convergence analysis
linear systems
preconditioning
AI总结
对已上传原文的论文进行重点信息的提取,主要内容包括:简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
2.6
论文数:
5.1K
被引数:
1.8W

