Homogeneous least squares

Join the discussion
Ask a follow-up here, or get your own question answered by working scientists, mathematicians and engineers — people, not an autocomplete.
Real named experts · corrections over time · the nuance an AI answer skips
1 reply · 4K views
azay
Messages
18
Reaction score
0
Given a homogeneous linear least squares problem:
[tex] A^{T}y=0[/tex]

What is the difference between minimizing
[tex] y^{T}AA^{T}y[/tex] (the least square error)

and:

[tex] y^{T}AA^{+}y=y^{T}A(A^{T}A)^{-1}A^{T}y[/tex]

?

Thanks.
 
Physics news on Phys.org
azay said:
Given a homogeneous linear least squares problem:
[tex] A^{T}y=0[/tex]

What is the difference between minimizing
[tex] y^{T}AA^{T}y[/tex] (the least square error)

and:

[tex] y^{T}AA^{+}y=y^{T}A(A^{T}A)^{-1}A^{T}y[/tex]

?

Thanks.

Hey azay and welcome to the forums.

The difference has to do with how X is decomposed. The pseudo-inverse has the 'properties' that you would expect for an inverse but it's not the same.

According to this:

http://en.wikipedia.org/wiki/Linear_least_squares_(mathematics)#Computation

The first uses a QR decomposition, and the second uses properties related to the pseudo-inverse from a Singular Value Decomposition (SVD).

I am not exactly sure of the deep details myself, but I'm sure you can use the above link to answer more specific questions.