Least square solution based on the pseudoinverse solved efficiently with singular value decomposition
$begingroup$
Hi apologies it's hard to type out the problem,
I have a lecture slide on neural networks. It says the fitting error gives the matrix:
N by M matrix of thi's multiplied by Mx1 weights minus Nx1 outputs (ys)
The Euclidean distance of this entire function is then found. Thi is a function, given at the bottom, w are the corresponding weights and y is the network output.
Following this the slide says "The above minimisation problem is usually solved using the least squares solution based on the pseudoinverse:
w = thi y thi has + above indicating pseudoinverse.
"This pseudoinverse is efficiently solved using the singular value decomposition (SVD) techniques".
thi+ = (limit (thi_transpose * thi + lambda * Identity_Matrix)^(-1)) * thi_transpose
The limit is as lamba tends to zero. Lambda is a user-defined regularisation parameter, whereby 0 = no smoothness and infinity gives unreliable results.
I've been reading for ages and still dont understand this last line at all. Please could someone go through an example, or how to solve this? (use what values of thi u want)
Extra information I don't know if it's useful:
Thi(x) = exp( - euc_dist(x-ci) / 2*gamma_squared)
x = network input, c = centre of neuron, gamma = width.
Summary
I need to use the least square solution based on the pseudoinverse of an NxM thi matrix multiplied by Nx1 weight matrix minus Nx1 output matrix to find the Nx1 weight matrix.
w = pseudo_inverse_thi * output vector
where pseudo_inverse_thi = limit equation above
The SVD is somehow used to accomplish this. If I make no sense, I apologise, I'm utterly lost.
linear-algebra matrices least-squares svd
edited Jul 16 '17 at 10:48
Rodrigo de Azevedo
13k41958
asked Apr 4 '13 at 23:17
ConfusedConfused
112
$endgroup$
add a comment |
$begingroup$
Hi apologies it's hard to type out the problem,
I have a lecture slide on neural networks. It says the fitting error gives the matrix:
N by M matrix of thi's multiplied by Mx1 weights minus Nx1 outputs (ys)
The Euclidean distance of this entire function is then found. Thi is a function, given at the bottom, w are the corresponding weights and y is the network output.
Following this the slide says "The above minimisation problem is usually solved using the least squares solution based on the pseudoinverse:
w = thi y thi has + above indicating pseudoinverse.
"This pseudoinverse is efficiently solved using the singular value decomposition (SVD) techniques".
thi+ = (limit (thi_transpose * thi + lambda * Identity_Matrix)^(-1)) * thi_transpose
The limit is as lamba tends to zero. Lambda is a user-defined regularisation parameter, whereby 0 = no smoothness and infinity gives unreliable results.
I've been reading for ages and still dont understand this last line at all. Please could someone go through an example, or how to solve this? (use what values of thi u want)
Extra information I don't know if it's useful:
Thi(x) = exp( - euc_dist(x-ci) / 2*gamma_squared)
x = network input, c = centre of neuron, gamma = width.
Summary
I need to use the least square solution based on the pseudoinverse of an NxM thi matrix multiplied by Nx1 weight matrix minus Nx1 output matrix to find the Nx1 weight matrix.
w = pseudo_inverse_thi * output vector
where pseudo_inverse_thi = limit equation above
The SVD is somehow used to accomplish this. If I make no sense, I apologise, I'm utterly lost.
linear-algebra matrices least-squares svd
edited Jul 16 '17 at 10:48
Rodrigo de Azevedo
13k41958
asked Apr 4 '13 at 23:17
ConfusedConfused
112
$endgroup$
$begingroup$
You can start by reading the Wikipedia article on SVD. Calculating the Moore-Penrose pseudoinverse is the first thing listed in the applications section.
$endgroup$
– Nathan Reed
Apr 4 '13 at 23:28
$begingroup$
It sounds like you need to compute a least squares solution to $Ax = b$. There are various ways to do this, and one popular method uses the SVD. A less sophisticated approach would be to solve the "normal equations" $A^T Ax = A^T b$ using a method like Gaussian elimination. However, depending on what software you're using, you might not need to worry about the details of finding a least squares solution. For example, in Matlab you can just type x = A b ;
$endgroup$
– littleO
Jun 19 '14 at 23:12
$begingroup$
About "typing out the problem", you can look here: MathJax basic tutorial and quick reference.
$endgroup$
– fonini
May 9 '16 at 0:26
add a comment |
$begingroup$
Hi apologies it's hard to type out the problem,
I have a lecture slide on neural networks. It says the fitting error gives the matrix:
N by M matrix of thi's multiplied by Mx1 weights minus Nx1 outputs (ys)
The Euclidean distance of this entire function is then found. Thi is a function, given at the bottom, w are the corresponding weights and y is the network output.
Following this the slide says "The above minimisation problem is usually solved using the least squares solution based on the pseudoinverse:
w = thi y thi has + above indicating pseudoinverse.
"This pseudoinverse is efficiently solved using the singular value decomposition (SVD) techniques".
thi+ = (limit (thi_transpose * thi + lambda * Identity_Matrix)^(-1)) * thi_transpose
The limit is as lamba tends to zero. Lambda is a user-defined regularisation parameter, whereby 0 = no smoothness and infinity gives unreliable results.
I've been reading for ages and still dont understand this last line at all. Please could someone go through an example, or how to solve this? (use what values of thi u want)
Extra information I don't know if it's useful:
Thi(x) = exp( - euc_dist(x-ci) / 2*gamma_squared)
x = network input, c = centre of neuron, gamma = width.
Summary
I need to use the least square solution based on the pseudoinverse of an NxM thi matrix multiplied by Nx1 weight matrix minus Nx1 output matrix to find the Nx1 weight matrix.
w = pseudo_inverse_thi * output vector
where pseudo_inverse_thi = limit equation above
The SVD is somehow used to accomplish this. If I make no sense, I apologise, I'm utterly lost.
linear-algebra matrices least-squares svd
edited Jul 16 '17 at 10:48
Rodrigo de Azevedo
13k41958
asked Apr 4 '13 at 23:17
ConfusedConfused
112
$endgroup$
Hi apologies it's hard to type out the problem,
I have a lecture slide on neural networks. It says the fitting error gives the matrix:
N by M matrix of thi's multiplied by Mx1 weights minus Nx1 outputs (ys)
The Euclidean distance of this entire function is then found. Thi is a function, given at the bottom, w are the corresponding weights and y is the network output.
Following this the slide says "The above minimisation problem is usually solved using the least squares solution based on the pseudoinverse:
w = thi y thi has + above indicating pseudoinverse.
"This pseudoinverse is efficiently solved using the singular value decomposition (SVD) techniques".
thi+ = (limit (thi_transpose * thi + lambda * Identity_Matrix)^(-1)) * thi_transpose
The limit is as lamba tends to zero. Lambda is a user-defined regularisation parameter, whereby 0 = no smoothness and infinity gives unreliable results.
I've been reading for ages and still dont understand this last line at all. Please could someone go through an example, or how to solve this? (use what values of thi u want)
Extra information I don't know if it's useful:
Thi(x) = exp( - euc_dist(x-ci) / 2*gamma_squared)
x = network input, c = centre of neuron, gamma = width.
Summary
I need to use the least square solution based on the pseudoinverse of an NxM thi matrix multiplied by Nx1 weight matrix minus Nx1 output matrix to find the Nx1 weight matrix.
w = pseudo_inverse_thi * output vector
where pseudo_inverse_thi = limit equation above
The SVD is somehow used to accomplish this. If I make no sense, I apologise, I'm utterly lost.
linear-algebra matrices least-squares svd
linear-algebra matrices least-squares svd
edited Jul 16 '17 at 10:48
Rodrigo de Azevedo
13k41958
asked Apr 4 '13 at 23:17
ConfusedConfused
112
edited Jul 16 '17 at 10:48
Rodrigo de Azevedo
13k41958
asked Apr 4 '13 at 23:17
ConfusedConfused
112
edited Jul 16 '17 at 10:48
Rodrigo de Azevedo
13k41958
edited Jul 16 '17 at 10:48
Rodrigo de Azevedo
13k41958
edited Jul 16 '17 at 10:48
Rodrigo de Azevedo
13k41958
13k41958
asked Apr 4 '13 at 23:17
ConfusedConfused
112
asked Apr 4 '13 at 23:17
ConfusedConfused
112
asked Apr 4 '13 at 23:17
ConfusedConfused
112
112
$begingroup$
You can start by reading the Wikipedia article on SVD. Calculating the Moore-Penrose pseudoinverse is the first thing listed in the applications section.
$endgroup$
– Nathan Reed
Apr 4 '13 at 23:28
$begingroup$
It sounds like you need to compute a least squares solution to $Ax = b$. There are various ways to do this, and one popular method uses the SVD. A less sophisticated approach would be to solve the "normal equations" $A^T Ax = A^T b$ using a method like Gaussian elimination. However, depending on what software you're using, you might not need to worry about the details of finding a least squares solution. For example, in Matlab you can just type x = A b ;
$endgroup$
– littleO
Jun 19 '14 at 23:12
$begingroup$
About "typing out the problem", you can look here: MathJax basic tutorial and quick reference.
$endgroup$
– fonini
May 9 '16 at 0:26
add a comment |
$begingroup$
You can start by reading the Wikipedia article on SVD. Calculating the Moore-Penrose pseudoinverse is the first thing listed in the applications section.
$endgroup$
– Nathan Reed
Apr 4 '13 at 23:28
$begingroup$
It sounds like you need to compute a least squares solution to $Ax = b$. There are various ways to do this, and one popular method uses the SVD. A less sophisticated approach would be to solve the "normal equations" $A^T Ax = A^T b$ using a method like Gaussian elimination. However, depending on what software you're using, you might not need to worry about the details of finding a least squares solution. For example, in Matlab you can just type x = A b ;
$endgroup$
– littleO
Jun 19 '14 at 23:12
$begingroup$
About "typing out the problem", you can look here: MathJax basic tutorial and quick reference.
$endgroup$
– fonini
May 9 '16 at 0:26
$begingroup$
You can start by reading the Wikipedia article on SVD. Calculating the Moore-Penrose pseudoinverse is the first thing listed in the applications section.
$endgroup$
– Nathan Reed
Apr 4 '13 at 23:28
$begingroup$
You can start by reading the Wikipedia article on SVD. Calculating the Moore-Penrose pseudoinverse is the first thing listed in the applications section.
$endgroup$
– Nathan Reed
Apr 4 '13 at 23:28
$begingroup$
It sounds like you need to compute a least squares solution to $Ax = b$. There are various ways to do this, and one popular method uses the SVD. A less sophisticated approach would be to solve the "normal equations" $A^T Ax = A^T b$ using a method like Gaussian elimination. However, depending on what software you're using, you might not need to worry about the details of finding a least squares solution. For example, in Matlab you can just type x = A b ;
$endgroup$
– littleO
Jun 19 '14 at 23:12
$begingroup$
It sounds like you need to compute a least squares solution to $Ax = b$. There are various ways to do this, and one popular method uses the SVD. A less sophisticated approach would be to solve the "normal equations" $A^T Ax = A^T b$ using a method like Gaussian elimination. However, depending on what software you're using, you might not need to worry about the details of finding a least squares solution. For example, in Matlab you can just type x = A b ;
$endgroup$
– littleO
Jun 19 '14 at 23:12
$begingroup$
About "typing out the problem", you can look here: MathJax basic tutorial and quick reference.
$endgroup$
– fonini
May 9 '16 at 0:26
$begingroup$
About "typing out the problem", you can look here: MathJax basic tutorial and quick reference.
$endgroup$
– fonini
May 9 '16 at 0:26
add a comment |
1 Answer
1
active
oldest
votes
$begingroup$
This is just the standard approach to solving linear least-squares problems; I suppose that's why the author glossed over it.
From a theoretical point of view, the equations that arise in a least-squares problem can be solved neatly by using a matrix "pseudo-inverse". This is just like the way you use a matrix inverse to "solve" a traditional set of linear equations. But, in both cases, you're not really "solving" the equations -- the matrix inverses just give you a nice tidy way to write the solutions in a theoretical description.
But, as everyone knows, the computational techniques are not the same as the theoretical ones. To compute the solution of a system of linear equations, you would never compute a matrix inverse. And, similarly, to compute the solution of a least-squares problem, you would not compute the pseudo-inverse of the associated matrix. Instead, you would compute its SVD. Again, a completely standard approach.
There is a fairly readable account of all this in these slides.
Or, even better, maybe, look at this wikipedia article. Section 4 talks about computational techniques, including SVD techniques.
answered Apr 4 '13 at 23:38
bubbabubba
30.4k33086
$endgroup$
$begingroup$
Thanks, I'm still confused though. If I dont compute the matrix then I dont understand how I get any of the U sigma or I parts. Would it be possible to go through an example? I've been trying to get my head around it but I'm going round in circles
$endgroup$
– Fred Johnson
Apr 5 '13 at 20:00
$begingroup$
Sorry for the delay -- didn't see your comment until today. You do compute the matrix. But you don't compute its inverse. Matrix inverses are just a neat way to write down the theory. In practice, inverting matrices is usually a bad way to solve computational problems.
$endgroup$
– bubba
Apr 30 '13 at 11:17
$begingroup$
The link is dead. You may replace it by - docs.google.com/viewer?url=https://github.com/RoyiAvital/…. Something I rote once on SVD.
$endgroup$
– Royi
Sep 8 '17 at 19:07
add a comment |
Your Answer
StackExchange.ifUsing("editor", function () {
return StackExchange.using("mathjaxEditing", function () {
StackExchange.MarkdownEditor.creationCallbacks.add(function (editor, postfix) {
StackExchange.mathjaxEditing.prepareWmdForMathJax(editor, postfix, [["$", "$"], ["\\(","\\)"]]);
});
});
}, "mathjax-editing");
StackExchange.ready(function() {
var channelOptions = {
tags: "".split(" "),
id: "69"
};
initTagRenderer("".split(" "), "".split(" "), channelOptions);
StackExchange.using("externalEditor", function() {
// Have to fire editor after snippets, if snippets enabled
if (StackExchange.settings.snippets.snippetsEnabled) {
StackExchange.using("snippets", function() {
createEditor();
});
}
else {
createEditor();
}
});
function createEditor() {
StackExchange.prepareEditor({
heartbeatType: 'answer',
autoActivateHeartbeat: false,
convertImagesToLinks: true,
noModals: true,
showLowRepImageUploadWarning: true,
reputationToPostImages: 10,
bindNavPrevention: true,
postfix: "",
imageUploader: {
brandingHtml: "Powered by u003ca class="icon-imgur-white" href="https://imgur.com/"u003eu003c/au003e",
contentPolicyHtml: "User contributions licensed under u003ca href="https://creativecommons.org/licenses/by-sa/3.0/"u003ecc by-sa 3.0 with attribution requiredu003c/au003e u003ca href="https://stackoverflow.com/legal/content-policy"u003e(content policy)u003c/au003e",
allowUrls: true
},
noCode: true, onDemand: true,
discardSelector: ".discard-answer"
,immediatelyShowMarkdownHelp:true
});
}
});
Sign up or log in
StackExchange.ready(function () {
StackExchange.helpers.onClickDraftSave('#login-link');
});
Sign up using Google
Sign up using Facebook
Sign up using Email and Password
Post as a guest
Required, but never shown
StackExchange.ready(
function () {
StackExchange.openid.initPostLogin('.new-post-login', 'https%3a%2f%2fmath.stackexchange.com%2fquestions%2f351588%2fleast-square-solution-based-on-the-pseudoinverse-solved-efficiently-with-singula%23new-answer', 'question_page');
}
);
Post as a guest
Required, but never shown
1 Answer
1
active
oldest
votes
1 Answer
1
active
oldest
votes
active
oldest
votes
active
oldest
votes
$begingroup$
This is just the standard approach to solving linear least-squares problems; I suppose that's why the author glossed over it.
From a theoretical point of view, the equations that arise in a least-squares problem can be solved neatly by using a matrix "pseudo-inverse". This is just like the way you use a matrix inverse to "solve" a traditional set of linear equations. But, in both cases, you're not really "solving" the equations -- the matrix inverses just give you a nice tidy way to write the solutions in a theoretical description.
But, as everyone knows, the computational techniques are not the same as the theoretical ones. To compute the solution of a system of linear equations, you would never compute a matrix inverse. And, similarly, to compute the solution of a least-squares problem, you would not compute the pseudo-inverse of the associated matrix. Instead, you would compute its SVD. Again, a completely standard approach.
There is a fairly readable account of all this in these slides.
Or, even better, maybe, look at this wikipedia article. Section 4 talks about computational techniques, including SVD techniques.
answered Apr 4 '13 at 23:38
bubbabubba
30.4k33086
$endgroup$
$begingroup$
Thanks, I'm still confused though. If I dont compute the matrix then I dont understand how I get any of the U sigma or I parts. Would it be possible to go through an example? I've been trying to get my head around it but I'm going round in circles
$endgroup$
– Fred Johnson
Apr 5 '13 at 20:00
$begingroup$
Sorry for the delay -- didn't see your comment until today. You do compute the matrix. But you don't compute its inverse. Matrix inverses are just a neat way to write down the theory. In practice, inverting matrices is usually a bad way to solve computational problems.
$endgroup$
– bubba
Apr 30 '13 at 11:17
$begingroup$
The link is dead. You may replace it by - docs.google.com/viewer?url=https://github.com/RoyiAvital/…. Something I rote once on SVD.
$endgroup$
– Royi
Sep 8 '17 at 19:07
add a comment |
$begingroup$
This is just the standard approach to solving linear least-squares problems; I suppose that's why the author glossed over it.
From a theoretical point of view, the equations that arise in a least-squares problem can be solved neatly by using a matrix "pseudo-inverse". This is just like the way you use a matrix inverse to "solve" a traditional set of linear equations. But, in both cases, you're not really "solving" the equations -- the matrix inverses just give you a nice tidy way to write the solutions in a theoretical description.
But, as everyone knows, the computational techniques are not the same as the theoretical ones. To compute the solution of a system of linear equations, you would never compute a matrix inverse. And, similarly, to compute the solution of a least-squares problem, you would not compute the pseudo-inverse of the associated matrix. Instead, you would compute its SVD. Again, a completely standard approach.
There is a fairly readable account of all this in these slides.
Or, even better, maybe, look at this wikipedia article. Section 4 talks about computational techniques, including SVD techniques.
answered Apr 4 '13 at 23:38
bubbabubba
30.4k33086
$endgroup$
$begingroup$
Thanks, I'm still confused though. If I dont compute the matrix then I dont understand how I get any of the U sigma or I parts. Would it be possible to go through an example? I've been trying to get my head around it but I'm going round in circles
$endgroup$
– Fred Johnson
Apr 5 '13 at 20:00
$begingroup$
Sorry for the delay -- didn't see your comment until today. You do compute the matrix. But you don't compute its inverse. Matrix inverses are just a neat way to write down the theory. In practice, inverting matrices is usually a bad way to solve computational problems.
$endgroup$
– bubba
Apr 30 '13 at 11:17
$begingroup$
The link is dead. You may replace it by - docs.google.com/viewer?url=https://github.com/RoyiAvital/…. Something I rote once on SVD.
$endgroup$
– Royi
Sep 8 '17 at 19:07
add a comment |
$begingroup$
This is just the standard approach to solving linear least-squares problems; I suppose that's why the author glossed over it.
From a theoretical point of view, the equations that arise in a least-squares problem can be solved neatly by using a matrix "pseudo-inverse". This is just like the way you use a matrix inverse to "solve" a traditional set of linear equations. But, in both cases, you're not really "solving" the equations -- the matrix inverses just give you a nice tidy way to write the solutions in a theoretical description.
But, as everyone knows, the computational techniques are not the same as the theoretical ones. To compute the solution of a system of linear equations, you would never compute a matrix inverse. And, similarly, to compute the solution of a least-squares problem, you would not compute the pseudo-inverse of the associated matrix. Instead, you would compute its SVD. Again, a completely standard approach.
There is a fairly readable account of all this in these slides.
Or, even better, maybe, look at this wikipedia article. Section 4 talks about computational techniques, including SVD techniques.
answered Apr 4 '13 at 23:38
bubbabubba
30.4k33086
$endgroup$
This is just the standard approach to solving linear least-squares problems; I suppose that's why the author glossed over it.
From a theoretical point of view, the equations that arise in a least-squares problem can be solved neatly by using a matrix "pseudo-inverse". This is just like the way you use a matrix inverse to "solve" a traditional set of linear equations. But, in both cases, you're not really "solving" the equations -- the matrix inverses just give you a nice tidy way to write the solutions in a theoretical description.
But, as everyone knows, the computational techniques are not the same as the theoretical ones. To compute the solution of a system of linear equations, you would never compute a matrix inverse. And, similarly, to compute the solution of a least-squares problem, you would not compute the pseudo-inverse of the associated matrix. Instead, you would compute its SVD. Again, a completely standard approach.
There is a fairly readable account of all this in these slides.
Or, even better, maybe, look at this wikipedia article. Section 4 talks about computational techniques, including SVD techniques.
answered Apr 4 '13 at 23:38
bubbabubba
30.4k33086
edited Apr 4 '13 at 23:44
answered Apr 4 '13 at 23:38
bubbabubba
30.4k33086
answered Apr 4 '13 at 23:38
bubbabubba
30.4k33086
answered Apr 4 '13 at 23:38
bubbabubba
30.4k33086
30.4k33086
$begingroup$
Thanks, I'm still confused though. If I dont compute the matrix then I dont understand how I get any of the U sigma or I parts. Would it be possible to go through an example? I've been trying to get my head around it but I'm going round in circles
$endgroup$
– Fred Johnson
Apr 5 '13 at 20:00
$begingroup$
Sorry for the delay -- didn't see your comment until today. You do compute the matrix. But you don't compute its inverse. Matrix inverses are just a neat way to write down the theory. In practice, inverting matrices is usually a bad way to solve computational problems.
$endgroup$
– bubba
Apr 30 '13 at 11:17
$begingroup$
The link is dead. You may replace it by - docs.google.com/viewer?url=https://github.com/RoyiAvital/…. Something I rote once on SVD.
$endgroup$
– Royi
Sep 8 '17 at 19:07
add a comment |
$begingroup$
Thanks, I'm still confused though. If I dont compute the matrix then I dont understand how I get any of the U sigma or I parts. Would it be possible to go through an example? I've been trying to get my head around it but I'm going round in circles
$endgroup$
– Fred Johnson
Apr 5 '13 at 20:00
$begingroup$
Sorry for the delay -- didn't see your comment until today. You do compute the matrix. But you don't compute its inverse. Matrix inverses are just a neat way to write down the theory. In practice, inverting matrices is usually a bad way to solve computational problems.
$endgroup$
– bubba
Apr 30 '13 at 11:17
$begingroup$
The link is dead. You may replace it by - docs.google.com/viewer?url=https://github.com/RoyiAvital/…. Something I rote once on SVD.
$endgroup$
– Royi
Sep 8 '17 at 19:07
$begingroup$
Thanks, I'm still confused though. If I dont compute the matrix then I dont understand how I get any of the U sigma or I parts. Would it be possible to go through an example? I've been trying to get my head around it but I'm going round in circles
$endgroup$
– Fred Johnson
Apr 5 '13 at 20:00
$begingroup$
Thanks, I'm still confused though. If I dont compute the matrix then I dont understand how I get any of the U sigma or I parts. Would it be possible to go through an example? I've been trying to get my head around it but I'm going round in circles
$endgroup$
– Fred Johnson
Apr 5 '13 at 20:00
$begingroup$
Sorry for the delay -- didn't see your comment until today. You do compute the matrix. But you don't compute its inverse. Matrix inverses are just a neat way to write down the theory. In practice, inverting matrices is usually a bad way to solve computational problems.
$endgroup$
– bubba
Apr 30 '13 at 11:17
$begingroup$
Sorry for the delay -- didn't see your comment until today. You do compute the matrix. But you don't compute its inverse. Matrix inverses are just a neat way to write down the theory. In practice, inverting matrices is usually a bad way to solve computational problems.
$endgroup$
– bubba
Apr 30 '13 at 11:17
$begingroup$
The link is dead. You may replace it by - docs.google.com/viewer?url=https://github.com/RoyiAvital/…. Something I rote once on SVD.
$endgroup$
– Royi
Sep 8 '17 at 19:07
$begingroup$
The link is dead. You may replace it by - docs.google.com/viewer?url=https://github.com/RoyiAvital/…. Something I rote once on SVD.
$endgroup$
– Royi
Sep 8 '17 at 19:07
add a comment |
Thanks for contributing an answer to Mathematics Stack Exchange!
- Please be sure to answer the question. Provide details and share your research!
But avoid …
- Asking for help, clarification, or responding to other answers.
- Making statements based on opinion; back them up with references or personal experience.
Use MathJax to format equations. MathJax reference.
To learn more, see our tips on writing great answers.
Sign up or log in
StackExchange.ready(function () {
StackExchange.helpers.onClickDraftSave('#login-link');
});
Sign up using Google
Sign up using Facebook
Sign up using Email and Password
Post as a guest
Required, but never shown
StackExchange.ready(
function () {
StackExchange.openid.initPostLogin('.new-post-login', 'https%3a%2f%2fmath.stackexchange.com%2fquestions%2f351588%2fleast-square-solution-based-on-the-pseudoinverse-solved-efficiently-with-singula%23new-answer', 'question_page');
}
);
Post as a guest
Required, but never shown
Sign up or log in
StackExchange.ready(function () {
StackExchange.helpers.onClickDraftSave('#login-link');
});
Sign up using Google
Sign up using Facebook
Sign up using Email and Password
Post as a guest
Required, but never shown
Sign up or log in
StackExchange.ready(function () {
StackExchange.helpers.onClickDraftSave('#login-link');
});
Sign up using Google
Sign up using Facebook
Sign up using Email and Password
Post as a guest
Required, but never shown
Sign up or log in
StackExchange.ready(function () {
StackExchange.helpers.onClickDraftSave('#login-link');
});
Sign up using Google
Sign up using Facebook
Sign up using Email and Password
Sign up using Google
Sign up using Facebook
Sign up using Email and Password
Post as a guest
Required, but never shown
Required, but never shown
Required, but never shown
Required, but never shown
Required, but never shown
Required, but never shown
Required, but never shown
Required, but never shown
Required, but never shown
$begingroup$
You can start by reading the Wikipedia article on SVD. Calculating the Moore-Penrose pseudoinverse is the first thing listed in the applications section.
$endgroup$
– Nathan Reed
Apr 4 '13 at 23:28
$begingroup$
It sounds like you need to compute a least squares solution to $Ax = b$. There are various ways to do this, and one popular method uses the SVD. A less sophisticated approach would be to solve the "normal equations" $A^T Ax = A^T b$ using a method like Gaussian elimination. However, depending on what software you're using, you might not need to worry about the details of finding a least squares solution. For example, in Matlab you can just type x = A b ;
$endgroup$
– littleO
Jun 19 '14 at 23:12
$begingroup$
About "typing out the problem", you can look here: MathJax basic tutorial and quick reference.
$endgroup$
– fonini
May 9 '16 at 0:26