• Ingen resultater fundet

Problem Set 2.

N/A
N/A
Info
Hent
Protected

Academic year: 2022

Del "Problem Set 2."

Copied!
1
0
0

Indlæser.... (se fuldtekst nu)

Hele teksten

(1)

PhD Course Fourier Analysis

Problem Set 2.

This is the second problem set for the course, to be handed in no later than March 11, 2005.

Consider the following two functions f(t) =

(t+π for t∈[−π,0],

π−t for t∈(0, π), (1)

g(t) =

(t+π for t∈[−π,0],

t−π for t∈(0, π). (2)

The two functions are extended to all of Ras 2π-periodic functions. Explain that the extension of f is continuous, while the extension of g has jump discontinuities at all points t= 2πk, k∈ Z.

The Fourier series are given by f(t)∼ π

2 +

X

n=1

4

π(2n−1)2 cos((2n−1)t) and

g(t)∼

X

n=1

−2

n sin(nt).

Using these results, discuss convergence rates using numerical experi- ments, either in Matlab, or in Maple.

How many terms are needed in the partial sumsfN of f to get

|f(0)−sfN(0)|<0.01?

Will the Cesaro mean with the same number of terms give a better result?

For the function g we try to approximate the value g(1/√

2). Thus find the number of terms needed to get

|g(1/√

2)−sgN(1/√

2)|<0.01,

where sgN denotes the partial sum for g. What about the Cesaro mean in this case?

Arne Jensen February 16, 2005

1

Referencer

RELATEREDE DOKUMENTER

It is possible to define correlation functions and associated spectra for aperiodic, periodic and random signals although the interpretation is different... Otherwise, the

Specifically we show that a spectral set possessing a spectrum that is a strongly periodic set must tile R by translates of a strongly periodic set depending only on the spectrum,

The problem of bisimilarity checking between a pair of ping-pong protocol configurations of width 2 is decidable for local knowledge functions..

We have extended our type- directed partial evaluator with typed primitive operations (δ-rules), whose default policy is to proceed if all the operands are static and to residualize

Suppose that we consider just the problem of specifying functions without the restriction that the definitions be executable.. A first step towards this might be to use

A column for the access network must contain information on which nodes are in the access network and which of them is a hub. A column for the backbone network

Delivery methods All of the following methods are appropriate to support the delivery process when set out in schemes of work and lesson plans and should be set out by the

The squared Pearson’s correlation coefficient ( r 2 ) as a function of MFCC number for the 4 MFCC implementations, using different sampling rate and bit rate.. for all