Create a symmetric positive definite matrix (but not diagonal) with eigenvalues 1, 2, 4 - how to approach this problem?linear transformation of real symmetric square positive semi-definite matrixHow is the normalized trace defined?How to construct a $4 times 4$ symmetric, positive definite matrix with integer eigenvaluesProve that determinant of a 2x2 symmetric positive definite matrix is positive by “completing the square” method.Eigenvalues of [symmetric] matrix A whose product $AA$ is diagonalHow can I find two symmetric positive definite roots of a symmetric positive definite matrix?Numerically determine eigenvalues of real non-symmetric matrix known to have positive eigenvalues$LDL^top$ for symmetric positive semidefinite matrices that are not positive definiteI know symmetric matrix $S = QDQ^T$, but how can matrices with form ADA be symmetric?Show that $ S( a times b) +(Sa) times b + a times (Sb) =0 $

Are there any medieval light sources without fire?

How can a dictatorship government be beneficial to a dictator in a post-scarcity society?

What is the measurable difference between dry basil and fresh?

Would a non-attacking Barbarian's rage end the same turn he started it?

Should disabled buttons give feedback when clicked?

Does Multiverse exist in MCU?

Indesign - how to change the style of the page numbers?

How are mathematicians paid to do research?

Are there any balance issues in allowing two half-feats to be taken without the Ability Score Increase instead of a feat?

How can I effectively communicate to recruiters that a phone call is not possible?

Do I have a right to cancel a purchase of foreign currency in the UK?

What happens to unproductive professors?

Why does this potentiometer in an op-amp feedback path cause noise when adjusted?

Is there any word for "disobedience to God"?

Is it possible to create a craft with specific bones, like the bones of a forgotten beast?

How to tell someone I'd like to become friends without letting them think I'm romantically interested in them?

Why was hardware diversification an asset for the IBM PC ecosystem?

The tensor product of two monoidal categories

Why do we need common sense in AI?

Why do people keep referring to Leia as Princess Leia, even after the destruction of Alderaan?

Single word for "refusing to move to next activity unless present one is completed."

Is English unusual in having no second person plural form?

How to deal with moral/legal subjects in writing?

How would vampires avoid contracting diseases?



Create a symmetric positive definite matrix (but not diagonal) with eigenvalues 1, 2, 4 - how to approach this problem?


linear transformation of real symmetric square positive semi-definite matrixHow is the normalized trace defined?How to construct a $4 times 4$ symmetric, positive definite matrix with integer eigenvaluesProve that determinant of a 2x2 symmetric positive definite matrix is positive by “completing the square” method.Eigenvalues of [symmetric] matrix A whose product $AA$ is diagonalHow can I find two symmetric positive definite roots of a symmetric positive definite matrix?Numerically determine eigenvalues of real non-symmetric matrix known to have positive eigenvalues$LDL^top$ for symmetric positive semidefinite matrices that are not positive definiteI know symmetric matrix $S = QDQ^T$, but how can matrices with form ADA be symmetric?Show that $ S( a times b) +(Sa) times b + a times (Sb) =0 $






.everyoneloves__top-leaderboard:empty,.everyoneloves__mid-leaderboard:empty,.everyoneloves__bot-mid-leaderboard:empty margin-bottom:0;








1












$begingroup$


Trace of the matrix is obviously 7 and determinant 8, a 3x3 matrix should be easiest to construct, but where to go from here?Any brute force method simply won't work.










share|cite|improve this question











$endgroup$


















    1












    $begingroup$


    Trace of the matrix is obviously 7 and determinant 8, a 3x3 matrix should be easiest to construct, but where to go from here?Any brute force method simply won't work.










    share|cite|improve this question











    $endgroup$














      1












      1








      1





      $begingroup$


      Trace of the matrix is obviously 7 and determinant 8, a 3x3 matrix should be easiest to construct, but where to go from here?Any brute force method simply won't work.










      share|cite|improve this question











      $endgroup$




      Trace of the matrix is obviously 7 and determinant 8, a 3x3 matrix should be easiest to construct, but where to go from here?Any brute force method simply won't work.







      linear-algebra symmetric-matrices






      share|cite|improve this question















      share|cite|improve this question













      share|cite|improve this question




      share|cite|improve this question








      edited 8 hours ago









      José Carlos Santos

      198k25 gold badges157 silver badges275 bronze badges




      198k25 gold badges157 silver badges275 bronze badges










      asked 8 hours ago









      user3711671user3711671

      808 bronze badges




      808 bronze badges




















          3 Answers
          3






          active

          oldest

          votes


















          6












          $begingroup$

          Hint: Choose an appropriate orthogonal matrix $M$ and take$$M^T.beginbmatrix1&0&0\0&2&0\0&0&4endbmatrix.M.$$






          share|cite|improve this answer









          $endgroup$












          • $begingroup$
            How does one construct a random orthogonal matrix?
            $endgroup$
            – user3711671
            8 hours ago






          • 1




            $begingroup$
            Take a vector $u$ with norm $1$. Then a vector $v$ orthogonal to $u$, also with norm $1$. Now, take the matrix $M$ such that the entries of its first column are the coordinates of $u$, the entries of its second column are the coordinates of $v$, and the entries of its third column are the coordinates of $utimes v$.
            $endgroup$
            – José Carlos Santos
            8 hours ago










          • $begingroup$
            Why does that method work?
            $endgroup$
            – user3711671
            8 hours ago










          • $begingroup$
            Because then the columns of your matrix will be vectors with norm $1$ which will be orthogonal to each other. And a matrix is orthogonal if and only if this condition holds.
            $endgroup$
            – José Carlos Santos
            8 hours ago


















          6












          $begingroup$

          Why not pick any orthogonal transformation matrix $P$ and easily construct its inverse $P^T = P^-1$, with your matrix being $A = PDP^T$, where $D$ is the diagonal matrix of eigenvalues?






          share|cite|improve this answer









          $endgroup$












          • $begingroup$
            What is orthogonal transformation matrix?How do you construct such random matrix?
            $endgroup$
            – user3711671
            8 hours ago










          • $begingroup$
            @user3711671 Why not Google it or use Wikipedia?
            $endgroup$
            – gt6989b
            8 hours ago


















          3












          $begingroup$

          You can try with this block-diagonal matrix:



          $$beginbmatrix frac32 & -frac12 & 0 \ -frac12 & frac32 & 0 \ 0 & 0 & 4endbmatrix$$






          share|cite|improve this answer









          $endgroup$















            Your Answer








            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%2f3288040%2fcreate-a-symmetric-positive-definite-matrix-but-not-diagonal-with-eigenvalues%23new-answer', 'question_page');

            );

            Post as a guest















            Required, but never shown

























            3 Answers
            3






            active

            oldest

            votes








            3 Answers
            3






            active

            oldest

            votes









            active

            oldest

            votes






            active

            oldest

            votes









            6












            $begingroup$

            Hint: Choose an appropriate orthogonal matrix $M$ and take$$M^T.beginbmatrix1&0&0\0&2&0\0&0&4endbmatrix.M.$$






            share|cite|improve this answer









            $endgroup$












            • $begingroup$
              How does one construct a random orthogonal matrix?
              $endgroup$
              – user3711671
              8 hours ago






            • 1




              $begingroup$
              Take a vector $u$ with norm $1$. Then a vector $v$ orthogonal to $u$, also with norm $1$. Now, take the matrix $M$ such that the entries of its first column are the coordinates of $u$, the entries of its second column are the coordinates of $v$, and the entries of its third column are the coordinates of $utimes v$.
              $endgroup$
              – José Carlos Santos
              8 hours ago










            • $begingroup$
              Why does that method work?
              $endgroup$
              – user3711671
              8 hours ago










            • $begingroup$
              Because then the columns of your matrix will be vectors with norm $1$ which will be orthogonal to each other. And a matrix is orthogonal if and only if this condition holds.
              $endgroup$
              – José Carlos Santos
              8 hours ago















            6












            $begingroup$

            Hint: Choose an appropriate orthogonal matrix $M$ and take$$M^T.beginbmatrix1&0&0\0&2&0\0&0&4endbmatrix.M.$$






            share|cite|improve this answer









            $endgroup$












            • $begingroup$
              How does one construct a random orthogonal matrix?
              $endgroup$
              – user3711671
              8 hours ago






            • 1




              $begingroup$
              Take a vector $u$ with norm $1$. Then a vector $v$ orthogonal to $u$, also with norm $1$. Now, take the matrix $M$ such that the entries of its first column are the coordinates of $u$, the entries of its second column are the coordinates of $v$, and the entries of its third column are the coordinates of $utimes v$.
              $endgroup$
              – José Carlos Santos
              8 hours ago










            • $begingroup$
              Why does that method work?
              $endgroup$
              – user3711671
              8 hours ago










            • $begingroup$
              Because then the columns of your matrix will be vectors with norm $1$ which will be orthogonal to each other. And a matrix is orthogonal if and only if this condition holds.
              $endgroup$
              – José Carlos Santos
              8 hours ago













            6












            6








            6





            $begingroup$

            Hint: Choose an appropriate orthogonal matrix $M$ and take$$M^T.beginbmatrix1&0&0\0&2&0\0&0&4endbmatrix.M.$$






            share|cite|improve this answer









            $endgroup$



            Hint: Choose an appropriate orthogonal matrix $M$ and take$$M^T.beginbmatrix1&0&0\0&2&0\0&0&4endbmatrix.M.$$







            share|cite|improve this answer












            share|cite|improve this answer



            share|cite|improve this answer










            answered 8 hours ago









            José Carlos SantosJosé Carlos Santos

            198k25 gold badges157 silver badges275 bronze badges




            198k25 gold badges157 silver badges275 bronze badges











            • $begingroup$
              How does one construct a random orthogonal matrix?
              $endgroup$
              – user3711671
              8 hours ago






            • 1




              $begingroup$
              Take a vector $u$ with norm $1$. Then a vector $v$ orthogonal to $u$, also with norm $1$. Now, take the matrix $M$ such that the entries of its first column are the coordinates of $u$, the entries of its second column are the coordinates of $v$, and the entries of its third column are the coordinates of $utimes v$.
              $endgroup$
              – José Carlos Santos
              8 hours ago










            • $begingroup$
              Why does that method work?
              $endgroup$
              – user3711671
              8 hours ago










            • $begingroup$
              Because then the columns of your matrix will be vectors with norm $1$ which will be orthogonal to each other. And a matrix is orthogonal if and only if this condition holds.
              $endgroup$
              – José Carlos Santos
              8 hours ago
















            • $begingroup$
              How does one construct a random orthogonal matrix?
              $endgroup$
              – user3711671
              8 hours ago






            • 1




              $begingroup$
              Take a vector $u$ with norm $1$. Then a vector $v$ orthogonal to $u$, also with norm $1$. Now, take the matrix $M$ such that the entries of its first column are the coordinates of $u$, the entries of its second column are the coordinates of $v$, and the entries of its third column are the coordinates of $utimes v$.
              $endgroup$
              – José Carlos Santos
              8 hours ago










            • $begingroup$
              Why does that method work?
              $endgroup$
              – user3711671
              8 hours ago










            • $begingroup$
              Because then the columns of your matrix will be vectors with norm $1$ which will be orthogonal to each other. And a matrix is orthogonal if and only if this condition holds.
              $endgroup$
              – José Carlos Santos
              8 hours ago















            $begingroup$
            How does one construct a random orthogonal matrix?
            $endgroup$
            – user3711671
            8 hours ago




            $begingroup$
            How does one construct a random orthogonal matrix?
            $endgroup$
            – user3711671
            8 hours ago




            1




            1




            $begingroup$
            Take a vector $u$ with norm $1$. Then a vector $v$ orthogonal to $u$, also with norm $1$. Now, take the matrix $M$ such that the entries of its first column are the coordinates of $u$, the entries of its second column are the coordinates of $v$, and the entries of its third column are the coordinates of $utimes v$.
            $endgroup$
            – José Carlos Santos
            8 hours ago




            $begingroup$
            Take a vector $u$ with norm $1$. Then a vector $v$ orthogonal to $u$, also with norm $1$. Now, take the matrix $M$ such that the entries of its first column are the coordinates of $u$, the entries of its second column are the coordinates of $v$, and the entries of its third column are the coordinates of $utimes v$.
            $endgroup$
            – José Carlos Santos
            8 hours ago












            $begingroup$
            Why does that method work?
            $endgroup$
            – user3711671
            8 hours ago




            $begingroup$
            Why does that method work?
            $endgroup$
            – user3711671
            8 hours ago












            $begingroup$
            Because then the columns of your matrix will be vectors with norm $1$ which will be orthogonal to each other. And a matrix is orthogonal if and only if this condition holds.
            $endgroup$
            – José Carlos Santos
            8 hours ago




            $begingroup$
            Because then the columns of your matrix will be vectors with norm $1$ which will be orthogonal to each other. And a matrix is orthogonal if and only if this condition holds.
            $endgroup$
            – José Carlos Santos
            8 hours ago













            6












            $begingroup$

            Why not pick any orthogonal transformation matrix $P$ and easily construct its inverse $P^T = P^-1$, with your matrix being $A = PDP^T$, where $D$ is the diagonal matrix of eigenvalues?






            share|cite|improve this answer









            $endgroup$












            • $begingroup$
              What is orthogonal transformation matrix?How do you construct such random matrix?
              $endgroup$
              – user3711671
              8 hours ago










            • $begingroup$
              @user3711671 Why not Google it or use Wikipedia?
              $endgroup$
              – gt6989b
              8 hours ago















            6












            $begingroup$

            Why not pick any orthogonal transformation matrix $P$ and easily construct its inverse $P^T = P^-1$, with your matrix being $A = PDP^T$, where $D$ is the diagonal matrix of eigenvalues?






            share|cite|improve this answer









            $endgroup$












            • $begingroup$
              What is orthogonal transformation matrix?How do you construct such random matrix?
              $endgroup$
              – user3711671
              8 hours ago










            • $begingroup$
              @user3711671 Why not Google it or use Wikipedia?
              $endgroup$
              – gt6989b
              8 hours ago













            6












            6








            6





            $begingroup$

            Why not pick any orthogonal transformation matrix $P$ and easily construct its inverse $P^T = P^-1$, with your matrix being $A = PDP^T$, where $D$ is the diagonal matrix of eigenvalues?






            share|cite|improve this answer









            $endgroup$



            Why not pick any orthogonal transformation matrix $P$ and easily construct its inverse $P^T = P^-1$, with your matrix being $A = PDP^T$, where $D$ is the diagonal matrix of eigenvalues?







            share|cite|improve this answer












            share|cite|improve this answer



            share|cite|improve this answer










            answered 8 hours ago









            gt6989bgt6989b

            38.3k2 gold badges25 silver badges57 bronze badges




            38.3k2 gold badges25 silver badges57 bronze badges











            • $begingroup$
              What is orthogonal transformation matrix?How do you construct such random matrix?
              $endgroup$
              – user3711671
              8 hours ago










            • $begingroup$
              @user3711671 Why not Google it or use Wikipedia?
              $endgroup$
              – gt6989b
              8 hours ago
















            • $begingroup$
              What is orthogonal transformation matrix?How do you construct such random matrix?
              $endgroup$
              – user3711671
              8 hours ago










            • $begingroup$
              @user3711671 Why not Google it or use Wikipedia?
              $endgroup$
              – gt6989b
              8 hours ago















            $begingroup$
            What is orthogonal transformation matrix?How do you construct such random matrix?
            $endgroup$
            – user3711671
            8 hours ago




            $begingroup$
            What is orthogonal transformation matrix?How do you construct such random matrix?
            $endgroup$
            – user3711671
            8 hours ago












            $begingroup$
            @user3711671 Why not Google it or use Wikipedia?
            $endgroup$
            – gt6989b
            8 hours ago




            $begingroup$
            @user3711671 Why not Google it or use Wikipedia?
            $endgroup$
            – gt6989b
            8 hours ago











            3












            $begingroup$

            You can try with this block-diagonal matrix:



            $$beginbmatrix frac32 & -frac12 & 0 \ -frac12 & frac32 & 0 \ 0 & 0 & 4endbmatrix$$






            share|cite|improve this answer









            $endgroup$

















              3












              $begingroup$

              You can try with this block-diagonal matrix:



              $$beginbmatrix frac32 & -frac12 & 0 \ -frac12 & frac32 & 0 \ 0 & 0 & 4endbmatrix$$






              share|cite|improve this answer









              $endgroup$















                3












                3








                3





                $begingroup$

                You can try with this block-diagonal matrix:



                $$beginbmatrix frac32 & -frac12 & 0 \ -frac12 & frac32 & 0 \ 0 & 0 & 4endbmatrix$$






                share|cite|improve this answer









                $endgroup$



                You can try with this block-diagonal matrix:



                $$beginbmatrix frac32 & -frac12 & 0 \ -frac12 & frac32 & 0 \ 0 & 0 & 4endbmatrix$$







                share|cite|improve this answer












                share|cite|improve this answer



                share|cite|improve this answer










                answered 8 hours ago









                mechanodroidmechanodroid

                30.3k6 gold badges27 silver badges48 bronze badges




                30.3k6 gold badges27 silver badges48 bronze badges



























                    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%2f3288040%2fcreate-a-symmetric-positive-definite-matrix-but-not-diagonal-with-eigenvalues%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

                    Invision Community Contents History See also References External links Navigation menuProprietaryinvisioncommunity.comIPS Community ForumsIPS Community Forumsthis blog entry"License Changes, IP.Board 3.4, and the Future""Interview -- Matt Mecham of Ibforums""CEO Invision Power Board, Matt Mecham Is a Liar, Thief!"IPB License Explanation 1.3, 1.3.1, 2.0, and 2.1ArchivedSecurity Fixes, Updates And Enhancements For IPB 1.3.1Archived"New Demo Accounts - Invision Power Services"the original"New Default Skin"the original"Invision Power Board 3.0.0 and Applications Released"the original"Archived copy"the original"Perpetual licenses being done away with""Release Notes - Invision Power Services""Introducing: IPS Community Suite 4!"Invision Community Release Notes

                    Canceling a color specificationRandomly assigning color to Graphics3D objects?Default color for Filling in Mathematica 9Coloring specific elements of sets with a prime modified order in an array plotHow to pick a color differing significantly from the colors already in a given color list?Detection of the text colorColor numbers based on their valueCan color schemes for use with ColorData include opacity specification?My dynamic color schemes

                    Ласкавець круглолистий Зміст Опис | Поширення | Галерея | Примітки | Посилання | Навігаційне меню58171138361-22960890446Bupleurum rotundifoliumEuro+Med PlantbasePlants of the World Online — Kew ScienceGermplasm Resources Information Network (GRIN)Ласкавецькн. VI : Літери Ком — Левиправивши або дописавши її