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.
To submit an update or takedown request for this paper, please submit an Update/Correction/Removal Request.