Math Is Fun Forum

  Discussion about math, puzzles, games and fun.   Useful symbols: ÷ × ½ √ ∞ ≠ ≤ ≥ ≈ ⇒ ± ∈ Δ θ ∴ ∑ ∫ • π ƒ -¹ ² ³ °

You are not logged in.

#26 Re: Euler Avenue » Discrete Fourier Transform » 2009-04-24 15:13:13

I found this wikipedia page http://en.wikipedia.org/wiki/Discrete_Fourier_transform that gives a really good and correct definitions and properties of the DFT. It also gives the eigenvalues but doesn't tell exactly how to find them. This is a quote from the page:

Consider the unitary form

defined above for the DFT of length
, where
. This matrix satisfies the equation:

This can be seen from the inverse properties above: operating
twice gives the original data in reverse order, so operating
four times gives back the original data and is thus the identity matrix. This means that the eigenvalues
satisfy a characteristic equation:

Therefore, the eigenvalues of
are the four roots of unity:
is +1, -1, +i, -i

What is not clear form me is why is the characteristic equation

. How can I derive this algebraically? Also, how do I calculate the multiplicity of these eigenvalues? The calculation of the multiplicities is given in this paper "J. H. McClellan and T. W. Parks (1972). "Eigenvalues and eigenvectors of the discrete Fourier transformation". IEEE Trans. Audio Electroacoust. 20 (1): 66–74" (http://ieeexplore.ieee.org/search/wrapper.jsp?arnumber=1162342), but my university doesn't have access to this paper, so I haven't read this yet.

In summary my questions are as follows:
1) How to derive algebraically the characteristic equation


2) How to calculate the multiplicity of the eigenvalues
3) What is a good alternate reference for this paper

Thanks in advanced!!!  wave

#27 Euler Avenue » Discrete Fourier Transform » 2009-04-23 23:55:17

dannyv
Replies: 3

Can somebody tell me what is the process to calculate the eigenvalues of the discrete fourier transform matrix? Or a reference would be good also. thanks!!wave

#28 Re: Help Me ! » About Convex Sets » 2007-09-20 08:51:58

JaneFairfax wrote:

The way to complete the proof is as follows.

Adding [1] and [2] should give you what you are looking for.

Thanks:D

#29 Re: Help Me ! » About Convex Sets » 2007-09-20 08:49:23

You are right!!

And what about this one:



Thanks a lot!! big_smile

#30 Re: Help Me ! » Groups and neighbourhood » 2007-09-20 05:20:32

Group is simply a touple <A,*> where A is any set, and * is a binary operator with the following properties:
1) Asociative: for any a,b,c in A you have that (a*b)*c)=a*(b*c)
2) Neutral element: there is an element u in A where for any a in A you have that u*a=a
3) Opposite: for any element a in A there is another element called b such that b=-a

About the neighborhood I am not sure to what kind of neighbourhood you are referring to. For example in mathematical programming, a neighbourhood is simply a set of candidate solutions related to another candidate solution by means of a function called neighbourhood structure; this way defining the topology of the candidate solutions space, given an objective function.

#33 Re: Help Me ! » About Convex Sets » 2007-09-20 03:00:38

A convex set is a set X included in a vector space E where [a,b]={(1-t)a+tb : 0<=t<=1} and a,b in X implies [a,b] in X

#34 Coder's Corner » Divide and Conquer Algorithms » 2007-09-20 02:50:28

dannyv
Replies: 2

Does anyone read the book "Algorithms" by Papadimitriou et al.? I found it to be an excellent book, just sometime need a little bit of explanation in some parts of it. For example, in chapter 2 about divide and conquer algorithms it presents a master theorem about the time complexity for this kind of algoritms. It saids something like this:

"If T(n)=aT(n/b)+O(n^d) for some constants a>0, b>1 and d>=0 then

T(n)= O(n^d)               if d>log_b(a)
T(n)= O(n^d log n)       if d=log_b(a)
T(n)= O(n^{log_b(a)}) if d<log_b(a)

Where n is the size of the input, a is the branching factor and b is how much we partition the input in each recursion step."

Can anyone tell me what is the parameter d?

Thanks

#35 Help Me ! » About Convex Sets » 2007-09-20 02:37:42

dannyv
Replies: 8

Hi, I'm new to this forum and I found it very interesting. So, as a first post I present this problem.

"Prove that the set X={(x,y) : ax+by <= c} is convex for any given a, b, and c."

How can I do that using only the axioms of vector spaces?

Thanks

Board footer

Powered by FluxBB