Documentos de Académico
Documentos de Profesional
Documentos de Cultura
Dado
(T(z))(n)= z(n+1) 2z(n) +z(n-1)
A)
n=0
T(0 )(0) = 0 (0+1) -2 0 (0)+ 0 (0-1)
d
T(0 )(0) = 0 (1) -2 0 (0)+ 0 (-1)
T(0 )(0) = 0 (1) -2 0 (0)+ 0 (3)
T(0 )(0) = 0 (2*1)+ 0 = -2
n=1
T(0 )(1) = 0 (1+1) -2 0 (1)+ 0 (1-1)
T(0 )(1) = 0 (2) -2 0 (1)+ 0 (0)
n=2
T(0 )(2) = 0 (2+1) -2 0 (2)+ 0 (2-1)
T(0 )(2) = 0 (3) -2 0 (2)+ 0 (1)
T(0 )(2) = 0- (2*0)+ 0 = 0
n=3
T(0 )(3) = 0 (3+1) -2 0 (3)+ 0 (3-1)
T(0 )(3) = 0 (4) -2 0 (3)+ 0 (2)
T(0 )(3) = 0 (0) -2 0 (3)+ 0 (2)
T(0 )(3) = 1 (2*0)+ 0 = 1
2
T(0 )= [ 1 ]
0
1
Pero como , es una matriz circulante entonces
2 1
0 1
1
2
1 0]
=[
1 2 1
0
1
0 1 2
C) Encuentre b
Debibo al lema 2.3.9 se sabe que b(n) = ,0
1,0
(0)
2
2,0
(1)
= [
=[ 1 ]
]=
3,0
0
(2)
1
(3)
[4,0 ]
Ahora comprobando a b se tiene que:
b*z(m)= 3=0 ( ) ()= b(m)z(0) + b(m-1)z(1) + b(m-2)z(2) + b(m-3)z(3)
para m = 0
para m = 1
para m = 3
b(3)z(0) + b(3-1)z(1) + b(3-2)z(2) + b(3-3)z(3)
b(3)z(0) + b(2)z(1) + b(1)z(2) + b(0)z(3)
1z(0) + 0 + 1z(2)- 2z(3)
2(0) + (1) + (3)
(0) 2(1) + (2)
(1) 2(2) + (3)
[ (0) + (2) 2(3) ]
Y para comprobar que b cumple lo anterior entonces
para m = 3
b(3)0 (0) + b(3-1)0 (1) + b(3-2)0 (2) + b(3-3)0 (3)
b(3)0 (0) + b(2)0 (1) + b(1)0 (2) + b(0)0 (3)
b(3)0 (0) + b(2)0 (1) + b(1)0 (2) + b(0)0 (3)
10 (0) +00 (1) + 10 (2) - 20 (3)
1
2
T() = = [ 1 ]
0
1
D) Hallar m
Dado que m = () entonces
1
[1
1
1
(0)
1
1 1
2
1 1
1 1
(1)
1 ]*[
1
] =[
][ 1 ]=
1 1 1
(2)
1 1 1 1
0
1
1 (3)
1 1
0
2
[ ] Eingenvalores
4
2
0 0
0 0
0
2
0 0]
D= [
0 0 4 0
0 0 0 2
F) Mediante el calculo directo comprobar que D=4 , 41
1
4
D=4 , 41 = 4 ,
4
4 ,
1
= [1
1
1
1
4
4 , 4
0
[0
0
0
1
2 1
0
0
0 1
1 1
1 ]*[ 1 2 1 0 ]= [2 2
1 1 1
1 2 1
4
0
4
1
1
0 1 2
2 2
0
0
2
2
=[
4
4
2 2
0
0 0
8
0 0 ]*1=
0 16 0 4
0
0 8
0
[0
0
0
0 0
2 2 ]
4 4
2 2
1 1
0 0
0 0
0 0
1 1
2 2 ]*[1 1 ]=[0 8
0 0 ]
4 4 1 1 1 1
0 0 16 0
2 2
1 1
0 0
0 8
0
0 0
2 0 0 ] = D
0 4 0
0 0 2
La expresin 4 , 41 satisface D.
,
2 (4 )
2 (4 )
E
2 (4 )
F
2 (4 )
F
Donde = 41 Y 1 = 4
1+
=[ 1
1 + 2
1
4
3 2
2+ 0 ]
1
1 3 2
1
1+
5 + 3
1 1
1 ]*[ 2 ]= [ 2 2 ]
3
1 1 1
3 + 5
1 2
2
1
[1
1
1
1
1
3
1 1
1 ]*[ ]= [2 ]
2+
3 + 2
1 1 1
0
1
[1
1
1
1 1
1 ]*[1 ]= [ 1 ]
2 + 3
1
1 1 1
1 + 2
1
[1
1
1
1
6+
1 + 2
1 1
1 ]*[ 4 ]= [ 2 + ]
1 3
2 3
1 1 1
2
2 + 9
Luego se rescribe la matriz de filas a las cuales se les aplico transformacin de Fourier as:
5 + 3
[ 3
6+
2 2
2 2
1
2 +
3 + 5 2
3 + 2 ]
2 + 3 1 + 2
2 3 2 + 9
Seguido se vuelve a Usar 4 para calcular la transformada de Fourier a las columnas as:
1
[1
1
1
1
14 + 3
5 + 3
1 1
1 ]*[ 3 ]= [ 4 + 7 ]
4 +
1 1 1
6
+
6+
1
[1
1
1
1
2 2
1 3
1 1
1 ]*[2 2 ]= [2 2 ]
1
7
1 1 1
2
+
4
2
1
[1
1
1
1
4 + 7
3 + 5
1 1
1 ]*[ 3 + 2 ]= [ 4 3 ]
6 + 9
1 1 1
2 + 3
6 + 7
1 2 3
1
[1
1
1
1
2
1 + 10
1 1
1 ]*[ ]= [ 13 ]
1 + 2
3 6
1 1 1
7 4
1 2 + 9
Finalmente se rescribe los vectores columna como una matriz a la cual se le va a llamar
14 + 3
= [ 4 + 7
4 +
6+
1 3
2 2
7
4 2
4 + 7 1 + 10
4 3 13 ]
6 + 9 3 6
6 + 7 7 4
1
= [ ]
1
para m = 1
(i)(1)+(1)(-i)+(-i)(-1)+(-1)(i) = 0
para m = 2
z(2)w(0) + z(2-1)w(1) + z(2-2)w(2) + z(2-3)w(3)
z(2)w(0) + z(1)w(1) + z(0)w(2) + z(-1)w(3)
z(2)w(0) + z(1)w(1) + z(0)w(2) + z(3)w(3)
(-1)(1)+(i)(-i)+(1)(-1)+(-i)(i) = 0
para m = 3
z(3)w(0) + z(3-1)w(1) + z(3-2)w(2) + z(3-3)w(3)
z(3)w(0) + z(2)w(1) + z(1)w(2) + z(0)w(3)
(-i)(1)+(-1)(-i)+(i)(-1)+(1)(i) = 0
Entonces ordenando se tiene que
0= (0,0,0,0)
1
,
1 2
1 1
= (1 )1 = (1 )
1 =0
1 =0
2 1
2 1
1 1
1 2
1
1
=
(2 )2 =
(2 )
2 =0
2 =0
1 1
2 2
1 2
2
2
2 1
, = (1 )1
(2 )2
1 =0
2 =0
1 1
1 =0
2 =0
1 1
2 1
1 =0
2 =0
1 1
1 2
1 22 2
1
, = (1 )
(2 ) 2
1
2
1 21 1
1 22 2
, = (1 ) 1
(2 ) 2
1
2
1 1 2 1
, = (1 )
1 =0 2 =0
1 1
1 2
1 22 2
(2 ) 2
1
2
1 1 2 1
21 1
22 2
1
, =
(1 ) 1
(2 ) 2
1 2
1 =0 2 =0
1 1 2 1
21 1 22 2
1
, =
(1 )
(2 ) 1 2
1 2
1 =0 2 =0
1 1 2 1
21 1 22 2
1
, =
(1 )
(2 ) 1 2
1 2
1 =0 2 =0
1 1 2 1
2(1 1 1 1 )
1
1
, =
(1 )
(1 )
1 2
1 =0 2 =0
1
, =
(1 )
(1 )
1 2
1 =0
, =
Queda demostrada la frmula de Parseval
1
,
1 2