As a guest user you are not logged in or recognized by your IP address. You have
access to the Front Matter, Abstracts, Author Index, Subject Index and the full
text of Open Access publications.
We are interested in this work by the combination of iterative solvers when solving linear systems of equations in an on-line setting. Our study targets users who may not be able to choose the best solvers for solving a set of linear systems while minimizing the total execution time. We propose a framework and algorithms in which the combination of solvers depends on informations gathered at runtime. The framework is assessed by extensive experiments using 5 SPARSKIT solvers over more than 70 matrices. The results show that the proposed approach is robust for solving linear sytems since we were able to solve more linear systems than each individual solver with an execution time nearly two times equal to those of the worst individual solver. Morever, we were able to predict a set of two solvers containing the best solver on more than 80% cases.
This website uses cookies
We use cookies to provide you with the best possible experience. They also allow us to analyze user behavior in order to constantly improve the website for you. Info about the privacy policy of IOS Press.
This website uses cookies
We use cookies to provide you with the best possible experience. They also allow us to analyze user behavior in order to constantly improve the website for you. Info about the privacy policy of IOS Press.