• Support PF! Buy your school textbooks, materials and every day products Here!

Convolution question

  • #1
246
0
I just realized that the convolution of any function with itself many times will ultimately give a gaussian. I was just wondering if there was a function that was an exception to this?
 

Answers and Replies

  • #2
HallsofIvy
Science Advisor
Homework Helper
41,808
933
I'm not sure I can make sense out of your question. Over what interval are you taking the convolution? What happens if f(x) is a constant or f(x)= x?

It is true that the convolution, over [itex]-\infty[/itex] to [itex]\infty[/itex], of two Gaussians is a Gaussian so this may be a "fixed point" theorem.
 
Last edited by a moderator:
  • #3
246
0
Well, because the fourier transform of a convolution is a product and because the Fourier transform of a Gaussian is a Gaussian, the convolution theorem means that rasing any well defined function to a high integer power gives something increasingly similar to a Gaussian. I was wondering if there was an actual counterexample to this
 
  • #4
StatusX
Homework Helper
2,564
1
rasing any well defined function to a high integer power gives something increasingly similar to a Gaussian.
What makes you think this? In raising a function to a very high power, the parts with |f(x)|>1 get increasingly larger while those with |f(x)|<1 vanish. So, for example, if the function has several narrow peaks whose height is greater than one, its very high powers will have spikes where each of those peaks were and vanish everywhere else.
 
  • #5
HallsofIvy
Science Advisor
Homework Helper
41,808
933
I don't think indigojoker meant "high power". I think he meant applying the convolution a large number of times.
 
  • #6
246
0
yep, that's what i mean
 
  • #7
StatusX
Homework Helper
2,564
1
Right, but then you noted that a convolution in, say, the time domain corresponds to a product in the frequency domain, so convolving a function with itself n times corresponds to raising its fourier transform to the nth power. This is correct, but it doesn't follow that you'll always end up with gaussian like functions.
 
  • #8
246
0
"This is correct, but it doesn't follow that you'll always end up with gaussian like functions."

so my original question was what types of functions will not end up with a gaussian?
 
  • #9
StatusX
Homework Helper
2,564
1
I don't see why anything that isn't a guassian should "approach" a gaussian. And this is impossible to tell anyway unless you say exactly what you mean by "approach", ie, how do you measure how similar two functions are?
 
  • #10
AlephZero
Science Advisor
Homework Helper
6,994
291
so my original question was what types of functions will not end up with a gaussian?
Think about what convolution means in the frequency domain, and it's clear that almost any function will not end up as a gaussian.
 

Related Threads on Convolution question

  • Last Post
Replies
0
Views
952
  • Last Post
Replies
7
Views
553
  • Last Post
Replies
2
Views
2K
  • Last Post
Replies
2
Views
910
  • Last Post
Replies
13
Views
2K
  • Last Post
Replies
0
Views
1K
Replies
1
Views
564
  • Last Post
Replies
14
Views
1K
  • Last Post
Replies
23
Views
2K
  • Last Post
Replies
1
Views
835
Top