How to calculate
α
^
α
^
?
We know that (
x−
α
^
v
x
α
^
v
) is perpendicular to every vector in span{v}, so
〈x−
α
^
v,βv〉=0 ,
∀β
β
∀
β
x
α
^
v
β
v
0
β*〈(x,v)〉−
α
^
β*〈(v,v)〉=0
β
x
v
α
^
β
v
v
0
because
〈v,v〉=1
v
v
1
, so
(〈(x,v)〉−
α
^
=0)⇒(
α
^
=〈x,v〉)
x
v
α
^
0
α
^
x
v
Closest vector in span{v} =
〈(x,v)〉v
x
v
v
, where
〈(x,v)〉v
x
v
v
is the projection of xx onto vv.
We can do the same thing in higher dimensions.
Let
V⊂H
V
H
be a subspace of a Hilbert space H. Let
x∈H
x
H
be given. Find the
y∈V
y
V
that best approximates
xx. i.e.,
∥x−y∥
x
y
is minimized.
-
Find an orthonormal basis
b1…bk
b1
…
bk
for
VV
-
Project xx
onto VV using
y=∑i=1k〈(x,bi)〉bi
y
i
1
k
x
bi
bi
then yy is the closest
point in V to x and (x-y) ⊥ V (
〈x−y,v〉=0 ,
∀v∈V
v
∀
v
V
x
y
v
0
x∈R3
x
3
,
V=span(
1
0
0
)(
0
1
0
)
V
span
1
0
0
0
1
0
,
x=(
a
b
c
)
x
a
b
c
. So,
y=∑i=12〈(x,bi)〉bi=a(
1
0
0
)+b(
0
1
0
)=(
a
b
0
)
y
i
1
2
x
bi
bi
a
1
0
0
b
0
1
0
a
b
0
V = {space of periodic signals with frequency no greater
than
3
w0
3
w0
}. Given periodic f(t), what is the signal in V that
best approximates f?
-
{
1Tej
w0
kt
1
T
w0
k
t
, k = -3, -2, ..., 2, 3} is an ONB for V
-
gt=1T∑k=-33〈(ft,ej
w0
kt)〉ej
w0
kt
g
t
1
T
k
-3
3
f
t
w0
k
t
w0
k
t
is the closest signal in V to f(t)
⇒ reconstruct f(t) using only 7 terms
of its Fourier
series.
Let V = {functions piecewise constant between the integers}
bi
={1 if i−1≤t<i0 otherwise
bi
1
i
1
t
i
0
where
{bibi}
is an ONB.
Best piecewise constant approximation?
gt=∑i=−∞∞〈(f,
bi
)〉
bi
g
t
i
f
bi
bi
〈f,
bi
〉=∫−∞∞ft
bi
tdt=∫i−1iftdt
f
bi
t
f
t
bi
t
t
i
1
i
f
t
This demonstration explores approximation using a Fourier
basis and a Haar Wavelet basis.See here for instructions on how to use
the demo.
LabVIEW Example:
(run) (source)
"My introduction to signal processing course at Rice University."