IDEAS home Printed from https://ideas.repec.org/a/eee/matcom/v80y2009i2p387-401.html
   My bibliography  Save this article

A new method for accelerating Arnoldi algorithms for large scale eigenproblems

Author

Listed:
  • Dookhitram, K.
  • Boojhawon, R.
  • Bhuruth, M.

Abstract

We propose a new method for accelerating the convergence of the implicitly restarted Arnoldi (IRA) algorithm for the solution of large sparse nonsymmetric eigenvalue problems. A new relationship between the residual of the current step and the residual in the previous step is derived and we use this relationship to develop a technique for dynamically switching the Krylov subspace dimension at successive cycles. We give numerical results for various difficult nonsymmetric eigenvalue problems that demonstrate the capability of the dynamic switching strategy for significantly accelerating the convergence of Arnoldi algorithms. For some large scale difficult eigenvalue problems that arise in the fields of computational fluid dynamics, electrical engineering and materials science, our strategy leads to significant reductions in the number of matrix–vector products, orthogonalization costs and computational time.

Suggested Citation

  • Dookhitram, K. & Boojhawon, R. & Bhuruth, M., 2009. "A new method for accelerating Arnoldi algorithms for large scale eigenproblems," Mathematics and Computers in Simulation (MATCOM), Elsevier, vol. 80(2), pages 387-401.
    • Handle: RePEc:eee:matcom:v:80:y:2009:i:2:p:387-401
    DOI: 10.1016/j.matcom.2009.07.009
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/S0378475409002353
    Download Restriction: Full text for ScienceDirect subscribers only
    File URL: https://libkey.io/10.1016/j.matcom.2009.07.009?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    As the access to this document is restricted, you may want to search for a different version of it.

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:eee:matcom:v:80:y:2009:i:2:p:387-401. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    We have no bibliographic references for this item. You can help adding them by using this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Catherine Liu (email available below). General contact details of provider: http://www.journals.elsevier.com/mathematics-and-computers-in-simulation/ .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.