Abstract

Algebraic multigrid (AMG) is one of the most efficient iterative methods for solving large structured systems of equations. However, how to build/check restriction and prolongation operators in practical AMG methods for nonsymmetric structured systems is still an interesting open question in its full generality. The present paper deals with the block-structured dense and Toeplitz-like-plus-cross systems, including nonsymmetric indefinite and symmetric positive definite (SPD) ones, arising from nonlocal diffusion problems. The simple (traditional) restriction operator and prolongation operator are employed in order to handle such block-structured dense and Toeplitz-like-plus-cross systems, which are convenient and efficient when employing a fast AMG. We provide a detailed proof of the two-grid convergence of the method for the considered SPD structures. The numerical experiments are performed in order to verify the convergence with a computational cost of only O(NlogN)\\documentclass[12pt]{minimal} \\usepackage{amsmath} \\usepackage{wasysym} \\usepackage{amsfonts} \\usepackage{amssymb} \\usepackage{amsbsy} \\usepackage{mathrsfs} \\usepackage{upgreek} \\setlength{\\oddsidemargin}{-69pt} \\begin{document}$$\\mathscr {O}(N \ ext{ log } N)$$\\end{document} arithmetic operations, by exploiting the fast Fourier transform, where N is the number of the grid points. To the best of our knowledge, this is the first contribution regarding Toeplitz-like-plus-cross linear systems solved by means of a fast AMG.

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 call

Disclaimer: 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.