Least-sqaures approximation Flashcards

(42 cards)

1
Q

What is the main question in this chapter?

A

How do we find approximate solutions to overdetermined systems?

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
2
Q

What is an overdetermined system?

A

If A is an m x n rectangular matrix with m > n, then the linear system a Ax = b is overdetermined and will usually have no solutions.

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
3
Q

Define the inner product.

A
How well did you know this?
1
Not at all
2
3
4
5
Perfectly
4
Q

What norm is the inner product related to? And why?

A
How well did you know this?
1
Not at all
2
3
4
5
Perfectly
5
Q

What is the angle θ between x and y given by?

A
How well did you know this?
1
Not at all
2
3
4
5
Perfectly
6
Q

Define orthogonal.

A
How well did you know this?
1
Not at all
2
3
4
5
Perfectly
7
Q

When is the set S = {x1, x2, …. , xn} orthogonal?

A
How well did you know this?
1
Not at all
2
3
4
5
Perfectly
8
Q

What is the theorem about an orthogonal set being a basis?

A
How well did you know this?
1
Not at all
2
3
4
5
Perfectly
9
Q

Prove the following theorem.

A
How well did you know this?
1
Not at all
2
3
4
5
Perfectly
10
Q

Define an orthonormal set.

A
How well did you know this?
1
Not at all
2
3
4
5
Perfectly
11
Q

Given an orthogonal set S, how can you construct an orthonomal set S’?

A
How well did you know this?
1
Not at all
2
3
4
5
Perfectly
12
Q

What is the theorem about the columns of a matrix Q being an orthonormal set?

A
How well did you know this?
1
Not at all
2
3
4
5
Perfectly
13
Q

Prove the following theorem.

A
How well did you know this?
1
Not at all
2
3
4
5
Perfectly
14
Q

Inner products are preserved under multiplication of what?

A

Orthogonal matrices

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
15
Q

Show that inner products are preserved under multiplication by orthogonal matrices.

A
How well did you know this?
1
Not at all
2
3
4
5
Perfectly
16
Q

What is the discrete least squares problem?

A

Find x that minimizes the l2 norm of the residual ||Ax - b||2

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
17
Q

What is the range(A)?

A

The set of all possible bectors Ax ∈ ℝm, where x ∈ ℝn.

18
Q

Why is the range(A) only a subspace of ℝm?

A

Because Ax is a linear combination of columns of A and there are only n < m of them, and in particular it will not, in general, contain b.

19
Q

In discrete least squares what are we looking to minimise?

20
Q

How do you minimise ||r||2?

A

By choosing r orthogonal to Ax

21
Q

When minimising ||r||2 what equation is satisfied?

22
Q

What is the following equation called?

A

The normal equation

23
Q

Prove the following equation is satisfied when minimsing ||r||2.

24
Q

What is the theorem about if a matrix ATA is invertible?

25
Prove the following theorem.
26
What is the QR decomposition theorem?
27
What is the fastest way to compute Q and R?
Gram-Schmidt orthogonalization.
28
What is the algorithm for Gram-Schmidt
29
How can you construct QR decomposition of A?
Apply Gram-Schmidt to the set of columns of A, this produces a set of orthogonal vectors **q**i. Then you write A in the following form.
30
How does QR decomposition help in least squares?
31
What is the continuous least squares problem?
It is to find a polynomial pn ∈ PN that minimises ||pn - f||, in a given inner product.
32
Define an inner product.
33
What does w(x) stand for in the following?
The weight function
34
What is the purpose of the weight function?
To assign varying degrees of importance to errors on different portions of the interval
35
Define the norm ||f|| using the following inner product.
36
What is the continuous least squares theorem?
37
Prove the following theorem.
38
Define a **family of orthogonal polynomials.**
39
What are the three options for normalising a family or orthogonal polynomials?
40
What is the three-term recurrence theorem?
41
Prove the following theorem.
42