Abstract
Complex linear equation systems appear in many branches of mathematical sciences and have many applications in science and engineering. Therefore, there have been developed many methods to solve them. Here a new method based on decomposition of coefficient matrix for the solution of a positive symmetric linear system is studied. Our method uses two parameters. We obtain a domain on which this new method converges without any condition. We will also discuss how to calculate optimal parameters. Moreover we will prove that there exists a region in R2 such that DPS method is faster than CRI method (Wang et al. (2017) [48]). Finally some test problems will be given and simulation results will be reported to support the theoretical results.
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.
