Abstract
A multigrid algorithm is presented for cell-centered discretizations of interface problems. Instead of constructing the coarse grid operators by means of the Galerkin approximation, the coarse grid operators are obtained by discretization on the coarse grids. The advantage of this approach is that we obtain M -matrices on all grids, and that the sparsity pattern of the fine grid matrix is retained on all grids. Moreover, the coarse grid operators are very easy to construct. Numerical results of several test problems are presented.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
