Pith. sign in

REVIEW

Infinite Time Solutions of Numerical Schemes for Advection 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 2010.15365 v1 pith:COKF4TPP submitted 2020-10-29 math.NA cs.NA

Infinite Time Solutions of Numerical Schemes for Advection Problems

classification math.NA cs.NA
keywords methodsnumericalinfinitetimeconvergenceproblemssolutionsadvection
verification ladder T0 review T1 audit T2 compute T3 formal T4 reserved
0 comments
read the original abstract

This paper addresses the question whether there are numerical schemes for constant-coefficient advection problems that can yield convergent solutions for an infinite time horizon. The motivation is that such methods may serve as building blocks for long-time accurate solutions in more complex advection-dominated problems. After establishing a new notion of convergence in an infinite time limit of numerical methods, we first show that linear methods cannot meet this convergence criterion. Then we present a new numerical methodology, based on a nonlinear jet scheme framework. We show that these methods do satisfy the new convergence criterion, thus establishing that numerical methods exist that converge on an infinite time horizon, and demonstrate the long-time accuracy gains incurred by this property.

discussion (0)

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