Scribd Logo
Upload

Welcome to Scribd!

  • 20 views

    Math 201C HW3: Patrick Tam May 19, 2013

    Uploaded by

    Patrick Tam
    This document contains worked solutions to homework problems in a math class. It begins by defining the Fourier transform of a function f and uses this to write the Fourier transform of a function restricted to a finite interval. It then shows that this restricted function can be written as the convolution of f with another function. Next, it computes the Fourier transforms of specific Gaussian functions f and g and uses this to write the Fourier transform of the convolution of f and g. It concludes by taking the inverse Fourier transform to express the convolution of f and g in terms of Gaussian functions.

    Copyright:

    Attribution Non-Commercial (BY-NC)
    Download as PDF, TXT or read online from Scribd
    Flag for inappropriate content

    You might also like

    Math 201C HW3: Patrick Tam May 19, 2013

    Uploaded by

    Patrick Tam
    20 views2 pages
    This document contains worked solutions to homework problems in a math class. It begins by defining the Fourier transform of a function f and uses this to write the Fourier transform of a function restricted to a finite interval. It then shows that this restricted function can be written as the convolution of f with another function. Next, it computes the Fourier transforms of specific Gaussian functions f and g and uses this to write the Fourier transform of the convolution of f and g. It concludes by taking the inverse Fourier transform to express the convolution of f and g in terms of Gaussian functions.

    Original Description:

    Original Title

    Math 201C Hw3draft3

    Copyright

    © Attribution Non-Commercial (BY-NC)

    Available Formats

    PDF, TXT or read online from Scribd

    Did you find this document useful?

    Is this content inappropriate?

    Report this Document
    This document contains worked solutions to homework problems in a math class. It begins by defining the Fourier transform of a function f and uses this to write the Fourier transform of a function restricted to a finite interval. It then shows that this restricted function can be written as the convolution of f with another function. Next, it computes the Fourier transforms of specific Gaussian functions f and g and uses this to write the Fourier transform of the convolution of f and g. It concludes by taking the inverse Fourier transform to express the convolution of f and g in terms of Gaussian functions.

    Copyright:

    Attribution Non-Commercial (BY-NC)
    Download as PDF, TXT or read online from Scribd
    Flag for inappropriate content
    Download as pdf or txt
    20 views2 pages

    Math 201C HW3: Patrick Tam May 19, 2013

    Uploaded by

    Patrick Tam
    This document contains worked solutions to homework problems in a math class. It begins by defining the Fourier transform of a function f and uses this to write the Fourier transform of a function restricted to a finite interval. It then shows that this restricted function can be written as the convolution of f with another function. Next, it computes the Fourier transforms of specific Gaussian functions f and g and uses this to write the Fourier transform of the convolution of f and g. It concludes by taking the inverse Fourier transform to express the convolution of f and g in terms of Gaussian functions.

    Copyright:

    Attribution Non-Commercial (BY-NC)
    Download as PDF, TXT or read online from Scribd
    Flag for inappropriate content
    Download as pdf or txt
    of 2

    Math 201C HW3

    Patrick Tam
    May 19, 2013

    3.6) (a) Recall that the Fourier transform of

    f L1 (R)

    is given by

    Ff () = f() = (2)1/2

    f (y)eiy dy.
    R

    So we can write

    (2)1/2

    f (y)eiy dyeix d

    = (2)1

    f (y)eiy dyeix d = (2)1


    R

    f()eix d = (2)1/2

    SR f (x) = (2)1/2


    = (2)

    f (y)eix eiy dyd

    (R,R) ()
    R

    (R,R) ()f (y)ei(xy) dyd.


    R

    (R,R) () f (y) ei(xy) is in L1 (R2 ) as a function of the variables y and .


    have ||e
    ||L (R2 ) = 1 < . Additionally,


    ||(R,R) () f (y)||L1 (R2 ) =
    |(R,R) () f (y)|dyd =
    (R,R) () |f (y)|dyd

    We will now show that


    away, we

    Right

    i(xy)

    |f (y)|dyd =

    (R,R) ()
    R

    ||f ||L1 (R) d = 2R||f ||L1 (R) < .


    R

    By Hlder's inequality, we have

    ||(R,R) () f (y) ei(xy) ||L1 (R2 ) ||(R,R) () f (y)||L1 (R2 ) ||ei(xy) ||L (R2 ) < .
    (R,R) () f (y) ei(xy) L1 (R2 ) and we can apply Fubini's theorem to switch the order of
    and write SR f (x) as


    (2)1
    (R,R) ()f (y)ei(xy) ddy = (2)1
    (R,R) ()ei(xy) df (y)dy
    So

    (2)1

    ei(xy) df (y)dy =
    R

    integration

    KR (x y)f (y)dy = KR f (x).

    3.11) By direct computation, we have

    Ff () = f() = (2)n/2

    f (y)eiy dy = (2)n/2

    Rn
    n/2

    = (2)

    ps () = (2)

    es|y| eiy dy = (2)n/2


    Rn

    n/2

    ||2
    1
    4s
    e
    =

    (4s)n/2

    es|y|

    +iy()

    Rn

    2
    4s

    n/2
    e

    ||2
    4s

    
    =

    1
    2s

    n/2

    ||2
    4s

    dy

    Similarly,

    n/2

    Fg() = g() = (2)

    g(y)e

    iy

    n/2

    dy = (2)

    Rn
    n/2

    = (2)

    t|y|2 iy

    n/2

    n/2

    pt () = (2)

    ||2
    1
    e 4t =

    n/2
    (4t)

    2
    4t

    n/2
    e

    ||2
    4t

    
    =

    1
    2t

    n/2

    F(f g)() = (2)n/2 Ff ()Fg().


    F

    on both sides to get

    
    
    (f g)(x) = F F(f g)(x) = F (2)n/2 Ff ()Fg() (x)
    
    
    = F (2)n/2 Ff ()Fg() (x)
    !
    !#
    "
     n/2
     n/2
    ||2
    ||2
    1
    1
    4s
    4t

    n/2
    e

    e
    (x)

    = F (2)
    2s
    2t
    
    
    n/2 ||2 ||2

    4s
    4t
    =F
    e
    (x)
    2st
    !
    n/2
    

    ||2
    ||2
    2
    n/2
    4s 4t
    = (2)
    e
    eix d
    4st
    Rn
    = (2)n/2
    
    =

    1
    4st

    2
    4st

    n/2

    e( 4s + 4t )||
    1

    eix d

    Rn

    n/2

    e( 4s + 4t )||
    1

    +ix

    Rn

    n/2
    
    n/2
    1
    1
    1 (x) =
    1 (x)
    1
    1
    (2)n p 4s
    (4 2 )n/2 p 4s
    + 4t
    + 4t
    4st
    4st
     2 n/2
     2 n/2
    |x|2

    1
    4( 1 + 1 )
    4s
    4t
    1 (x) =
    1
    =
    p 4s
    n/2 e
    + 4t
    st
    st
    4 1 + 1
    

    4s

    
    =

    2
    st

    n/2

    1
    s

    1
    t

    n/2
    
    =

    |x|2

    n/2

    4t

    
    1
    st s + 1t

    1
    1
    e (s+t) =

    (t + s)

    +iy()

    Rn

    By formula 3.4,

    Apply the inverse Fourier transform

    et|y|

    dy = (2)

    Rn

    |x|2

    1
    1
    e (s+t)

    !n/2

    |x|2

    1
    1
    e (s+t)

    ||2
    4t

    dy

    You might also like