Pith. sign in

REVIEW

Uniform convergence of V-cycle multigrid algorithms for two-dimensional fractional Feynman-Kac equation

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 1602.08226 v4 pith:TWWGSGUX submitted 2016-02-26 math.NA cs.NA

Uniform convergence of V-cycle multigrid algorithms for two-dimensional fractional Feynman-Kac equation

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

In this paper we derive new uniform convergence estimates for the V-cycle MGM applied to symmetric positive definite Toeplitz block tridiagonal matrices, by also discussing few connections with previous results. More concretely, the contributions of this paper are as follows: (1) It tackles the Toeplitz systems directly for the elliptic PDEs. (2) Simple (traditional) restriction operator and prolongation operator are employed in order to handle general Toeplitz systems at each level of the recursion. Such a technique is then applied to systems of algebraic equations generated by the difference scheme of the two-dimensional fractional Feynman-Kac equation, which describes the joint probability density function of non-Brownian motion. In particular, we consider the two coarsening strategies, i.e., doubling the mesh size (geometric MGM) and Galerkin approach (algebraic MGM), which lead to the distinct coarsening stiffness matrices in the general case: however, several numerical experiments show that the two algorithms produce almost the same error behaviour.

discussion (0)

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