Related papers: Explicit and implicit error inhibiting schemes wit…
Probabilistic solvers for ordinary differential equations assign a posterior measure to the solution of an initial value problem. The joint covariance of this distribution provides an estimate of the (global) approximation error. The…
Typically when a semi-discrete approximation to a partial differential equation (PDE) is constructed a discretization of the spatial operator with a truncation error $\tau$ is derived. This discrete operator should be semi-bounded for the…
In time-limited model order reduction, a reduced-order approximation of the original high-order model is obtained that accurately approximates the original model within the desired limited time interval. Accuracy outside that time interval…
Zhang Neural Networks rely on convergent 1-step ahead finite difference formulas of which very few are known. Those which are known have been constructed in ad-hoc ways and suffer from low truncation error orders. This paper develops a…
High order spatial discretizations with monotonicity properties are often desirable for the solution of hyperbolic PDEs. These methods can advantageously be coupled with high order strong stability preserving time discretizations. The…
Parameter inference is essential when interpreting observational data using mathematical models. Standard inference methods for differential equation models typically rely on obtaining repeated numerical solutions of the differential…
We present a numerical method for rigorous over-approximation of a reachable set of differential inclusions. The method gives high-order error bounds for single step approximations and a uniform bound on the error over the finite time…
We consider a popular family of constrained optimization problems arising in machine learning that involve optimizing a non-decomposable evaluation metric with a certain thresholded form, while constraining another metric of interest.…
This work develops novel error expansions with computable leading order terms for the global weak error in the tau-leap discretization of pure jump processes arising in kinetic Monte Carlo models. Accurate computable a posteriori error…
The pressure-correction method is a well established approach for simulating unsteady, incompressible fluids. It is well-known that implicit discretization of the time derivative in the momentum equation e.g. using a backward…
The solution of time-dependent hyperbolic conservation laws on cut cell meshes causes the small cell problem: standard schemes are not stable on the arbitrarily small cut cells if an explicit time stepping scheme is used and the time step…
A class of explicit pseudo two-step Runge-Kutta-Nystr\"{o}m (GEPTRKN) methods for solving second-order initial value problems $y'' = f(t,y,y')$, $y(t_0) = y_0$, $y'(t_0)=y'_0$ has been studied. This new class of methods can be considered a…
A linear implicit finite difference method is proposed for the approximation of the solution to a periodic, initial value problem for a Schrodinger-Hirota equation. Optimal, second order convergence in the discrete $H^1-$norm is proved,…
An algorithm for a family of self-starting high-order implicit time integration schemes with controllable numerical dissipation is proposed for both linear and nonlinear transient problems. This work builds on the previous works of the…
When solving partial differential equations numerically, usually a high order spatial discretization is needed. Model order reduction (MOR) techniques are often used to reduce the order of spatially-discretized systems and hence reduce…
Projection-based model order reduction of dynamical systems usually introduces an error between the high-fidelity model and its counterpart of lower dimension. This unknown error can be bounded by residual-based methods, which are typically…
For a large class of fully nonlinear parabolic equations, which include gradient flows for energy functionals that depend on the solution gradient, the semidiscretization in time by implicit Runge-Kutta methods such as the Radau IIA methods…
In this paper we develop a class of Implicit-Explicit Runge-Kutta schemes for solving the multi-scale semiconductor Boltzmann equation. The relevant scale which characterizes this kind of problems is the diffusive scaling. This means that,…
Finite Difference (FD) schemes are widely used in science and engineering for approximating solutions of partial differential equations (PDEs). Error analysis of FD schemes relies on estimating the truncation error at each time step. This…
Historically speaking, it is hard to balance the global and local efficiency of second-order optimization algorithms. For instance, the classical Newton's method possesses excellent local convergence but lacks global guarantees, often…