Iterative two-level algorithm for nonsymmetric or indefinite elliptic problems

01/04/2023
by   Ming Tang, et al.
0

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.

READ FULL TEXT

Please sign up or login with your details

Forgot password? Click here to reset