I would like an equation of a matrix pseudo-inverse to be explained
I am currently reading a paper titled "A Noise Tolerant Algorithm for Wrist-Mounted Robotic Sensor Calibration with or without Sensor Orientation Measurement", i can email you a snapshot of this paper since i bought it off IEEE.
In this paper, an equation of the form $AX = B$ is solved for $X$ using what appears to be the pseudo-inverse of $A$ (denoted as $A^+$), and then it is stated that:
$$A^+ = (A^TA)^{-1}(A^T)$$
I am not able to follow how this equality is true, is it?
Thank you,
linear-algebra matrices matrix-equations pseudoinverse
add a comment |
I am currently reading a paper titled "A Noise Tolerant Algorithm for Wrist-Mounted Robotic Sensor Calibration with or without Sensor Orientation Measurement", i can email you a snapshot of this paper since i bought it off IEEE.
In this paper, an equation of the form $AX = B$ is solved for $X$ using what appears to be the pseudo-inverse of $A$ (denoted as $A^+$), and then it is stated that:
$$A^+ = (A^TA)^{-1}(A^T)$$
I am not able to follow how this equality is true, is it?
Thank you,
linear-algebra matrices matrix-equations pseudoinverse
3
What definition of the pseudo-inverse are you working with? Are you asking us to show you how this formula for $A^{+}$ satisfies that definition?
– Brian Borchers
Dec 8 at 17:22
Assuming that $A$ has full column rank, left-multiply both sides of the matrix equation by $A^top$, then left-multiply both sides by the inverse of $A^top A$.
– Rodrigo de Azevedo
Dec 8 at 17:24
According to Wikipedia, there are four defining properties of pseudo-inverse and it always exists and is unique. When $A^intercal A$ is invertible, we can show that $(A^intercal A)^{-1} A^intercal$ satisfies the four defining properties mentioned above. Therefore, we can write $A^+ = (A^intercal A)^{-1}A^intercal$ (since it exists and is unique as mentioned above).
– Alex Vong
Dec 8 at 17:52
@BrianBorchers apologies for the ambiguity, it is assumed to be a Moore-Penrose inverse.
– Jad Tawil
Dec 9 at 19:55
add a comment |
I am currently reading a paper titled "A Noise Tolerant Algorithm for Wrist-Mounted Robotic Sensor Calibration with or without Sensor Orientation Measurement", i can email you a snapshot of this paper since i bought it off IEEE.
In this paper, an equation of the form $AX = B$ is solved for $X$ using what appears to be the pseudo-inverse of $A$ (denoted as $A^+$), and then it is stated that:
$$A^+ = (A^TA)^{-1}(A^T)$$
I am not able to follow how this equality is true, is it?
Thank you,
linear-algebra matrices matrix-equations pseudoinverse
I am currently reading a paper titled "A Noise Tolerant Algorithm for Wrist-Mounted Robotic Sensor Calibration with or without Sensor Orientation Measurement", i can email you a snapshot of this paper since i bought it off IEEE.
In this paper, an equation of the form $AX = B$ is solved for $X$ using what appears to be the pseudo-inverse of $A$ (denoted as $A^+$), and then it is stated that:
$$A^+ = (A^TA)^{-1}(A^T)$$
I am not able to follow how this equality is true, is it?
Thank you,
linear-algebra matrices matrix-equations pseudoinverse
linear-algebra matrices matrix-equations pseudoinverse
edited Dec 8 at 17:25
Rodrigo de Azevedo
12.8k41854
12.8k41854
asked Dec 8 at 16:35
Jad Tawil
11
11
3
What definition of the pseudo-inverse are you working with? Are you asking us to show you how this formula for $A^{+}$ satisfies that definition?
– Brian Borchers
Dec 8 at 17:22
Assuming that $A$ has full column rank, left-multiply both sides of the matrix equation by $A^top$, then left-multiply both sides by the inverse of $A^top A$.
– Rodrigo de Azevedo
Dec 8 at 17:24
According to Wikipedia, there are four defining properties of pseudo-inverse and it always exists and is unique. When $A^intercal A$ is invertible, we can show that $(A^intercal A)^{-1} A^intercal$ satisfies the four defining properties mentioned above. Therefore, we can write $A^+ = (A^intercal A)^{-1}A^intercal$ (since it exists and is unique as mentioned above).
– Alex Vong
Dec 8 at 17:52
@BrianBorchers apologies for the ambiguity, it is assumed to be a Moore-Penrose inverse.
– Jad Tawil
Dec 9 at 19:55
add a comment |
3
What definition of the pseudo-inverse are you working with? Are you asking us to show you how this formula for $A^{+}$ satisfies that definition?
– Brian Borchers
Dec 8 at 17:22
Assuming that $A$ has full column rank, left-multiply both sides of the matrix equation by $A^top$, then left-multiply both sides by the inverse of $A^top A$.
– Rodrigo de Azevedo
Dec 8 at 17:24
According to Wikipedia, there are four defining properties of pseudo-inverse and it always exists and is unique. When $A^intercal A$ is invertible, we can show that $(A^intercal A)^{-1} A^intercal$ satisfies the four defining properties mentioned above. Therefore, we can write $A^+ = (A^intercal A)^{-1}A^intercal$ (since it exists and is unique as mentioned above).
– Alex Vong
Dec 8 at 17:52
@BrianBorchers apologies for the ambiguity, it is assumed to be a Moore-Penrose inverse.
– Jad Tawil
Dec 9 at 19:55
3
3
What definition of the pseudo-inverse are you working with? Are you asking us to show you how this formula for $A^{+}$ satisfies that definition?
– Brian Borchers
Dec 8 at 17:22
What definition of the pseudo-inverse are you working with? Are you asking us to show you how this formula for $A^{+}$ satisfies that definition?
– Brian Borchers
Dec 8 at 17:22
Assuming that $A$ has full column rank, left-multiply both sides of the matrix equation by $A^top$, then left-multiply both sides by the inverse of $A^top A$.
– Rodrigo de Azevedo
Dec 8 at 17:24
Assuming that $A$ has full column rank, left-multiply both sides of the matrix equation by $A^top$, then left-multiply both sides by the inverse of $A^top A$.
– Rodrigo de Azevedo
Dec 8 at 17:24
According to Wikipedia, there are four defining properties of pseudo-inverse and it always exists and is unique. When $A^intercal A$ is invertible, we can show that $(A^intercal A)^{-1} A^intercal$ satisfies the four defining properties mentioned above. Therefore, we can write $A^+ = (A^intercal A)^{-1}A^intercal$ (since it exists and is unique as mentioned above).
– Alex Vong
Dec 8 at 17:52
According to Wikipedia, there are four defining properties of pseudo-inverse and it always exists and is unique. When $A^intercal A$ is invertible, we can show that $(A^intercal A)^{-1} A^intercal$ satisfies the four defining properties mentioned above. Therefore, we can write $A^+ = (A^intercal A)^{-1}A^intercal$ (since it exists and is unique as mentioned above).
– Alex Vong
Dec 8 at 17:52
@BrianBorchers apologies for the ambiguity, it is assumed to be a Moore-Penrose inverse.
– Jad Tawil
Dec 9 at 19:55
@BrianBorchers apologies for the ambiguity, it is assumed to be a Moore-Penrose inverse.
– Jad Tawil
Dec 9 at 19:55
add a comment |
active
oldest
votes
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%2f3031322%2fi-would-like-an-equation-of-a-matrix-pseudo-inverse-to-be-explained%23new-answer', 'question_page');
}
);
Post as a guest
Required, but never shown
active
oldest
votes
active
oldest
votes
active
oldest
votes
active
oldest
votes
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.
Some of your past answers have not been well-received, and you're in danger of being blocked from answering.
Please pay close attention to the following guidance:
- 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.
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%2f3031322%2fi-would-like-an-equation-of-a-matrix-pseudo-inverse-to-be-explained%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
3
What definition of the pseudo-inverse are you working with? Are you asking us to show you how this formula for $A^{+}$ satisfies that definition?
– Brian Borchers
Dec 8 at 17:22
Assuming that $A$ has full column rank, left-multiply both sides of the matrix equation by $A^top$, then left-multiply both sides by the inverse of $A^top A$.
– Rodrigo de Azevedo
Dec 8 at 17:24
According to Wikipedia, there are four defining properties of pseudo-inverse and it always exists and is unique. When $A^intercal A$ is invertible, we can show that $(A^intercal A)^{-1} A^intercal$ satisfies the four defining properties mentioned above. Therefore, we can write $A^+ = (A^intercal A)^{-1}A^intercal$ (since it exists and is unique as mentioned above).
– Alex Vong
Dec 8 at 17:52
@BrianBorchers apologies for the ambiguity, it is assumed to be a Moore-Penrose inverse.
– Jad Tawil
Dec 9 at 19:55