Iterative two-level algorithm for nonsymmetric or indefinite elliptic problems
Numerical Analysis
2023-01-05 v1 Numerical Analysis
Analysis of PDEs
Abstract
In this paper, a new iterative two-level algorithm is presented for solving the finite element discretization for nonsymmetric or indefinite elliptic problems. The iterative two-level algorithm uses the same coarse space as the traditional two-grid algorithm, but its ``fine space'' uses the higher oder finite element space under the coarse grid. Therefore, the iterative two-level algorithm only needs one grid, and the computational cost is much lower than the traditional iterative two-grid algorithm. Finally, compared with the traditional two-grid algorithm, numerical experiments show that the computational cost is lower to achieve the same convergence order.
Cite
@article{arxiv.2301.01426,
title = {Iterative two-level algorithm for nonsymmetric or indefinite elliptic problems},
author = {Ming Tang and Xiaoqing Xing and Ying Yang and Liuqiang Zhong},
journal= {arXiv preprint arXiv:2301.01426},
year = {2023}
}