If there a relationship between a submatrix's eigenvalues and the matrix's eigenvalues.











up vote
0
down vote

favorite












My question




Let $A$ be a $n times n$ matrix. We denote the submatrix whose entries are ${a_{ij}}in A$ where $i=2,...,n$ and $j=2,...,n$ as $A_{n-1}$.



Suppose we know the eigenvalues of $A_{n-1}$. Does there exist a relationship between the eigenvalues of the matrix $A$ and the eigenvalues of the submatrix $A_{n-1}$?




Context



I am trying to do linear analysis on a system of $n$ ODEs an equilibrium point. The Jacobin of the system has the following structure
begin{align}
J&=begin{pmatrix}
-1 & a_{12} & dots & a_{1n} \
a_{21} & \
vdots & &A_{n-1}\
a_{n1} &
end{pmatrix}
end{align}

where $A_{n-1}$ is an $n-1 times n-1$ matrix whose eigenvalues I know from another unrelated method. The entries $a_{12},...,a_{1n}geq 0$ while entries $a_{21},...,a_{n1}leq 0$, note these entries are functions ans vary in value based on the equilibrium point the Jacobian is evaluated at.



Notes




  • I suspect that the answer to my question is that there is an upper bound for the eigenvalues of $A$. I haven't found anything that supports this suspicion.

  • I provide additional context to assist those answering the question, you can feel free to ignore the context if you can answer the original question.

  • If any clarification is needed feel free to ask.










share|cite|improve this question


























    up vote
    0
    down vote

    favorite












    My question




    Let $A$ be a $n times n$ matrix. We denote the submatrix whose entries are ${a_{ij}}in A$ where $i=2,...,n$ and $j=2,...,n$ as $A_{n-1}$.



    Suppose we know the eigenvalues of $A_{n-1}$. Does there exist a relationship between the eigenvalues of the matrix $A$ and the eigenvalues of the submatrix $A_{n-1}$?




    Context



    I am trying to do linear analysis on a system of $n$ ODEs an equilibrium point. The Jacobin of the system has the following structure
    begin{align}
    J&=begin{pmatrix}
    -1 & a_{12} & dots & a_{1n} \
    a_{21} & \
    vdots & &A_{n-1}\
    a_{n1} &
    end{pmatrix}
    end{align}

    where $A_{n-1}$ is an $n-1 times n-1$ matrix whose eigenvalues I know from another unrelated method. The entries $a_{12},...,a_{1n}geq 0$ while entries $a_{21},...,a_{n1}leq 0$, note these entries are functions ans vary in value based on the equilibrium point the Jacobian is evaluated at.



    Notes




    • I suspect that the answer to my question is that there is an upper bound for the eigenvalues of $A$. I haven't found anything that supports this suspicion.

    • I provide additional context to assist those answering the question, you can feel free to ignore the context if you can answer the original question.

    • If any clarification is needed feel free to ask.










    share|cite|improve this question
























      up vote
      0
      down vote

      favorite









      up vote
      0
      down vote

      favorite











      My question




      Let $A$ be a $n times n$ matrix. We denote the submatrix whose entries are ${a_{ij}}in A$ where $i=2,...,n$ and $j=2,...,n$ as $A_{n-1}$.



      Suppose we know the eigenvalues of $A_{n-1}$. Does there exist a relationship between the eigenvalues of the matrix $A$ and the eigenvalues of the submatrix $A_{n-1}$?




      Context



      I am trying to do linear analysis on a system of $n$ ODEs an equilibrium point. The Jacobin of the system has the following structure
      begin{align}
      J&=begin{pmatrix}
      -1 & a_{12} & dots & a_{1n} \
      a_{21} & \
      vdots & &A_{n-1}\
      a_{n1} &
      end{pmatrix}
      end{align}

      where $A_{n-1}$ is an $n-1 times n-1$ matrix whose eigenvalues I know from another unrelated method. The entries $a_{12},...,a_{1n}geq 0$ while entries $a_{21},...,a_{n1}leq 0$, note these entries are functions ans vary in value based on the equilibrium point the Jacobian is evaluated at.



      Notes




      • I suspect that the answer to my question is that there is an upper bound for the eigenvalues of $A$. I haven't found anything that supports this suspicion.

      • I provide additional context to assist those answering the question, you can feel free to ignore the context if you can answer the original question.

      • If any clarification is needed feel free to ask.










      share|cite|improve this question













      My question




      Let $A$ be a $n times n$ matrix. We denote the submatrix whose entries are ${a_{ij}}in A$ where $i=2,...,n$ and $j=2,...,n$ as $A_{n-1}$.



      Suppose we know the eigenvalues of $A_{n-1}$. Does there exist a relationship between the eigenvalues of the matrix $A$ and the eigenvalues of the submatrix $A_{n-1}$?




      Context



      I am trying to do linear analysis on a system of $n$ ODEs an equilibrium point. The Jacobin of the system has the following structure
      begin{align}
      J&=begin{pmatrix}
      -1 & a_{12} & dots & a_{1n} \
      a_{21} & \
      vdots & &A_{n-1}\
      a_{n1} &
      end{pmatrix}
      end{align}

      where $A_{n-1}$ is an $n-1 times n-1$ matrix whose eigenvalues I know from another unrelated method. The entries $a_{12},...,a_{1n}geq 0$ while entries $a_{21},...,a_{n1}leq 0$, note these entries are functions ans vary in value based on the equilibrium point the Jacobian is evaluated at.



      Notes




      • I suspect that the answer to my question is that there is an upper bound for the eigenvalues of $A$. I haven't found anything that supports this suspicion.

      • I provide additional context to assist those answering the question, you can feel free to ignore the context if you can answer the original question.

      • If any clarification is needed feel free to ask.







      matrices eigenvalues-eigenvectors jacobian






      share|cite|improve this question













      share|cite|improve this question











      share|cite|improve this question




      share|cite|improve this question










      asked 2 days ago









      AzJ

      274118




      274118






















          2 Answers
          2






          active

          oldest

          votes

















          up vote
          1
          down vote



          accepted










          There is an answer to your question for symmetric matrices : the eigenvalues $lambda_k$ of $A_{n-1}$ and $mu_j$ of $A_n$ are interleaved :



          $$mu_1 leq lambda_1 leq mu_2 leq ... leq lambda_{n-1} leq mu_n$$



          This is a theorem established by Cauchy in the 1830s.



          See {Eigen values of a principal sub-matrix of a symmetric matrix}



          For non-symmetric matrices, there is no general result like this one.






          share|cite|improve this answer




























            up vote
            2
            down vote













            The only eigenvalue if $[0]$ is, of course, $0$. However, the eigenvalues ofbegin{bmatrix}-1&x\x&0end{bmatrix}are $dfrac{-1pmsqrt{1+4x^2}}2$, which can be arbitrarily large.






            share|cite|improve this answer





















              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',
              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%2f3005440%2fif-there-a-relationship-between-a-submatrixs-eigenvalues-and-the-matrixs-eigen%23new-answer', 'question_page');
              }
              );

              Post as a guest















              Required, but never shown

























              2 Answers
              2






              active

              oldest

              votes








              2 Answers
              2






              active

              oldest

              votes









              active

              oldest

              votes






              active

              oldest

              votes








              up vote
              1
              down vote



              accepted










              There is an answer to your question for symmetric matrices : the eigenvalues $lambda_k$ of $A_{n-1}$ and $mu_j$ of $A_n$ are interleaved :



              $$mu_1 leq lambda_1 leq mu_2 leq ... leq lambda_{n-1} leq mu_n$$



              This is a theorem established by Cauchy in the 1830s.



              See {Eigen values of a principal sub-matrix of a symmetric matrix}



              For non-symmetric matrices, there is no general result like this one.






              share|cite|improve this answer

























                up vote
                1
                down vote



                accepted










                There is an answer to your question for symmetric matrices : the eigenvalues $lambda_k$ of $A_{n-1}$ and $mu_j$ of $A_n$ are interleaved :



                $$mu_1 leq lambda_1 leq mu_2 leq ... leq lambda_{n-1} leq mu_n$$



                This is a theorem established by Cauchy in the 1830s.



                See {Eigen values of a principal sub-matrix of a symmetric matrix}



                For non-symmetric matrices, there is no general result like this one.






                share|cite|improve this answer























                  up vote
                  1
                  down vote



                  accepted







                  up vote
                  1
                  down vote



                  accepted






                  There is an answer to your question for symmetric matrices : the eigenvalues $lambda_k$ of $A_{n-1}$ and $mu_j$ of $A_n$ are interleaved :



                  $$mu_1 leq lambda_1 leq mu_2 leq ... leq lambda_{n-1} leq mu_n$$



                  This is a theorem established by Cauchy in the 1830s.



                  See {Eigen values of a principal sub-matrix of a symmetric matrix}



                  For non-symmetric matrices, there is no general result like this one.






                  share|cite|improve this answer












                  There is an answer to your question for symmetric matrices : the eigenvalues $lambda_k$ of $A_{n-1}$ and $mu_j$ of $A_n$ are interleaved :



                  $$mu_1 leq lambda_1 leq mu_2 leq ... leq lambda_{n-1} leq mu_n$$



                  This is a theorem established by Cauchy in the 1830s.



                  See {Eigen values of a principal sub-matrix of a symmetric matrix}



                  For non-symmetric matrices, there is no general result like this one.







                  share|cite|improve this answer












                  share|cite|improve this answer



                  share|cite|improve this answer










                  answered 2 days ago









                  Jean Marie

                  28.1k41848




                  28.1k41848






















                      up vote
                      2
                      down vote













                      The only eigenvalue if $[0]$ is, of course, $0$. However, the eigenvalues ofbegin{bmatrix}-1&x\x&0end{bmatrix}are $dfrac{-1pmsqrt{1+4x^2}}2$, which can be arbitrarily large.






                      share|cite|improve this answer

























                        up vote
                        2
                        down vote













                        The only eigenvalue if $[0]$ is, of course, $0$. However, the eigenvalues ofbegin{bmatrix}-1&x\x&0end{bmatrix}are $dfrac{-1pmsqrt{1+4x^2}}2$, which can be arbitrarily large.






                        share|cite|improve this answer























                          up vote
                          2
                          down vote










                          up vote
                          2
                          down vote









                          The only eigenvalue if $[0]$ is, of course, $0$. However, the eigenvalues ofbegin{bmatrix}-1&x\x&0end{bmatrix}are $dfrac{-1pmsqrt{1+4x^2}}2$, which can be arbitrarily large.






                          share|cite|improve this answer












                          The only eigenvalue if $[0]$ is, of course, $0$. However, the eigenvalues ofbegin{bmatrix}-1&x\x&0end{bmatrix}are $dfrac{-1pmsqrt{1+4x^2}}2$, which can be arbitrarily large.







                          share|cite|improve this answer












                          share|cite|improve this answer



                          share|cite|improve this answer










                          answered 2 days ago









                          José Carlos Santos

                          140k18111204




                          140k18111204






























                               

                              draft saved


                              draft discarded



















































                               


                              draft saved


                              draft discarded














                              StackExchange.ready(
                              function () {
                              StackExchange.openid.initPostLogin('.new-post-login', 'https%3a%2f%2fmath.stackexchange.com%2fquestions%2f3005440%2fif-there-a-relationship-between-a-submatrixs-eigenvalues-and-the-matrixs-eigen%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

                              MongoDB - Not Authorized To Execute Command

                              Npm cannot find a required file even through it is in the searched directory

                              in spring boot 2.1 many test slices are not allowed anymore due to multiple @BootstrapWith