Related papers: High order fast algorithm for the Caputo fractiona…
In this work we detail the application of a fast convolution algorithm computing high dimensional integrals to the context of multiplicative noise stochastic processes. The algorithm provides a numerical solution to the problem of…
In this paper we establish some convergence results for Riemann-Liouville, Caputo, and Caputo-Fabrizio fractional operators when the order of differentiation approaches one. We consider some errors given by $\left|\left| D^{1-\al}f…
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)…
The subdiffusion model that involves a Caputo fractional derivative in time is widely used to describe anomalously slow diffusion processes. In this work we aim at recovering the locations of small conductivity inclusions in the model from…
We study two generalizations of fractional variational problems by considering higher-order derivatives and a state time delay. We prove a higher-order integration by parts formula involving a Caputo fractional derivative of variable order…
We develop a fully discrete scheme for time-fractional diffusion equations by using a finite difference method in time and a finite element method in space. The fractional derivatives are used in Caputo sense. Stability and error estimates…
We introduce two efficient algorithms for computing the partial Fourier transforms in one and two dimensions. Our study is motivated by the wave extrapolation procedure in reflection seismology. In both algorithms, the main idea is to…
In this article, we propose a higher order approximation to Caputo fractional (C-F) derivative using graded mesh and standard central difference approximation for space derivatives, in order to obtain the approximate solution of time…
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…
In this paper we describe a new algorithm called Fast Adaptive Sequencing Technique (FAST) for maximizing a monotone submodular function under a cardinality constraint $k$ whose approximation ratio is arbitrarily close to $1-1/e$, is…
In this paper, we develop two fast implicit difference schemes for solving a class of variable-coefficient time-space fractional diffusion equations with integral fractional Laplacian (IFL). The proposed schemes utilize the graded $L1$…
We obtain two new algorithms for partial fraction decompositions; the first is over algebraically closed fields, and the second is over general fields. These algorithms takes $O(M^2)$ time, where $M$ is the degree of the denominator of the…
This study presents a novel high-order numerical method designed for solving the two-dimensional time-fractional convection-diffusion (TFCD) equation. The Caputo definition is employed to characterize the time-fractional derivative. A weak…
The Discrete Fourier Transform (DFT) is essential for various applications ranging from signal processing to convolution and polynomial multiplication. The groundbreaking Fast Fourier Transform (FFT) algorithm reduces DFT time complexity…
In this work, we propose an exponentially convergent numerical method for the Caputo fractional propagator $S_\alpha(t)$ and the associated mild solution of the Cauchy problem with time-independent sectorial operator coefficient $A$ and…
The division operation is important for many areas of data processing. Especially considering today's demand for hardware accelerators for machine learning algorithms, there is a high demand for an efficient calculation of the division…
We address a linear fractional differential equation and develop effective solution methods using algorithms for inversion of triangular Toeplitz matrices and the recently proposed QTT format. The inverses of such matrices can be computed…
The aim of this paper is to develop and analyze high-order time stepping schemes for solving semilinear subdiffusion equations. We apply the $k$-step BDF convolution quadrature to discretize the time-fractional derivative with order…
This paper presents a numerical method to solve a time-fractional Burgers equation, achieving order of convergence $(2-\alpha)$ in time, here $\alpha$ represents the order of the time derivative. The fractional derivative is modeled by…
The \Problem{knapsack} problem is a fundamental problem in combinatorial optimization. It has been studied extensively from theoretical as well as practical perspectives as it is one of the most well-known NP-hard problems. The goal is to…