Eigen-decomposition of real Symmetric psd matrix












0












$begingroup$


I am doing PCA analysis on a large amount of data and I need to compute the eigen-decomposition of the covariance matrix which is a real, symmetric, positive semi definite matrix. It doesn't get any simpler than that!



I want to compute this myself from first principles and not using some matlab, mathematica or whatever package. That's an infinite process but I am looking for a fast and robust method. Can anyone post an algorithm for it? I did a web search and found several methods but nothing complete and from scratch.



Please help, thanks in advance.










share|cite|improve this question









$endgroup$












  • $begingroup$
    You will find answer to it and many others in a best seller, very often cited in scientific papers: "Matrix Computations" by Golub and Van Loan. I know that listing books may lead to an endless dangerous chat, but this book is special ...
    $endgroup$
    – Damien
    Dec 4 '18 at 9:29






  • 1




    $begingroup$
    I want to reinvent a wheel but have no idea what a wheel looks like, can you post one? I'm impressed by your resolute denial of computer codes people worked on for decades, sir.
    $endgroup$
    – Algebraic Pavel
    Dec 4 '18 at 9:40










  • $begingroup$
    @AlgebraicPavel Sometimes, when you are doing research, you are not only interested in the functionality of a program, but you want to deeply understand it. And sometimes, the benefit of such a deep understanding of a given function appear a long time after, in an unexpected way.
    $endgroup$
    – Damien
    Dec 4 '18 at 10:02










  • $begingroup$
    @Damien I understand that what you say might be happening but the question does not give me an impression that this is the case.
    $endgroup$
    – Algebraic Pavel
    Dec 4 '18 at 10:55










  • $begingroup$
    @Damien Thanks! It's quite involved with bidiagonal matrices and so on but it looks like I can't do any better...
    $endgroup$
    – plus1
    Dec 4 '18 at 11:10
















0












$begingroup$


I am doing PCA analysis on a large amount of data and I need to compute the eigen-decomposition of the covariance matrix which is a real, symmetric, positive semi definite matrix. It doesn't get any simpler than that!



I want to compute this myself from first principles and not using some matlab, mathematica or whatever package. That's an infinite process but I am looking for a fast and robust method. Can anyone post an algorithm for it? I did a web search and found several methods but nothing complete and from scratch.



Please help, thanks in advance.










share|cite|improve this question









$endgroup$












  • $begingroup$
    You will find answer to it and many others in a best seller, very often cited in scientific papers: "Matrix Computations" by Golub and Van Loan. I know that listing books may lead to an endless dangerous chat, but this book is special ...
    $endgroup$
    – Damien
    Dec 4 '18 at 9:29






  • 1




    $begingroup$
    I want to reinvent a wheel but have no idea what a wheel looks like, can you post one? I'm impressed by your resolute denial of computer codes people worked on for decades, sir.
    $endgroup$
    – Algebraic Pavel
    Dec 4 '18 at 9:40










  • $begingroup$
    @AlgebraicPavel Sometimes, when you are doing research, you are not only interested in the functionality of a program, but you want to deeply understand it. And sometimes, the benefit of such a deep understanding of a given function appear a long time after, in an unexpected way.
    $endgroup$
    – Damien
    Dec 4 '18 at 10:02










  • $begingroup$
    @Damien I understand that what you say might be happening but the question does not give me an impression that this is the case.
    $endgroup$
    – Algebraic Pavel
    Dec 4 '18 at 10:55










  • $begingroup$
    @Damien Thanks! It's quite involved with bidiagonal matrices and so on but it looks like I can't do any better...
    $endgroup$
    – plus1
    Dec 4 '18 at 11:10














0












0








0





$begingroup$


I am doing PCA analysis on a large amount of data and I need to compute the eigen-decomposition of the covariance matrix which is a real, symmetric, positive semi definite matrix. It doesn't get any simpler than that!



I want to compute this myself from first principles and not using some matlab, mathematica or whatever package. That's an infinite process but I am looking for a fast and robust method. Can anyone post an algorithm for it? I did a web search and found several methods but nothing complete and from scratch.



Please help, thanks in advance.










share|cite|improve this question









$endgroup$




I am doing PCA analysis on a large amount of data and I need to compute the eigen-decomposition of the covariance matrix which is a real, symmetric, positive semi definite matrix. It doesn't get any simpler than that!



I want to compute this myself from first principles and not using some matlab, mathematica or whatever package. That's an infinite process but I am looking for a fast and robust method. Can anyone post an algorithm for it? I did a web search and found several methods but nothing complete and from scratch.



Please help, thanks in advance.







linear-algebra matrices eigenvalues-eigenvectors linear-transformations singularvalues






share|cite|improve this question













share|cite|improve this question











share|cite|improve this question




share|cite|improve this question










asked Dec 4 '18 at 9:17









plus1plus1

4111




4111












  • $begingroup$
    You will find answer to it and many others in a best seller, very often cited in scientific papers: "Matrix Computations" by Golub and Van Loan. I know that listing books may lead to an endless dangerous chat, but this book is special ...
    $endgroup$
    – Damien
    Dec 4 '18 at 9:29






  • 1




    $begingroup$
    I want to reinvent a wheel but have no idea what a wheel looks like, can you post one? I'm impressed by your resolute denial of computer codes people worked on for decades, sir.
    $endgroup$
    – Algebraic Pavel
    Dec 4 '18 at 9:40










  • $begingroup$
    @AlgebraicPavel Sometimes, when you are doing research, you are not only interested in the functionality of a program, but you want to deeply understand it. And sometimes, the benefit of such a deep understanding of a given function appear a long time after, in an unexpected way.
    $endgroup$
    – Damien
    Dec 4 '18 at 10:02










  • $begingroup$
    @Damien I understand that what you say might be happening but the question does not give me an impression that this is the case.
    $endgroup$
    – Algebraic Pavel
    Dec 4 '18 at 10:55










  • $begingroup$
    @Damien Thanks! It's quite involved with bidiagonal matrices and so on but it looks like I can't do any better...
    $endgroup$
    – plus1
    Dec 4 '18 at 11:10


















  • $begingroup$
    You will find answer to it and many others in a best seller, very often cited in scientific papers: "Matrix Computations" by Golub and Van Loan. I know that listing books may lead to an endless dangerous chat, but this book is special ...
    $endgroup$
    – Damien
    Dec 4 '18 at 9:29






  • 1




    $begingroup$
    I want to reinvent a wheel but have no idea what a wheel looks like, can you post one? I'm impressed by your resolute denial of computer codes people worked on for decades, sir.
    $endgroup$
    – Algebraic Pavel
    Dec 4 '18 at 9:40










  • $begingroup$
    @AlgebraicPavel Sometimes, when you are doing research, you are not only interested in the functionality of a program, but you want to deeply understand it. And sometimes, the benefit of such a deep understanding of a given function appear a long time after, in an unexpected way.
    $endgroup$
    – Damien
    Dec 4 '18 at 10:02










  • $begingroup$
    @Damien I understand that what you say might be happening but the question does not give me an impression that this is the case.
    $endgroup$
    – Algebraic Pavel
    Dec 4 '18 at 10:55










  • $begingroup$
    @Damien Thanks! It's quite involved with bidiagonal matrices and so on but it looks like I can't do any better...
    $endgroup$
    – plus1
    Dec 4 '18 at 11:10
















$begingroup$
You will find answer to it and many others in a best seller, very often cited in scientific papers: "Matrix Computations" by Golub and Van Loan. I know that listing books may lead to an endless dangerous chat, but this book is special ...
$endgroup$
– Damien
Dec 4 '18 at 9:29




$begingroup$
You will find answer to it and many others in a best seller, very often cited in scientific papers: "Matrix Computations" by Golub and Van Loan. I know that listing books may lead to an endless dangerous chat, but this book is special ...
$endgroup$
– Damien
Dec 4 '18 at 9:29




1




1




$begingroup$
I want to reinvent a wheel but have no idea what a wheel looks like, can you post one? I'm impressed by your resolute denial of computer codes people worked on for decades, sir.
$endgroup$
– Algebraic Pavel
Dec 4 '18 at 9:40




$begingroup$
I want to reinvent a wheel but have no idea what a wheel looks like, can you post one? I'm impressed by your resolute denial of computer codes people worked on for decades, sir.
$endgroup$
– Algebraic Pavel
Dec 4 '18 at 9:40












$begingroup$
@AlgebraicPavel Sometimes, when you are doing research, you are not only interested in the functionality of a program, but you want to deeply understand it. And sometimes, the benefit of such a deep understanding of a given function appear a long time after, in an unexpected way.
$endgroup$
– Damien
Dec 4 '18 at 10:02




$begingroup$
@AlgebraicPavel Sometimes, when you are doing research, you are not only interested in the functionality of a program, but you want to deeply understand it. And sometimes, the benefit of such a deep understanding of a given function appear a long time after, in an unexpected way.
$endgroup$
– Damien
Dec 4 '18 at 10:02












$begingroup$
@Damien I understand that what you say might be happening but the question does not give me an impression that this is the case.
$endgroup$
– Algebraic Pavel
Dec 4 '18 at 10:55




$begingroup$
@Damien I understand that what you say might be happening but the question does not give me an impression that this is the case.
$endgroup$
– Algebraic Pavel
Dec 4 '18 at 10:55












$begingroup$
@Damien Thanks! It's quite involved with bidiagonal matrices and so on but it looks like I can't do any better...
$endgroup$
– plus1
Dec 4 '18 at 11:10




$begingroup$
@Damien Thanks! It's quite involved with bidiagonal matrices and so on but it looks like I can't do any better...
$endgroup$
– plus1
Dec 4 '18 at 11:10










0






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


}
});














draft saved

draft discarded


















StackExchange.ready(
function () {
StackExchange.openid.initPostLogin('.new-post-login', 'https%3a%2f%2fmath.stackexchange.com%2fquestions%2f3025332%2feigen-decomposition-of-real-symmetric-psd-matrix%23new-answer', 'question_page');
}
);

Post as a guest















Required, but never shown

























0






active

oldest

votes








0






active

oldest

votes









active

oldest

votes






active

oldest

votes
















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.




draft saved


draft discarded














StackExchange.ready(
function () {
StackExchange.openid.initPostLogin('.new-post-login', 'https%3a%2f%2fmath.stackexchange.com%2fquestions%2f3025332%2feigen-decomposition-of-real-symmetric-psd-matrix%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

Aardman Animations

Are they similar matrix

“minimization” problem in Euclidean space related to orthonormal basis