Related papers: A stable fast time-stepping method for fractional …
In this paper, a modified Euler-Maruyama (EM) method is constructed for a kind of multi-term Riemann-Liouville stochastic fractional differential equations and the strong convergence order min{1-{\alpha}_m, 0.5} of the proposed method is…
This paper describes an updated exponential Fourier based split-step method that can be applied to a greater class of partial differential equations than previous methods would allow. These equations arise in physics and engineering, a…
In this paper, we introduce an algorithm that provides approximate solutions to semi-linear ordinary differential equations with highly oscillatory solutions, which, after an appropriate change of variables, can be rewritten as…
An algorithm is given to factor an integer with $N$ digits in $\ln^m N$ steps, with $m$ approximately 4 or 5. Textbook quadratic sieve methods are exponentially slower. An improvement with the aid of an a particular function would provide a…
A finite element scheme for an entirely fractional Allen-Cahn equation with non-smooth initial data is introduced and analyzed. In the proposed nonlocal model, the Caputo fractional in-time derivative and the fractional Laplacian replace…
Fractional order controllers become increasingly popular due to their versatility and superiority in various performance. However, the bottleneck in deploying these tools in practice is related to their analog or numerical implementation.…
We adopt a procedure of operational-umbral type to solve the $(1+1)$-dimensional fractional Fokker-Planck equation in which time fractional derivative of order $\alpha$ ($0 < \alpha < 1$) is in the Riemann-Liouville sense. The technique we…
We introduce a quantum algorithm to perform the Laplace transform on quantum computers. Already, the quantum Fourier transform (QFT) is the cornerstone of many quantum algorithms, but the Laplace transform or its discrete version has not…
In numerical linear algebra, considerable effort has been devoted to obtaining faster algorithms for linear systems whose underlying matrices exhibit structural properties. A prominent success story is the method of generalized nested…
Given a time series vector, how can we efficiently compute a specified part of Fourier coefficients? Fast Fourier transform (FFT) is a widely used algorithm that computes the discrete Fourier transform in many machine learning applications.…
A reaction-diffusion problem with a Caputo time derivative is considered. An integral discretization scheme on a graded mesh along with a decomposition of the exact solution is proposed. The truncation error estimate of the discretization…
In this paper, we combine the operator splitting methodology for abstract evolution equations with that of stochastic methods for large-scale optimization problems. The combination results in a randomized splitting scheme, which in a given…
Local time-stepping methods permit to overcome the severe stability constraint on explicit methods caused by local mesh refinement without sacrificing explicitness. In \cite{DiazGrote09}, a leapfrog based explicit local time-stepping…
An implicit finite difference method with non-uniform timesteps for solving the fractional diffusion equation in the Caputo form is proposed. The method allows one to build adaptive methods where the size of the timesteps is adjusted to the…
This paper introduces a novel approach to enhance the performance of the stochastic gradient descent (SGD) algorithm by incorporating a modified decay step size based on $\frac{1}{\sqrt{t}}$. The proposed step size integrates a logarithmic…
Recursive least-squares algorithms often use forgetting factors as a heuristic to adapt to non-stationary data streams. The first contribution of this paper rigorously characterizes the effect of forgetting factors for a class of online…
In this paper, we propose a differentiable version of the short-time Fourier transform (STFT) that allows for gradient-based optimization of the hop length or the frame temporal position by making these parameters continuous. Our approach…
This paper considers the non-Hermitian Zakharov-Shabat (ZS) scattering problem which forms the basis for defining the SU$(2)$-nonlinear Fourier transformation (NFT). The theoretical underpinnings of this generalization of the conventional…
In this article, we present an $O(N \log N)$ rapidly convergent algorithm for the numerical approximation of the convolution integral with radially symmetric weakly singular kernels and compactly supported densities. To achieve the reduced…
This paper is a contribution to the general program of embedding theories of dynamical systems. Following our previous work on the Stochastic embedding theory developed with S. Darses, we define the fractional embedding of differential…