Related papers: Boundary error control for numerical solution of B…
Local Fourier analysis is a commonly used tool for the analysis of multigrid and other multilevel algorithms, providing both insight into observed convergence rates and predictive analysis of the performance of many algorithms. In this…
The transformer model is known to be computationally demanding, and prohibitively costly for long sequences, as the self-attention module uses a quadratic time and space complexity with respect to sequence length. Many researchers have…
In this paper we consider the problem of approximating function evaluations $f(\boldsymbol x_j)$ at given nonequispaced points $\boldsymbol x_j$, $j=1,\dots N$, of a bandlimited function from given values $\hat{f}(\boldsymbol k)$,…
This paper systematically explains how to apply the invariant subspace method using variable transformation for finding the exact solutions of the (k+1)-dimensional nonlinear time-fractional PDEs in detail. More precisely, we have shown how…
We study an optimal control problem on infinite time horizon with semimartingale strategies, random coefficients and regime switching. The value function and the optimal strategy can be characterized in terms of three systems of backward…
In this paper, we show that extending the butterfly operations from the FFT algorithm to a general Butterfly Transform (BFT) can be beneficial in building an efficient block structure for CNN designs. Pointwise convolutions, which we refer…
We provide an a priori analysis of collocation methods for solving elliptic boundary value problems. They begin with information in the form of point values of the data and utilize only this information to numerically approximate the…
The paper improves the accuracy of the one-dimensional fractional Fourier transform (FRFT) by leveraging closed Newton-Cotes quadrature rules. Using the weights derived from the Composite Newton-Cotes rules of order QN, we demonstrate that…
This paper deals with asymptotic errors, limit theorems for errors between numerical and exact solutions of stochastic differential equation (SDE) driven by one-dimensional fractional Brownian motion (fBm). The Euler-Maruyama, higher-order…
Iterative algorithms based on thresholding, feedback and null space tuning (NST+HT+FB) for sparse signal recovery are exceedingly effective and fast, particularly for large scale problems. The core algorithm is shown to converge in finitely…
Fast Fourier Transform (FFT) is an essential tool in scientific and engineering computation. The increasing demand for mixed-precision FFT has made it possible to utilize half-precision floating-point (FP16) arithmetic for faster speed and…
The Forward-Forward (FF) algorithm presents a compelling, bio-inspired alternative to backpropagation. However, while efficient in training, it has a computationally prohibitive inference process that requires a separate forward pass for…
We consider second-order PDE problems set in unbounded domains and discretized by Lagrange finite elements on a finite mesh, thus introducing an artificial boundary in the discretization. Specifically, we consider the reaction diffusion…
Multivariate time series forecasting is a pivotal task in several domains, including financial planning, medical diagnostics, and climate science. This paper presents the Neural Fourier Transform (NFT) algorithm, which combines…
We improve on Fourier transforms (FT) between imaginary time $\tau$ and imaginary frequency $\omega_n$ used in certain quantum cluster approaches using the Hirsch-Fye method. The asymptotic behavior of the electron Green's function can be…
We analyze the convergence of piecewise collocation methods for computing periodic solutions of general retarded functional differential equations under the abstract framework recently developed in [S. Maset, Numer. Math. (2016)…
Algorithms for processing data in short-time batches are critical for both online and offline processing of streamed and large data respectively due to the quadratic relation between signal length and computational cost of convolution-based…
This brief aims at the issue of globally composite-learning-based neural fast finite-time (F-FnT) tracking control for a class of uncertain systems in strict-feedback form subject to nonlinearly periodic disturbances. First, uncertain…
Partial Differential Equation (PDE) problems often exhibit strong local spatial structures, and effectively capturing these structures is critical for approximating their solutions. Recently, the Fourier Neural Operator (FNO) has emerged as…
This paper provides a unifying theoretical framework for stochastic optimization algorithms by means of a latent stochastic variational problem. Using techniques from stochastic control, the solution to the variational problem is shown to…