Diagonalization without computing the inverse












0














Is there a way to find A = PDP^-1 but without computing the inverse of P?



If PP^-1equal to identity matrix, can I say A = ID ?










share|cite|improve this question






















  • It will always be true that $;PP^{-1}=I;$ , so that should be a hint for you that no: you can't definitely say $;A=I;$ as matrix multiplication isn't, in general, commutative. You can diagonalize $;A;$ though if it is diagonalizable and if you know the matrix's eigenvalues, without any need of $;P;$ or of its inverse.
    – DonAntonio
    Nov 19 '18 at 0:45










  • Given a diagonalizable matrix $A$, it is possible to compute both $P$ and $D$ without computing $P^{-1}$. Is that what you're trying to do?
    – Omnomnomnom
    Nov 19 '18 at 0:51










  • @Omnomnomnom Yes. Now I understand after DonAntonio's comment.
    – myadeniboy
    Nov 19 '18 at 1:20
















0














Is there a way to find A = PDP^-1 but without computing the inverse of P?



If PP^-1equal to identity matrix, can I say A = ID ?










share|cite|improve this question






















  • It will always be true that $;PP^{-1}=I;$ , so that should be a hint for you that no: you can't definitely say $;A=I;$ as matrix multiplication isn't, in general, commutative. You can diagonalize $;A;$ though if it is diagonalizable and if you know the matrix's eigenvalues, without any need of $;P;$ or of its inverse.
    – DonAntonio
    Nov 19 '18 at 0:45










  • Given a diagonalizable matrix $A$, it is possible to compute both $P$ and $D$ without computing $P^{-1}$. Is that what you're trying to do?
    – Omnomnomnom
    Nov 19 '18 at 0:51










  • @Omnomnomnom Yes. Now I understand after DonAntonio's comment.
    – myadeniboy
    Nov 19 '18 at 1:20














0












0








0







Is there a way to find A = PDP^-1 but without computing the inverse of P?



If PP^-1equal to identity matrix, can I say A = ID ?










share|cite|improve this question













Is there a way to find A = PDP^-1 but without computing the inverse of P?



If PP^-1equal to identity matrix, can I say A = ID ?







matrices inverse diagonalization






share|cite|improve this question













share|cite|improve this question











share|cite|improve this question




share|cite|improve this question










asked Nov 19 '18 at 0:40









myadeniboy

11




11












  • It will always be true that $;PP^{-1}=I;$ , so that should be a hint for you that no: you can't definitely say $;A=I;$ as matrix multiplication isn't, in general, commutative. You can diagonalize $;A;$ though if it is diagonalizable and if you know the matrix's eigenvalues, without any need of $;P;$ or of its inverse.
    – DonAntonio
    Nov 19 '18 at 0:45










  • Given a diagonalizable matrix $A$, it is possible to compute both $P$ and $D$ without computing $P^{-1}$. Is that what you're trying to do?
    – Omnomnomnom
    Nov 19 '18 at 0:51










  • @Omnomnomnom Yes. Now I understand after DonAntonio's comment.
    – myadeniboy
    Nov 19 '18 at 1:20


















  • It will always be true that $;PP^{-1}=I;$ , so that should be a hint for you that no: you can't definitely say $;A=I;$ as matrix multiplication isn't, in general, commutative. You can diagonalize $;A;$ though if it is diagonalizable and if you know the matrix's eigenvalues, without any need of $;P;$ or of its inverse.
    – DonAntonio
    Nov 19 '18 at 0:45










  • Given a diagonalizable matrix $A$, it is possible to compute both $P$ and $D$ without computing $P^{-1}$. Is that what you're trying to do?
    – Omnomnomnom
    Nov 19 '18 at 0:51










  • @Omnomnomnom Yes. Now I understand after DonAntonio's comment.
    – myadeniboy
    Nov 19 '18 at 1:20
















It will always be true that $;PP^{-1}=I;$ , so that should be a hint for you that no: you can't definitely say $;A=I;$ as matrix multiplication isn't, in general, commutative. You can diagonalize $;A;$ though if it is diagonalizable and if you know the matrix's eigenvalues, without any need of $;P;$ or of its inverse.
– DonAntonio
Nov 19 '18 at 0:45




It will always be true that $;PP^{-1}=I;$ , so that should be a hint for you that no: you can't definitely say $;A=I;$ as matrix multiplication isn't, in general, commutative. You can diagonalize $;A;$ though if it is diagonalizable and if you know the matrix's eigenvalues, without any need of $;P;$ or of its inverse.
– DonAntonio
Nov 19 '18 at 0:45












Given a diagonalizable matrix $A$, it is possible to compute both $P$ and $D$ without computing $P^{-1}$. Is that what you're trying to do?
– Omnomnomnom
Nov 19 '18 at 0:51




Given a diagonalizable matrix $A$, it is possible to compute both $P$ and $D$ without computing $P^{-1}$. Is that what you're trying to do?
– Omnomnomnom
Nov 19 '18 at 0:51












@Omnomnomnom Yes. Now I understand after DonAntonio's comment.
– myadeniboy
Nov 19 '18 at 1:20




@Omnomnomnom Yes. Now I understand after DonAntonio's comment.
– myadeniboy
Nov 19 '18 at 1:20










1 Answer
1






active

oldest

votes


















0














Calculate the normalised eigenvectors of your matrix and make these eigenvectors the columns of a new matrix U.
Now calculate U^T * P * U using matrix multiplication and then you will obtain a diagonalised matrix with the eigenvalues of P as the entries on the diagonal.



NB: U^T is U-transpose.






share|cite|improve this answer

















  • 1




    No need to normalize eigenvectors, but much more important: in general, multiplying by the traspose won't diagonalize a matrix even if its diagonalizable, so the above is incorrect.
    – DonAntonio
    Nov 19 '18 at 1:16











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
});


}
});














draft saved

draft discarded


















StackExchange.ready(
function () {
StackExchange.openid.initPostLogin('.new-post-login', 'https%3a%2f%2fmath.stackexchange.com%2fquestions%2f3004343%2fdiagonalization-without-computing-the-inverse%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









0














Calculate the normalised eigenvectors of your matrix and make these eigenvectors the columns of a new matrix U.
Now calculate U^T * P * U using matrix multiplication and then you will obtain a diagonalised matrix with the eigenvalues of P as the entries on the diagonal.



NB: U^T is U-transpose.






share|cite|improve this answer

















  • 1




    No need to normalize eigenvectors, but much more important: in general, multiplying by the traspose won't diagonalize a matrix even if its diagonalizable, so the above is incorrect.
    – DonAntonio
    Nov 19 '18 at 1:16
















0














Calculate the normalised eigenvectors of your matrix and make these eigenvectors the columns of a new matrix U.
Now calculate U^T * P * U using matrix multiplication and then you will obtain a diagonalised matrix with the eigenvalues of P as the entries on the diagonal.



NB: U^T is U-transpose.






share|cite|improve this answer

















  • 1




    No need to normalize eigenvectors, but much more important: in general, multiplying by the traspose won't diagonalize a matrix even if its diagonalizable, so the above is incorrect.
    – DonAntonio
    Nov 19 '18 at 1:16














0












0








0






Calculate the normalised eigenvectors of your matrix and make these eigenvectors the columns of a new matrix U.
Now calculate U^T * P * U using matrix multiplication and then you will obtain a diagonalised matrix with the eigenvalues of P as the entries on the diagonal.



NB: U^T is U-transpose.






share|cite|improve this answer












Calculate the normalised eigenvectors of your matrix and make these eigenvectors the columns of a new matrix U.
Now calculate U^T * P * U using matrix multiplication and then you will obtain a diagonalised matrix with the eigenvalues of P as the entries on the diagonal.



NB: U^T is U-transpose.







share|cite|improve this answer












share|cite|improve this answer



share|cite|improve this answer










answered Nov 19 '18 at 1:07









Anteater23

62




62








  • 1




    No need to normalize eigenvectors, but much more important: in general, multiplying by the traspose won't diagonalize a matrix even if its diagonalizable, so the above is incorrect.
    – DonAntonio
    Nov 19 '18 at 1:16














  • 1




    No need to normalize eigenvectors, but much more important: in general, multiplying by the traspose won't diagonalize a matrix even if its diagonalizable, so the above is incorrect.
    – DonAntonio
    Nov 19 '18 at 1:16








1




1




No need to normalize eigenvectors, but much more important: in general, multiplying by the traspose won't diagonalize a matrix even if its diagonalizable, so the above is incorrect.
– DonAntonio
Nov 19 '18 at 1:16




No need to normalize eigenvectors, but much more important: in general, multiplying by the traspose won't diagonalize a matrix even if its diagonalizable, so the above is incorrect.
– DonAntonio
Nov 19 '18 at 1:16


















draft saved

draft discarded




















































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.




draft saved


draft discarded














StackExchange.ready(
function () {
StackExchange.openid.initPostLogin('.new-post-login', 'https%3a%2f%2fmath.stackexchange.com%2fquestions%2f3004343%2fdiagonalization-without-computing-the-inverse%23new-answer', 'question_page');
}
);

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







Popular posts from this blog

AnyDesk - Fatal Program Failure

How to calibrate 16:9 built-in touch-screen to a 4:3 resolution?

QoS: MAC-Priority for clients behind a repeater