Rational methods for abstract linear, non-homogeneous problems without order reduction
Carlos Arranz-Sim\'on, Cesar Palencia

TL;DR
This paper introduces stable rational methods for solving abstract linear non-homogeneous problems that achieve the desired order without reduction, requiring only one evaluation of the non-homogeneous term per step.
Contribution
It proposes new families of stable, high-order methods based on rational approximations to the exponential function, avoiding order reduction in time discretization.
Findings
Methods are of order p, matching the approximation order.
Only one evaluation of f per step is needed.
Methods effectively prevent order reduction phenomena.
Abstract
Starting from an A-stable rational approximation to of order , families of stable methods are proposed to time discretize abstract IVP's of the type . These numerical procedures turn out to be of order , thus overcoming the order reduction phenomenon, and only one evaluation of per step is required.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsAerospace Engineering and Control Systems · Matrix Theory and Algorithms · Material Science and Thermodynamics
