Pith. sign in

REVIEW

Fast algebraic multigrid for block-structured dense and Toeplitz-like-plus-Cross systems arising from nonlocal diffusion problems

Not yet reviewed by Pith; the record is open.

This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.

SPECIMEN: schema-true, not a live event

T0 review · schema-true

One-sentence machine reading of the paper's core claim.

pith:XXXXXXXX · record.json · timestamp

arxiv 2202.11288 v1 pith:RRBPBBEY submitted 2022-02-23 math.NA cs.NA

Fast algebraic multigrid for block-structured dense and Toeplitz-like-plus-Cross systems arising from nonlocal diffusion problems

classification math.NA cs.NA
keywords systemsfasttoeplitz-like-plus-crossblock-structureddensealgebraicarisingcomput
verification ladder T0 review T1 audit T2 compute T3 formal T4 reserved
0 comments
Share X Bluesky LinkedIn Reddit HN
read the original abstract

Algebraic multigrid (AMG) is one of the most efficient iterative methods for solving large sparse system of equations. However, how to build/check restriction and prolongation operators in practical of AMG methods for nonsymmetric {\em sparse} systems is still an interesting open question [Brezina, Manteuffel, McCormick, Runge, and Sanders, SIAM J. Sci. Comput. (2010); Manteuffel and Southworth, SIAM J. Sci. Comput. (2019)]. This paper deals with the block-structured dense and Toeplitz-like-plus-Cross systems, including {\em nonsymmetric} indefinite, symmetric positive definite (SPD), arising from nonlocal diffusion problem and peridynamic problem. 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 is convenient and efficient when employing a fast AMG. We focus our efforts on providing the detailed proof of the convergence of the two-grid method for such SPD situations. The numerical experiments are performed in order to verify the convergence with a computational cost of only $\mathcal{O}(N \mbox{log} N)$ arithmetic operations, by using few fast Fourier transforms, 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.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.