Related papers: Fast and Parallel Runge-Kutta Approximation of Fra…
We show how to approximate a solution of the first order linear evolution equation, together with its possible analytic continuation, using a solution of the time-fractional equation of order $\delta >1$, where $\delta \to 1+0$.
In this paper the performance of a parallel iterated Runge-Kutta method is compared versus those of the serial fouth order Runge-Kutta and Dormand-Prince methods. It was found that, typically, the runtime for the parallel method is…
Cell collective migration plays a crucial role in a variety of physiological processes. In this work, we propose the Runge-Kutta random feature method to solve the nonlinear and strongly coupled multiphase flow problems of cells, in which…
An exponentially convergent numerical method for solving a differential equation with a right-hand fractional Riemann-Liouville time-derivative and an unbounded operator coefficient in Banach space is proposed and analysed for a…
In the paper we deal with linear fractional control problems with constant delays in the state. Single-order systems with fractional derivative in Caputo sense of orders between 0 and 1 are considered. The aim is to introduce a new…
In this work, a new relationship is established between the solutions of higher fractional differential equations and a Wright-type transformation. Solutions could be interpreted as expected values of functions in a random time process. As…
Finite element methods provide accurate and efficient methods for the numerical solution of partial differential equations by means of restricting variational problems to finite-dimensional approximating spaces. However, they do not…
The abstract Cauchy problem for the fractional evolution equation with the Caputo derivative of order $\beta\in(0,1)$ and operator $-A^\alpha$, $\alpha\in(0,1)$, is considered, where $-A$ generates a strongly continuous one-parameter…
An error analysis of Runge-Kutta convolution quadrature based on Gauss methods applied to hyperbolic operators is given. The order of convergence relies heavily on the parity of the number of stages, a more favourable situation arising for…
Stable computational algorithms for the approximate solution of the Cauchy problem for nonstationary problems are based on implicit time approximations. Computational costs for boundary value problems for systems of coupled multidimensional…
In this article, we develop a new method to approximate numerically the fractional Laplacian of functions defined on $\mathbb R$, as well as some more general singular integrals. After mapping $\mathbb R$ into a finite interval, we…
To achieve efficient and accurate long-time integration, we propose a fast, accurate, and stable high-order numerical method for solving fractional-in-space reaction-diffusion equations. The proposed method is explicit in nature and…
We apply Runge-Kutta methods to linear partial differential-algebraic equations of the form $Au_t(t,x) + B(u_{xx}(t,x)+ru_x(t,x))+Cu(t,x) = f(t,x)$, where $A,B,C\in\R^{n,n}$ and the matrix $A$ is singular. We prove that under certain…
This work presents an analytical and computational study of fractional-order delay differential equations formulated using both the conformable and Caputo derivatives. For the conformable case, we develop the associated integral,…
The numerical solution of implicit and stiff differential equations by implicit numerical integrators has been largely investigated and there exist many excellent efficient codes available in the scientific community, as Radau5 (based on a…
An unsteady problem is considered for a space-fractional equation in a bounded domain. A first-order evolutionary equation involves the square root of an elliptic operator of second order. Finite element approximation in space is employed.…
We present a C++ implementation of a fifth order semi-implicit Runge-Kutta algorithm for solving Ordinary Differential Equations. This algorithm can be used for studying many different problems and in particular it can be applied for…
We review some results on the logarithmic convexity for evolution equations, a well-known method in inverse and ill-posed problems. We start with the classical case of self-adjoint operators. Then, we analyze the case of analytic…
Recently, the numerical schemes of the Fokker-Planck equations describing anomalous diffusion with two internal states have been proposed in [Nie, Sun and Deng, arXiv: 1811.04723], which use convolution quadrature to approximate the…
To approximate convolutions which occur in evolution equations with memory terms, a variable-stepsize algorithm is presented for which advancing N steps requires only O(N log(N)) operations and O(log(N)) active memory, in place of O(N^2)…