Skip to main content Accessibility help

We use cookies to distinguish you from other users and to provide you with a better experience on our websites. Close this message to accept cookies or find out how to manage your cookie settings.

Close cookie message
×
  1. Home
  2. Search

Refine search

Refine search

Access:
Content type:
Publication date:
Apply   From and To filters
Subject: Show more
Journals Show more
Publishers: Show more
Societies Show more
Series: Show more
Collections: Show more

Actions for selected content:

Select all | Deselect all
  • View selected items
  • Export citations
  • Download PDF (zip)
  • Save to Kindle
  • Save to Dropbox
  • Save to Google Drive

Save Search

You can save your searches here and later view and run them again in "My saved searches".

Please provide a title, maximum of 40 characters.
Cancel
×

1 results

  • An Inexact Shift-and-Invert Arnoldi Algorithm for Large Non-Hermitian Generalised Toeplitz Eigenproblems

  • Ting-Ting Feng, Gang Wu, Ting-Ting Xu
  • Journal:
    East Asian Journal on Applied Mathematics / Volume 5 / Issue 2 / May 2015
    Published online by Cambridge University Press:
    28 May 2015, pp. 160-175
    Print publication:
    May 2015

  • The shift-and-invert Arnoldi method is a most effective approach to compute a few eigenpairs of a large non-Hermitian Toeplitz matrix pencil, where the Gohberg-Semencul formula can be used to obtain the Toeplitz inverse. However, two large non-Hermitian Toeplitz systems must be solved in the first step of this method, and the cost becomes prohibitive if the desired accuracy for this step is high — especially for some ill-conditioned problems. To overcome this difficulty, we establish a relationship between the errors in solving these systems and the residual of the Toeplitz eigenproblem. We consequently present a practical stopping criterion for their numerical solution, and propose an inexact shift-and-invert Arnoldi algorithm for the generalised Toeplitz eigenproblem. Numerical experiments illustrate our theoretical results and demonstrate the efficiency of the new algorithm.