共查询到20条相似文献,搜索用时 15 毫秒
1.
《Applied mathematics and computation》2001,117(2-3):151-159
2.
Joseph L. Gerver 《Transactions of the American Mathematical Society》2003,355(11):4297-4347
For , we analyze the behavior, near the rational points , of , considered as a function of . We expand this series into a constant term, a term on the order of , a term linear in , a ``chirp" term on the order of , and an error term on the order of . At every such rational point, the left and right derivatives are either both finite (and equal) or both infinite, in contrast with the quadratic series, where the derivative is often finite on one side and infinite on the other. However, in the cubic series, again in contrast with the quadratic case, the chirp term generally has a different set of frequencies and amplitudes on the right and left sides. Finally, we show that almost every irrational point can be closely approximated, in a suitable Diophantine sense, by rational points where the cubic series has an infinite derivative. This implies that when , both the real and imaginary parts of the cubic series are differentiable almost nowhere.
3.
A summability method for the arithmetic Fourier transform 总被引:1,自引:0,他引:1
W. J. Walker 《BIT Numerical Mathematics》1994,34(2):304-309
The Arithmetic Fourier Transform (AFT) is an algorithm for the computation of Fourier coefficients, which is suitable for parallel processing and in which there are no multiplications by complex exponentials. This is accomplished by the use of the Möbius function and Möbius inversion. However, the algorithm does require the evaluation of the function at an array of irregularly spaced points. In the case that the function has been sampled at regularly spaced points, interpolation is used at the intermediate points of the array. Generally theAFT is most effective when used to calculate the Fourier cosine coefficients of an even function.In this paper a summability method is used to derive a modification of theAFT algorithm. The proof of the modification is quite independent of theAFT itself and involves a summation by primes. One advantage of the new algorithm is that with a suitable sampling scheme low order Fourier coefficients may be calculated without interpolation. 相似文献
4.
E. S. Belinsky 《Proceedings of the American Mathematical Society》1997,125(12):3689-3693
The existence of the `rare' sequence of partial sums summable with the method of arithmetical means at each Lebesgue point is proved in the paper. The proof is based on the strategy of random choice.
5.
6.
7.
Proceedings - Mathematical Sciences - 相似文献
8.
T. I. Akhobadze 《Analysis Mathematica》1982,8(2):79-102
. , , –1<<0. .
The present work was written on the basis of two earlier works received byAnalysis Mathematica on January 16, 1979, and July 20, 1979. 相似文献
The present work was written on the basis of two earlier works received byAnalysis Mathematica on January 16, 1979, and July 20, 1979. 相似文献
9.
P. L. Sharma 《Annali di Matematica Pura ed Applicata》1961,56(1):159-175
Summary The author studies a problem relating Harmonic Summability of doubleFourier serie analogous to theGergen's criteria for convergence. 相似文献
10.
Shri Nivas Bhatt 《Annali di Matematica Pura ed Applicata》1966,72(1):253-265
Summary In this paper the author has considered the harmonic summability of the factored Fourier series when ϕα(t), α > 0, is of bounded
variation. 相似文献
11.
12.
13.
14.
《Mathematical Methods in the Applied Sciences》2018,41(2):664-670
Bor has recently obtained a main theorem dealing with absolute weighted mean summability of Fourier series. In this paper, we generalized that theorem for summability method. Also, some new and known results are obtained dealing with some basic summability methods. 相似文献
15.
L. Leindler 《Acta Mathematica Hungarica》1969,20(3-4):347-355
16.
17.
18.
G. Sunouchi 《Acta Mathematica Hungarica》1982,39(4):323-329
19.