Abstract
SummaryThis paper is concerned with a generalization of the Kronecker product splitting (KPS) iteration for solving linear systems arising in implicit Runge–Kutta and boundary value methods discretizations of ordinary differential equations. It is shown that the new scheme can outperform the standard KPS method in some situations and can be used as an effective preconditioner for Krylov subspace methods. Numerical experiments are presented to demonstrate the effectiveness of the methods. Copyright © 2014 John Wiley & Sons, Ltd.
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.
