Pith. sign in

REVIEW

Local time-stepping for adaptive multiresolution using natural extension of Runge--Kutta methods

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 1905.08717 v1 pith:LBDVCIAK submitted 2019-05-21 math.NA cs.NAphysics.flu-dyn

Local time-stepping for adaptive multiresolution using natural extension of Runge--Kutta methods

classification math.NA cs.NAphysics.flu-dyn
keywords localtime-steppingequationsmethodmultiresolutionrunge--kuttaadaptiveefficiency
verification ladder T0 review T1 audit T2 compute T3 formal T4 reserved
0 comments
read the original abstract

A space-time fully adaptive multiresolution method for evolutionary non-linear partial differential equations is presented introducing an improved local time-stepping method. The space discretisation is based on classical finite volumes, endowed with cell average multiresolution analysis for triggering the dynamical grid adaptation. The explicit time scheme features a natural extension of Runge--Kutta methods which allow local time-stepping while guaranteeing accuracy. The use of a compact Runge--Kutta formulation permits further memory reduction. The precision and computational efficiency of the scheme regarding CPU time and memory compression are assessed for problems in one, two and three space dimensions. As application Burgers equation, reaction-diffusion equations and the compressible Euler equations are considered. The numerical results illustrate the efficiency and superiority of the proposed local time-stepping method with respect to the reference computations.

discussion (0)

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