×

A class of integral transforms related to the Fourier cosine convolution. (English) Zbl 1085.42003

Summary: “The class of integral transforms related to the Fourier cosine convolution is studied on \(L_{2}(R_{+})\). A Watson’s type theorem is proved. The concept of the symmetric Fourier cosine kernel with a characteristic polynomial \(r_n(x)= \Sigma^n_{m=0}a_mx^{2m}\) is defined. Plancherel’s theorem is formulated. The integral transforms with unsymmetric kernels are studied. Examples of certain kernels and transforms are given”.

MSC:

42A38 Fourier and Fourier-Stieltjes transforms and other transforms of Fourier type
44A05 General integral transforms
44A35 Convolution as an integral transform
Full Text: DOI

References:

[1] Titchmarsh E. C., Introduction to the Theory of Fourier Integral, 2. ed. (1967)
[2] Kakichev V. A., Izv. Acad. Nauk BSSR. Ser. Fiz.-Mat. Nauk 22 pp 48– (1967)
[3] Churchill R. V., Operational Mathematics, 3. ed. (1972)
[4] Knyazev P. N., Integral Transforms (1969)
[5] DOI: 10.1006/jmaa.1998.6177 · Zbl 0920.46035 · doi:10.1006/jmaa.1998.6177
[6] Kakichev V. A., Lectures on Polyconvolutions: Definitions, Examples, and Convolution Equations (1997)
[7] Thao N. X., Convolution for Integral Transforms and Their Applications (1997)
[8] DOI: 10.1155/S016117129500069X · Zbl 0828.33001 · doi:10.1155/S016117129500069X
[9] Yakubovich S. B., Prod. Inst. Math. Sci. Kyoto Univ. 12 pp 84– (1994)
[10] Prudnikov A. P., Integral and Series. 1: Elementary Functions (1986)
[11] Al-Musallam F., Fractional Calculas Application and Analysis 3 pp 303– (2000)
[12] Al-Musallam F., Result. Math. 38 pp 197– (2000) · Zbl 0970.44004 · doi:10.1007/BF03322007
This reference list is based on information provided by the publisher or from digital mathematics libraries. Its items are heuristically matched to zbMATH identifiers and may contain data conversion errors. In some cases that data have been complemented/enhanced by data from zbMATH Open. This attempts to reflect the references listed in the original paper as accurately as possible without claiming completeness or a perfect matching.