Related papers: Taylor-Fourier approximation
Let $T$ be a square matrix with a real spectrum, and let $f$ be an analytic function. The problem of the approximate calculation of $f(T)$ is discussed. Applying the Schur triangular decomposition and the reordering, one can assume that $T$…
We explore the class of exponential integrators known as exponential time differencing (ETD) method in this letter to design low complexity nonlinear Fourier transform (NFT) algorithms that compute discrete approximations of the scattering…
This paper studies the behavior of singularly perturbed nonlinear differential equations with boundary-layer solutions that do not necessarily converge to an equilibrium. Using the average of the fast variable and assuming the boundary…
This survey on approximations of perturbed operator functions addresses recent advances and some of the successful methods.
A novel semi-Lagrangian method is introduced to solve numerically the Euler equation for ideal incompressible flow in arbitrary space dimension. It exploits the time-analyticity of fluid particle trajectories and requires, in principle,…
This paper concerns the inverse source scattering problems of recovering random sources for acoustic and elastic waves. The underlying sources are assumed to be random functions driven by an additive white noise. The inversion process aims…
In this paper we approximate high-dimensional functions $f\colon\mathbb T^d\to\mathbb C$ by sparse trigonometric polynomials based on function evaluations. Recently it was shown that a dimension-incremental sparse Fourier transform (SFT)…
Successive quadratic approximations, or second-order proximal methods, are useful for minimizing functions that are a sum of a smooth part and a convex, possibly nonsmooth part that promotes regularization. Most analyses of iteration…
The nonlinear space-fractional problems often allow multiple stationary solutions, which can be much more complicated than the corresponding integer-order problems. In this paper, we systematically compute the solution landscapes of…
Semidefinite relaxations are a powerful tool for approximately solving combinatorial optimization problems such as MAX-CUT and the Grothendieck problem. By exploiting a bounded rank property of extreme points in the semidefinite cone, we…
This paper is concerned with an alternative analytical solution of time-fractional nonlinear Schrodinger equation and nonlinear coupled Schrodinger equation obtained by employing fractional reduced differential transform method. The…
In this paper we show that a methodology based on a sampling with the Gaussian function of kind $h\,{e^{ - {{\left( {t/c} \right)}^2}}}/\left( {{c}\sqrt \pi } \right)$, where ${c}$ and $h$ are some constants, leads to the Fourier transform…
In this paper, we study functional approximations where we choose the so-called radial basis function method and more specifically, quasi-interpolation. From the various available approaches to the latter, we form new quasi-Lagrange…
In this paper we consider Sparse Fourier Transform (SFT) algorithms for approximately computing the best $s$-term approximation of the Discrete Fourier Transform (DFT) $\mathbf{\hat{f}} \in \mathbb{C}^N$ of any given input vector…
This article generalizes a recently introduced procedure to solve nonlinear systems of equations, radically departing from the conventional Newton-Raphson scheme. The original nonlinear system is first unfolded into three simpler…
The long time effect of nonlinear perturbation to oscillatory linear systems can be characterized by the averaging method, and we consider first-order averaging for its simplest applicability to high-dimensional problems. Instead of the…
We consider a sequence of approximate solutions to the compressible Euler system admitting uniform energy bounds and/or satisfying the relevant field equations modulo an error vanishing in the asymptotic limit. We show that such a sequence…
In this paper, a new class of \emph{Taylor-accelerated neural network interpolation operators} is introduced on quasi-uniform irregular grids. These operators improve existing neural network interpolation operators by incorporating Taylor…
Approximating a function with a finite series, e.g., involving polynomials or trigonometric functions, is a critical tool in computing and data analysis. The construction of such approximations via now-standard approaches like least squares…
Since it is difficult to implement implicit schemes on the infinite-dimensional space, we aim to develop the explicit numerical method for approximating super-linear stochastic functional differential equations (SFDEs). Precisely, borrowing…