Baars, S. (2011) Performance analysis of the CORS and BiCOR iterative methods for solving nonsymmetric sparse linear systems. Bachelor's Thesis, Mathematics.
|
Text
Baars_Sven_BW_2011.pdf - Published Version Download (1MB) | Preview |
|
![[img]](https://fse.studenttheses.ub.rug.nl/style/images/fileicons/text.png) |
Text
AkkoordCarpentieri.pdf - Other Restricted to Registered users only Download (52kB) |
Abstract
Recently, the iterative methods BiCOR and CORS for solving real nonsymmetric (or complex non-Hermitian), and possibly indenite sparse linear systems were developed. There is not much known yet about the performance of those methods. We consider iterative methods in general, and go more into detail about CORS and BiCOR. We analyse the performance of BiCOR and CORS by comparing them to seven popular solvers on a large set of publicly available matrices coming from different areas of application. We use different qualities of preconditioners to do this. In our experiments we observe that CORS is a highly competitive solver compared to other popular solvers, like GMRES and BiCGSTAB.
| Item Type: | Thesis (Bachelor's Thesis) |
|---|---|
| Degree programme: | Mathematics |
| Thesis type: | Bachelor's Thesis |
| Language: | English |
| Date Deposited: | 15 Feb 2018 07:47 |
| Last Modified: | 15 Feb 2018 07:47 |
| URI: | https://fse.studenttheses.ub.rug.nl/id/eprint/9892 |
Actions (login required)
 |
View Item |