Related papers: Taylor-Fourier approximation
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…
In this brief, we discuss the implementation of a third order semi-implicit differentiator as a complement of the recent work by the author that proposes an interconnected semi-implicit Euler double differentiators algorithm through Taylor…
This paper presents a Carleman-Fourier linearization method for nonlinear dynamical systems with periodic vector fields involving multiple fundamental frequencies. By employing Fourier basis functions, the nonlinear dynamical system is…
A high-frequency recovered fully discrete low-regularity integrator is constructed to approximate rough and possibly discontinuous solutions of the semilinear wave equation. The proposed method, with high-frequency recovery techniques, can…
This paper investigates the errors of the solutions as well as the shadowing property of a class of nonlinear differential equations which possess unique solutions on a certain interval for any admissible initial conditions. The class of…
This paper presents a novel boundary-optimized fast Fourier extension algorithm for efficient approximation of non-periodic functions. The proposed methodology constructs periodic extensions through strategic utilization of boundary…
We consider a time fractional differential equation of order $\alpha$, $0<\alpha<1$, $$ \frac{\partial c(x,t)}{\partial t}={}^C_0\mathcal{D}_t^{\alpha}[(Ac)(x,t)]+q(x,t) ,\quad x > 0, t > 0, \quad c(x,0)=f(x). $$ where…
In the context of data-driven control of nonlinear systems, many approaches lack of rigorous guarantees, call for nonconvex optimization, or require knowledge of a function basis containing the system dynamics. To tackle these drawbacks, we…
In this paper modified variants of the sparse Fourier transform algorithms from [14] are presented which improve on the approximation error bounds of the original algorithms. In addition, simple methods for extending the improved sparse…
Fourier series multiscale method, a concise and efficient analytical approach for multiscale computation, will be developed out of this series of papers. The second paper is concerned with simultaneous approximation to functions and their…
In this letter we apply a method recently devised in \cite{aapla03} to find precise approximate solutions to a certain class of nonlinear differential equations. The analysis carried out in \cite{aapla03} is refined and results of much…
We provide an algorithm for computing semi-Fourier sequences for expressions constructed from arithmetic operations, exponentiations and integrations. The semi-Fourier sequence is a relaxed version of Fourier sequence for polynomials…
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…
The two-parameter Mittag-Leffler function $E_{\alpha, \beta}$ is of fundamental importance in fractional calculus. It appears frequently in the solutions of fractional differential and integral equations. Nonetheless, this vital function is…
The Harmonic Balance method provides a heuristic approach for finding truncated Fourier series as an approximation to the periodic solutions of ordinary differential equations. Another natural way for obtaining these type of approximations…
The nonlinear Fourier transform (NFT) has recently gained significant attention in fiber optic communications and other engineering fields. Although several numerical algorithms for computing the NFT have been published, the design of…
In this paper, we propose Hermite collocation method for solving Thomas-Fermi equation that is nonlinear ordinary differential equation on semi-infinite interval. This method reduces the solution of this problem to the solution of a system…
In this paper a spline based integral approximation is utilized to propose a sequence of approximations to the error function that converge at a significantly faster manner than the default Taylor series. The approximations can be improved…
Fast Fourier transform (FFT) based methods have turned out to be an effective computational approach for numerical homogenisation. In particular, Fourier-Galerkin methods are computational methods for partial differential equations that are…
The convolution potential arises in a wide variety of application areas, and its efficient and accurate evaluation encounters three challenges: singularity, nonlocality and anisotropy. We introduce a fast algorithm based on a far-field…