REVIEW 2 cited by
General Relaxation Methods for Initial-Value Problems with Application to Multistep Schemes
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
read the original abstract
Recently, an approach known as relaxation has been developed for preserving the correct evolution of a functional in the numerical solution of initial-value problems, using Runge-Kutta methods. We generalize this approach to multistep methods, including all general linear methods of order two or higher, and many other classes of schemes. We prove the existence of a valid relaxation parameter and high-order accuracy of the resulting method, in the context of general equations, including but not limited to conservative or dissipative systems. The theory is illustrated with several numerical examples.
Forward citations
Cited by 2 Pith papers
-
Convergence of entropy-conservative summation-by-parts discretizations to smooth solutions of hyperbolic conservation laws
Entropy-conservative diagonal-norm SBP flux-differencing schemes converge at order p to smooth solutions of general entropy-symmetrizable hyperbolic systems under periodic boundaries.
-
Stability of the Active Flux Method in the Framework of Summation-by-Parts Operators
The semi-discrete Active Flux method for 1D linear advection with periodic boundaries is shown to be energy stable via newly constructed, including degenerate, summation-by-parts operators.
Discussion (0). Sign in to comment.