Abstract
This paper is concerned with a generalization of the Hermitian and skew-Hermitian splitting (HSS) iteration method for solving large sparse continuous Sylvester equations. The analysis shows that the GHSS iteration method will converge under certain assumptions. Numerical results show that this new method is more efficient and robust than the existing ones.
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.
