z-logo
open-access-imgOpen Access
A Cascadic Multigrid Algorithm on the Shishkin Mesh for a Singularly Perturbed Elliptic Problem with regular layers
Author(s) -
S. V. Tikhovskaya
Publication year - 2022
Publication title -
journal of physics. conference series
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.21
H-Index - 85
eISSN - 1742-6596
pISSN - 1742-6588
DOI - 10.1088/1742-6596/2182/1/012034
Subject(s) - mathematics , richardson extrapolation , multigrid method , extrapolation , polygon mesh , perturbation (astronomy) , singular perturbation , elliptic curve , mathematical analysis , algorithm , partial differential equation , geometry , physics , quantum mechanics
A two-dimensional linear elliptic equation with regular boundary layers is considered in the unit square. It is solved by using an upwind difference scheme on the Shishkin mesh which converges uniformly with respect to a small perturbation parameter. The scheme is resolved based on an iterative method. It is known that the application of multigrid methods leads to essential reduction of arithmetical operations amount. Earlier we investigated the cascadic two-grid method with the application of Richardson extrapolation to increase accuracy of the difference scheme by an order uniform with respect to a perturbation parameter, using an interpolation formula uniform with respect to a perturbation parameter. In this paper a cascadic multigrid algorithm of the same structure is studied. We construct an extrapolation of initial guess using numerical solutions on two coarse meshes to reduce the arithmetical operations amount. The application of the Richardson extrapolation method based on numerical solutions on the last three meshes leads to increase accuracy of the difference scheme by two orders uniformly with respect to a perturbation parameter. We compare the proposed cascadic multigrid method with a multigrid method with V-cycle. The results of some numerical experiments are discussed.

The content you want is available to Zendy users.

Already have an account? Click here to sign in.
Having issues? You can contact us here