Related papers: A Fast Chebyshev Spectral Method for Nonlinear Fou…
This note presents an online pseudospectral method for system identification using Chebyshev polynomial basis under aperiodic sampling. The system dynamics are approximated piecewise by introducing a sliding time window. The number of…
We give a new fast method for evaluating sprectral approximations of nonlinear polynomial functionals. We prove that the new algorithm is convergent if the functions considered are smooth enough, under a general assumption on the spectral…
This paper presents a fast and effective computer algebraic method for analyzing and verifying non-linear integer arithmetic circuits using a novel algebraic spectral model. It introduces a concept of algebraic spectrum, a numerical form of…
In this work, a class of non-linear weakly singular fractional integro-differential equations is considered, and we first prove existence, uniqueness, and smoothness properties of the solution under certain assumptions on the given data. We…
We propose a novel and simple spectral method based on the semi-discrete Fourier transforms to discretize the fractional Laplacian $(-\Delta)^\frac{\alpha}{2}$. Numerical analysis and experiments are provided to study its performance. Our…
In this work, we develop an $\mathcal{O}(N)$ implicit real space method in 1D and 2D for the Cahn Hilliard (CH) and vector Cahn Hilliard (VCH) equations, based on the Method Of Lines Transpose (MOL$^\text{T}$) formulation. This formulation…
Moved by the need for rigorous and reliable numerical tools for the analysis of peridynamic materials, the authors propose a model able to capture the dispersive features of nonlocal soliton-like solutions obtained by a peridynamic…
We study the implementation of a Chebyshev spectral method with forward Euler integrator to investigate a peridynamic nonlocal formulation of Richards' equation. We prove the convergence of the fully-discretization of the model showing the…
In this paper, we consider the error analysis of a conservative Fourier pseudo-spectral method that conserves mass and energy for the space fractional nonlinear Schr\"{o}dinger equation. We give a new fractional Sobolev norm that can…
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 paper, we discuss the nonlinear stability and convergence of a fully discrete Fourier pseudospectral method coupled with a specially designed second order time-stepping for the numerical solution of the "good" Boussinesq equation.…
The nonlinear Fourier transform, which is also known as the forward scattering transform, decomposes a periodic signal into nonlinearly interacting waves. In contrast to the common Fourier transform, these waves no longer have to be…
In calculating integral or discrete transforms, use has been made of fast algorithms for multiplying vectors by matrices whose elements are specified as values of special (Chebyshev, Legendre, Laguerre, etc.) functions. The currently…
The idea of using polynomial methods to improve simple smoother iterations within a multigrid method for a symmetric positive definite (SPD) system is revisited. When the single-step smoother itself corresponds to an SPD operator, there is…
In this paper, we propose Fourier pseudospectral methods to solve the variable-order space fractional wave equation and develop an accelerated matrix-free approach for its effective implementation. In constant-order cases, our methods can…
Classical approximation bases such as Chebyshev polynomials provide principled and interpretable representations, but their multivariate tensor-product constructions scale exponentially with dimension and impose axis-aligned structure that…
We discuss a numerical algorithm for solving nonlinear integro-differential equations, and illustrate our findings for the particular case of Volterra type equations. The algorithm combines a perturbation approach meant to render a…
This paper considers the non-Hermitian Zakharov-Shabat (ZS) scattering problem which forms the basis for defining the SU$(2)$-nonlinear Fourier transform (NFT). The theoretical underpinnings of this generalization of the conventional…
We consider the problem of finding the Discrete Fourier Transform (DFT) of $N-$ length signals with known frequency support of size $k$. When $N$ is a power of 2 and the frequency support is a spectral set, we provide an $O(k \log k)$…
We outline a novel numerical method, called Ultrafast Ultrafast (UF$^2$), for calculating the $n^\text{th}$-order wavepackets required for calculating n-wave mixing signals. The method is simple to implement, and we demonstrate that it is…