LIRK-W: Linearly-implicit Runge-Kutta methods with approximate matrix factorization

Adrian Sandu; Hong Zhang; Paul Tranquilli

REVIEW

Not yet reviewed by Pith; the record is open.

Re-run · record.json Download PDF Read on arXiv ↗

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 1611.07013 v1 pith:QOAFCRJE submitted 2016-11-21 math.NA cs.NA

LIRK-W: Linearly-implicit Runge-Kutta methods with approximate matrix factorization

Paul Tranquilli , Adrian Sandu , Hong Zhang This is my paper

classification math.NA cs.NA

keywords lirk-wschemeslinearly-implicitmethodstimeallowappearingapproach

verification ladder T0 review T1 audit T2 compute T3 formal T4 reserved

0 comments

read the original abstract

This paper develops a new class of linearly implicit time integration schemes called Linearly-Implicit Runge-Kutta-W (LIRK-W) methods. These schemes are based on an implicit-explicit approach which does not require a splitting of the right hand side and allow for arbitrary, time dependent, and stage varying approximations of the linear systems appearing in the method. Several formulations of LIRK-W schemes, each designed for specific approximation types, and their associated order condition theories are presented.

LIRK-W: Linearly-implicit Runge-Kutta methods with approximate matrix factorization

discussion (0)