Jump to content

Sine and cosine transforms

From Wikipedia, the free encyclopedia
This is an old revision of this page, as edited by Silly rabbit (talk | contribs) at 11:25, 11 September 2024 (Fourier inversion: another reference). The present address (URL) is a permanent link to this revision, which may differ significantly from the current revision.

In mathematics, the Fourier sine and cosine transforms are integral equations that decompose arbitrary functions into a sum of sine waves representing the odd component of the function plus cosine waves representing the even component of the function. The modern Fourier transform concisely contains both the sine and cosine transforms. Since the sine and cosine transforms use sine and cosine waves instead of complex exponentials and don't require complex numbers or negative frequency, they more closely correspond to Joseph Fourier's original transform equations and are still preferred in some signal processing and statistics applications and may be better suited as an introduction to Fourier analysis.

Definition

The Fourier sine transform of f(t), sometimes denoted by either or , is

If t means time, then ξ is frequency in cycles per unit time, but in the abstract, they can be any pair of variables which are dual to each other.

This transform is necessarily an odd function of frequency, i.e. for all ξ:

The numerical factors in the Fourier transforms are defined uniquely only by their product. Here, in order that the Fourier inversion formula not have any numerical factor, the factor of 2 appears because the sine function has L2 norm of

The Fourier cosine transform of f(t), sometimes denoted by either or , is

It is necessarily an even function of frequency, i.e. for all ξ: Since positive frequencies can fully express the transform, the non-trivial concept of negative frequency needed in the regular Fourier transform can be avoided.

Simplification to avoid negative t

Some authors[1] only define the cosine transform for even functions , in which case its sine transform is zero. Since cosine is also even and the integral of an even function from to is twice its integral from to , then the cosine transform of an even function can be written as:

Similarly, if is an odd function, then its cosine transform is zero. Because the product of two odd functions is an even function, the product is even and its integral similarly simplifies. Thus, the sine transform of an odd function can be written as: In the unique decomposition of functions into an even and odd function cosines represent the even component and sines represent the odd component of the function.

Other conventions

Just like the Fourier transform takes the form of different equations with different constant factors (see Fourier transform § Other conventions), other authors also define the cosine transform as[2] and the sine transform as Another convention defines the cosine transform as[3] and the sine transform as using as the transformation variable. And while t is typically used to represent the time domain, x is often used alternatively, particularly when representing frequencies in a spatial domain.

Fourier inversion

The original function f can be recovered from its transform under the usual hypotheses, that f and both of its transforms should be absolutely integrable. For more details on the different hypotheses, see Fourier inversion theorem.

The inversion formula is[4]

If the original function f is an even function, then the sine transform is zero; if f is an odd function, then the cosine transform is zero. In either case, the inversion formula simplifies.

Using the addition formula for cosine, the formula can also be rewritten as Fourier's integral formula:[5][6]

Relation with complex exponentials

The complex exponential form of the Fourier transform used more often today is[7] where is the square root of negative one. By applying Euler's formula it can be shown that the Fourier transform's real component is the cosine transform (representing the even component of the original function) and the Fourier transform's imaginary component is the negative of the sine transform (representing the odd component of the original function):

An advantage of the modern Fourier transform is that while the sine and cosine transforms together are required to extract the phase information of a frequency, the modern Fourier transform instead compactly packs both phase and amplitude information inside its complex valued result. Adding a sine wave and a cosine wave of the same frequency results a phase-shifted sine wave of that same frequency but whose amplitude and phase depends on the amplitudes of the sine and cosine wave. But a disadvantage is its requirement on understanding complex numbers, complex exponentials, and negative frequency.

The sine and cosine transforms meanwhile has the advantage that all quantities are real. They may also be convenient when the original function is already even or odd, in which case only the cosine or the sine transform respectively is needed, or if the function is already or easily decomposed into odd and even components.

Numerical evaluation

Using standard methods of numerical evaluation for Fourier integrals, such as Gaussian or tanh-sinh quadrature, is likely to lead to completely incorrect results, as the quadrature sum is (for most integrands of interest) highly ill-conditioned. Special numerical methods which exploit the structure of the oscillation are required, an example of which is Ooura's method for Fourier integrals[8] This method attempts to evaluate the integrand at locations which asymptotically approach the zeros of the oscillation (either the sine or cosine), quickly reducing the magnitude of positive and negative terms which are summed.

See also

References

  • Whittaker, Edmund, and James Watson, A Course in Modern Analysis, Fourth Edition, Cambridge Univ. Press, 1927, pp. 189, 211
  1. ^ Mary L. Boas, Mathematical Methods in the Physical Sciences, 2nd Ed, John Wiley & Sons Inc, 1983. ISBN 0-471-04409-1
  2. ^ Nyack, Cuthbert (1996). "Fourier Transform, Cosine and Sine Transforms". cnyack.homestead.com. Archived from the original on 2023-06-07. Retrieved 2018-10-08.
  3. ^ Coleman, Matthew P. (2013). An Introduction to Partial Differential Equations with MATLAB (Second ed.). Boca Raton. p. 221. ISBN 978-1-4398-9846-8. OCLC 822959644.{{cite book}}: CS1 maint: location missing publisher (link)
  4. ^ Poincaré, Henri (1895). Theorie analytique de la propagation de chaleur. Paris: G. Carré. pp. 108ff.
  5. ^ Edwin Titchmarsh (1948), Introduction to the theory of the Fourier integral, Oxford at the Clarendon Press, p. 1
  6. ^ Whittaker, Edmund Taylor; Watson, George Neville (1927-01-02). A Course Of Modern Analysis: An Introduction to the General Theory of Infinite Processes and of Analytic Functions; with an Account of the Principal Transcendental Functions (4th ed.). Cambridge, UK: Cambridge University Press. p. 189. ISBN 0-521-06794-4. ISBN 978-0-521-06794-2. {{cite book}}: ISBN / Date incompatibility (help)
  7. ^ Valentinuzzi, Max E. (2016-01-25). "Highlights in the History of the Fourier Transform". IEEE Pulse. Archived from the original on 2024-05-15. Retrieved 2024-09-09.
  8. ^ Takuya Ooura, Masatake Mori, A robust double exponential formula for Fourier-type integrals, Journal of computational and applied mathematics 112.1-2 (1999): 229-241.