CosFourier: Difference between revisions

From Citizendium
Jump to navigation Jump to search
imported>Dmitrii Kouznetsov
imported>Dmitrii Kouznetsov
Line 31: Line 31:
However, there exist more efficient implementations.
However, there exist more efficient implementations.


For the numerical implementation of CosFourier, the choice of equidistant nodes is important. In particular, there exist the following [[DCF]], id est, the followin discrete analogies of the CosFourier are available:
For the numerical implementation of CosFourier, the choice of equidistant nodes is important. In particular, there exist the following [[DCT]], id est, the followin discrete analogies of the CosFourier are available:
[[DCFI]],
[[DCTI]],
[[DCFII]],
[[DCTII]],
[[DCFIII]],
[[DCtIII]],
[[Linear operator]]
 
==Keywords==
[[Linear operator]],
[[Fourier operator]],
[[DCT]],
[[DCTI]],
[[DCTII]],
[[DCTIII]],


==References==
==References==
This article is adopted from  http://tori.ils.uec.ac.jp/TORI/index.php/CosFourier
This article is adopted from  http://tori.ils.uec.ac.jp/TORI/index.php/CosFourier

Revision as of 04:20, 4 September 2012

CosFourier is linear operator acting on continuous functions defined at the non–negative values of the artument. Function is converted to function in such a way, that

Incerse operator

The CosFourier is self-inverse operator; its square is identity operator.

Eigenfunctions of CosFourier

Eigenfunctions of the Fourier Operator with eigenvalue unity are also eigenfunctions of the CosFourier. Such functions can be called Self-Fourier. Below are three examples of the self-Fourier functions:

These functions are good for testing of the numerical implementations of the FourierOperator.

Relation to the FourierOperator

The Fourier operator acts on a function in the following way:

For a continuous even function , the Fourier operator give the same result as CosFourier.

Numerical implementation

In principle, the CosFourier coud be implemented directly through the numerical implementation of the Discrete Fourier transform, extending the function to the negative values of the argument. However, there exist more efficient implementations.

For the numerical implementation of CosFourier, the choice of equidistant nodes is important. In particular, there exist the following DCT, id est, the followin discrete analogies of the CosFourier are available: DCTI, DCTII, DCtIII,

Keywords

Linear operator, Fourier operator, DCT, DCTI, DCTII, DCTIII,

References

This article is adopted from http://tori.ils.uec.ac.jp/TORI/index.php/CosFourier