Related papers: Approximate Taylor methods for ODEs
A method based on order completion for solving general equations is presented. In particular, this method can be used for solving large classes of nonlinear systems of PDEs, with possibly associated initial and/or boundary value problems.
In this paper we discuss a projection model order reduction (MOR) method for a class of parametric linear evolution PDEs, which is based on the application of the Laplace transform. The main advantage of this approach consists in the fact…
We deal with optimal approximation of solutions of ODEs under local Lipschitz condition and inexact discrete information about the right-hand side functions. We show that the randomized two-stage Runge-Kutta scheme is the optimal method…
A new method of solving third-order ordinary complex differential equations (OCDEs) by generalizing Prelle-Singer. The idea which is a procedure for finding the solution for second-order differential equations in the real domain. We have…
Training Neural Ordinary Differential Equations (ODEs) is often computationally expensive. Indeed, computing the forward pass of such models involves solving an ODE which can become arbitrarily complex during training. Recent works have…
In this paper, two new families of fourth-order explicit exponential Runge--Kutta (ERK) methods with four stages are studied for solving first-order differential systems $y'(t)+My(t)=f(y(t))$. By comparing the Taylor series of the exact…
A practical and new Runge--Kutta numerical scheme for stochastic differential equations is explored. Numerical examples demonstrate the strong convergence of the method. The first order strong convergence is then proved using Ito integrals…
We propose a new method to solve the relativistic hydrodynamic equations based on implicit Runge-Kutta methods with a locally optimized fixed-point iterative solver. For numerical demonstration, we implement our idea for ideal hydrodynamics…
We provide new exact Taylor's series with fixed coefficients and without the remainder. We demonstrate the usefulness of this contribution by using it to obtain very simple solutions to (non-linear) PDEs. We also apply the method to the…
There has been a long history of using ordinary differential equations (ODEs) to understand the dynamics of discrete-time algorithms (DTAs). Surprisingly, there are still two fundamental and unanswered questions: (i) it is unclear how to…
When a computer algebra system fails to solve an Ordinary Differential Equation, is this a limitation of its implementation, or a genuine computational barrier? Three traditions bear on the question. Modern computer algebra algorithms can…
In this short note we provide a quantitative version of the classical Runge approximation property for second order elliptic operators. This relies on quantitative unique continuation results and duality arguments. We show that these…
Relaxation Runge-Kutta methods reproduce a fully discrete dissipation (or conservation) of entropy for entropy stable semi-discretizations of nonlinear conservation laws. In this paper, we derive the discrete adjoint of relaxation…
The main object of this paper is to construct new Durrmeyer type operators which have better features than the classical one. Some results concerning the rate of convergence and asymptotic formulas of the new operator are given. Finally,…
A trust-region algorithm using inexact function and derivatives values is introduced for solving unconstrained smooth optimization problems. This algorithm uses high-order Taylor models and allows the search of strong approximate minimizers…
This paper develops an efficient iterative method for computing all zeros of solutions of second order ordinary differential equations. A third order Halleys method is first derived by approximating the solution of an associated Riccati…
We compare the three main types of high-order one-step initial value solvers: extrapolation, spectral deferred correction, and embedded Runge--Kutta pairs. We consider orders four through twelve, including both serial and parallel…
Our main objective in this paper is to develop a second-order stochastic numerical method which generalizes the well-known deterministic TR-BDF2 scheme. Since most stochastic techniques used for approximating the solution of a stochastic…
A zero-finding technique for solving nonlinear equations more efficiently than they usually are with traditional iterative methods in which the order of convergence is improved is presented. The key idea in deriving this procedure is to…
In this work, a new technique has been presented to find approximate solution of linear integro-differential equations. The method is based on modified orthonormal Bernoulli polynomials and an operational matrix thereof. The method converts…