Related papers: Algorithm for computing semi-Fourier sequences of …
In this paper, we introduce a new method for calculating fractional integrals and differentials. The method involves an equation that we have obtained from infinite applied integration by parts. The equation works for special class of…
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…
While teaching a course on integral equations, I noticed that a straightforward combination of Neumann series and Fourier series for the resolvent (or the solution) of an integral equation has good approximation qualities. This short…
Regular chains and triangular decompositions are fundamental and well-developed tools for describing the complex solutions of polynomial systems. This paper proposes adaptations of these tools focusing on solutions of the real analogue:…
In our recent publication [1] we presented an exponential series approximation suitable for highly accurate computation of the complex error function in a rapid algorithm. In this Short Communication we describe how a simplified…
One of the major promises of quantum computing is the realization of SIMD (single instruction - multiple data) operations using the phenomenon of superposition. Since the dimension of the state space grows exponentially with the number of…
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…
We consider series expansions in bases of classical orthogonal polynomials. When such a series solves a linear differential equation with polynomial coefficients, its coefficients satisfy a linear recurrence equation. We interpret this…
Fast Fourier transform algorithms are an arsenal of effective tools for solving various problems of analysis and high-speed processing of signals of various natures. Almost all of these algorithms are designed to process sequences of…
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…
We calculate the Fourier transform of a spherically symmetric exponential function. Our evaluation is much simpler than the known one. We use the polar coordinates and reduce the Fourier transform to the integral of a rational function of…
We prove an exponential integral estimate for the quadratic partial sums of multiple Fourier series on large sets that implies some new properties of Fourier series.
We present a super-high-efficiency approximate computing scheme for series sum and discrete Fourier transform. The summation of a series sum or a discrete Fourier transform is approximated by summing over part of the terms multiplied by…
We show that a classical algorithm efficiently simulating the modular exponentiation circuit, for certain product state input and with measurements in a general product state basis at the output, can efficiently simulate Shor's factoring…
For a real sequence of length of m = nl, we may deduce its congruence derivative sequence with length of l. The discrete Fourier transform of original sequence can be calculated by the discrete Fourier transform of the congruence derivative…
In the present article, the author uses Fourier theory of tempered distributions (generalized functions) in deriving a formula for Dirichlet-like integrals. The applied method is remarkably efficient and allows a solution in a few…
Fourier series multiscale method, a concise and efficient analytical approach for multiscale computation, will be developed out of this series of papers. In the third paper, the analytical analysis of multiscale phenomena inherent in the…
We present a general diagrammatic approach to the construction of efficient algorithms for computing a Fourier transform on a semisimple algebra. This extends previous work wherein we derive best estimates for the computation of a Fourier…
The quantum Fourier transform (QFT) brings efficiency in many respects, especially usage of resource, for most operations on quantum computers. In this study, the existing QFT-based and non-QFT-based quantum arithmetic operations are…
We present a new tool to compute the number $\phi_\A (\b)$ of integer solutions to the linear system $$ \x \geq 0 \qquad \A \x = \b $$ where the coefficients of $\A$ and $\b$ are integral. $\phi_\A (\b)$ is often described as a \emph{vector…