Abstract
A preconditioned iterative method for computing a few eigenpairs of large sparse symmetric matrices is discussed in this paper. The application of the preconditioning technique to the subspace iteration method i.e. the preconditioning subspace iteration is studied in order to accelerate the convergence rate, and the corresponding analysis of convergence is presented. The analysis of the theory and the results of the numerical example show that the accelerated subspace iteration method with preconditioning techniques is more effective than the original subspace iteration method. And it decreases the computation cost and computation time.
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.
