<html>
  <head>
    <meta http-equiv="Content-Type" content="text/html; charset=utf-8">
  </head>
  <body text="#000000" bgcolor="#FFFFFF">
    <p>Hello Again,</p>
    <p>Yes I would like to find for the initial 10% and 20% of the
      eigenpairs. But in addition to this,I also want to check for the
      full spectrum.</p>
    <p>So, how shall I proceed with it? <br>
    </p>
    Thank You.<br>
    <br>
    Regards,<br>
    savneet<br>
    <br>
    <div class="moz-cite-prefix">Le 25/04/2018 à 11:33, Matthew Knepley
      a écrit :<br>
    </div>
    <blockquote type="cite"
cite="mid:CAMYG4GnHJfrijY1C7NPdfn7PPdzjK4Bxc-pSnW-7LOoZ3aBdnQ@mail.gmail.com">
      <meta http-equiv="Content-Type" content="text/html; charset=utf-8">
      <div dir="ltr">
        <div class="gmail_extra">
          <div class="gmail_quote">On Wed, Apr 25, 2018 at 5:10 AM,
            Savneet Kaur <span dir="ltr"><<a
                href="mailto:Savneet.KAUR@cea.fr" target="_blank"
                moz-do-not-send="true">Savneet.KAUR@cea.fr</a>></span>
            wrote:<br>
            <blockquote class="gmail_quote" style="margin:0 0 0
              .8ex;border-left:1px #ccc solid;padding-left:1ex">
              <div text="#000000" bgcolor="#FFFFFF">
                <p>Hello,</p>
                <p>Warm Regards<br>
                </p>
                <p>I am Savneet Kaur, a master student at University
                  Paris Saclay and currently pursuing an internship at
                  CEA Saclay (France).</p>
                <p>I have recently started to understand the slepc and
                  petsc solvers, by taking up the tutorials for
                  eigenvalue problems. In my internship work I have to
                  develop a laplacian matrix from a given transition
                  rate matrix and solve it using SLEPC and PETSC and to
                  evaluate the lowest eigenvalue.<br>
                </p>
                <p>I was wondering if I could get some information. I
                  need to diagonalize a 2D Laplacian matrix. And writing
                  a code in C and diagonalizing it is easy. But I am not
                  getting it how to accommodate with the SLEPC Program.
                  Am i suppose to use any packages or it will is done by
                  a loop? Or I need to read some other manual to
                  understand how does it work. Please kindly let me
                  know.</p>
              </div>
            </blockquote>
            <div>I would just like to clarify some terminology.
              "Diagonalize" would usually mean find all eigenvalues and
              eigenvectors.<br>
            </div>
            <div>Is this what you mean? Often, SLEPc users want only a
              portion of the spectrum since the matrices are enormous.</div>
            <div><br>
            </div>
            <div>  Thanks,</div>
            <div><br>
            </div>
            <div>     Matt</div>
            <blockquote class="gmail_quote" style="margin:0 0 0
              .8ex;border-left:1px #ccc solid;padding-left:1ex">
              <div text="#000000" bgcolor="#FFFFFF">
                <p>The diagonalizing a matrix will be preliminary step
                  of my work.</p>
                <p>I will be highly obliged to the the team, if I could
                  get help.</p>
                <p>Hoping for a favorable response from your side.</p>
                <p>Thank you for the time and consideration.</p>
                <p><br>
                </p>
                <p>Sincerely,</p>
                <p><b>Savneet Kaur</b></p>
                <div>
                  <p><b><span
style="font-size:10pt;background-image:initial;background-position:initial;background-repeat:initial">Intern
                        at </span><span style="font-size:10pt">DEN/DANS/DMN/SRMP</span></b></p>
                  <p> </p>
                </div>
                <p> </p>
                <p><b><span style="font-size:10pt">CEA - Centre de
                      Saclay </span><span style="font-size:10pt">ǀ</span><span
                      style="font-size:10pt"> Bâtiment 520<br>
                    </span></b></p>
                <p><span style="font-size:10pt"><b>91191 Gif-sur-Yvette
                      Cedex</b></span></p>
                <p><span style="font-size:10pt"><b>France</b></span></p>
                <p><span style="font-size:10pt"><b>Tel: +33 (0) 666 749
                      000</b></span></p>
                <p><span style="font-size:10pt"><b>Email: <a
                        class="m_-3274466247898941997moz-txt-link-abbreviated"
                        href="mailto:savneet.kaur@cea.fr"
                        target="_blank" moz-do-not-send="true">savneet.kaur@cea.fr</a><br>
                    </b></span></p>
                <p><br>
                </p>
                <p><br>
                </p>
              </div>
            </blockquote>
          </div>
          <br>
          <br clear="all">
          <div><br>
          </div>
          -- <br>
          <div class="gmail_signature" data-smartmail="gmail_signature">
            <div dir="ltr">
              <div>
                <div dir="ltr">
                  <div>What most experimenters take for granted before
                    they begin their experiments is infinitely more
                    interesting than any results to which their
                    experiments lead.<br>
                    -- Norbert Wiener</div>
                  <div><br>
                  </div>
                  <div><a href="http://www.caam.rice.edu/%7Emk51/"
                      target="_blank" moz-do-not-send="true">https://www.cse.buffalo.edu/~knepley/</a><br>
                  </div>
                </div>
              </div>
            </div>
          </div>
        </div>
      </div>
    </blockquote>
    <br>
  </body>
</html>