Abstract
ABLE method can be used to compute eigentriplets of large scale nonsymmetric matrices. However, there is no guarantee for the Ritz vectors obtained by this method to converge even if the subspace is good enough. Furthermore, for the sake of storage limitation and amount of computations, restarting techniques are often needed. In order to deal with these problems, we propose a dynamic thick restarted semi-refined ABLE algorithm (SABLE) in which we use semi-refined Ritz vectors to approximate the desired eigenvectors. The relationship between the novel method and the classical one is given. Theoretical results show that the new method can circumvent the possible danger that exists in the standard one in some degree. Numerical experiments are made on real world problems, and comparisons are drown on the thick restarted ABLE algorithm (TABLE) and the dynamic thick restarted semi-refined ABLE algorithm (SABLE). They show that the latter is often more powerful and attractive than its standard counterpart.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
