Copyright © [2002] by The Society for Industrial and Applied Mathematics. All rights reserved
Many popular iterative algorithms for solving Ax=b, for computing eigenvalues of large matrices A. or for model reduction of large time-invariant, linear systems are based upon Arnoldi or Lanczos recursions.Inthispaper we describe a two-sided Arnoldi recursion, define several iterative algorithms which are based upon this recursion, and demonstrate equivalences between these iterative algorithms and corresponding nonsymmetric Lanczos algorithms.
By: Jane Cullum, Tong Zhang
Published in: SIAM Journal on Matrix Analysis and Applications , volume 24, (no 2), pages 303-19 in 2002
LIMITED DISTRIBUTION NOTICE:
This Research Report is available. This report has been submitted for publication outside of IBM and will probably be copyrighted if accepted for publication. It has been issued as a Research Report for early dissemination of its contents. In view of the transfer of copyright to the outside publisher, its distribution outside of IBM prior to publication should be limited to peer communications and specific requests. After outside publication, requests should be filled only by reprints or legally obtained copies of the article (e.g., payment of royalties). I have read and understand this notice and am a member of the scientific community outside or inside of IBM seeking a single copy only.
Questions about this service can be mailed to reports@us.ibm.com .