Homogeneous least squares

azay
Messages
18
Reaction score
0
Given a homogeneous linear least squares problem:
<br /> A^{T}y=0<br />

What is the difference between minimizing
<br /> y^{T}AA^{T}y<br /> (the least square error)

and:

<br /> y^{T}AA^{+}y=y^{T}A(A^{T}A)^{-1}A^{T}y<br />

?

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

What is the difference between minimizing
<br /> y^{T}AA^{T}y<br /> (the least square error)

and:

<br /> y^{T}AA^{+}y=y^{T}A(A^{T}A)^{-1}A^{T}y<br />

?

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.
 
I asked online questions about Proposition 2.1.1: The answer I got is the following: I have some questions about the answer I got. When the person answering says: ##1.## Is the map ##\mathfrak{q}\mapsto \mathfrak{q} A _\mathfrak{p}## from ##A\setminus \mathfrak{p}\to A_\mathfrak{p}##? But I don't understand what the author meant for the rest of the sentence in mathematical notation: ##2.## In the next statement where the author says: How is ##A\to...
The following are taken from the two sources, 1) from this online page and the book An Introduction to Module Theory by: Ibrahim Assem, Flavio U. Coelho. In the Abelian Categories chapter in the module theory text on page 157, right after presenting IV.2.21 Definition, the authors states "Image and coimage may or may not exist, but if they do, then they are unique up to isomorphism (because so are kernels and cokernels). Also in the reference url page above, the authors present two...
When decomposing a representation ##\rho## of a finite group ##G## into irreducible representations, we can find the number of times the representation contains a particular irrep ##\rho_0## through the character inner product $$ \langle \chi, \chi_0\rangle = \frac{1}{|G|} \sum_{g\in G} \chi(g) \chi_0(g)^*$$ where ##\chi## and ##\chi_0## are the characters of ##\rho## and ##\rho_0##, respectively. Since all group elements in the same conjugacy class have the same characters, this may be...
Back
Top