# FourierDST

FourierDST[list]

finds the Fourier discrete sine transform of a list of real numbers.

FourierDST[list,m]

finds the Fourier discrete sine transform of type .

# Details

• Possible types of discrete sine transform for a list of length giving a result are:
•  1 DST-I 2 DST-II 3 DST-III 4 DST-IV
• FourierDST[list] is equivalent to FourierDST[list,2].
• The inverse discrete sine transforms for types 1, 2, 3, 4 are types 1, 3, 2, 4, respectively.
• The list given in FourierDST[list] can be nested to represent an array of data in any number of dimensions.
• The array of data must be rectangular.
• If the elements of list are exact numbers, FourierDST begins by applying N to them.
• FourierDST can be used on SparseArray objects.

# Examples

open allclose all

## Basic Examples(2)

Find a discrete sine transform:

 In[1]:=
 Out[1]=

Find the inverse discrete sine transform:

 In[2]:=
 Out[2]=

Find a discrete sine transform of type 1 (DST-I):

 In[1]:=
 Out[1]=

Find the inverse discrete sine transform:

 In[2]:=
 Out[2]=