Abstract
Application of direct iterations, based on convergent splittings, to the eigenvalue problem of large sparse symmetric matrices is discussed. A general convergence proof is given, and it is shown how parameters should be chosen to give the best rate of convergence. As special examples are considered, SOR iteration and iteration based on the use of a fast direct Poisson solver. Numerical tests are reported.
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.
