TY - GEN

T1 - Towards low-cost, high-accuracy classifiers for linear solver selection

AU - Bhowmick, Sanjukta

AU - Toth, Brice

AU - Raghavan, Padma

N1 - Copyright:
Copyright 2009 Elsevier B.V., All rights reserved.

PY - 2009

Y1 - 2009

N2 - The time to solve linear systems depends to a large extent on the choice of the solution method and the properties of the coefficient matrix. Although there are several linear solution methods, in most cases it is impossible to predict apriori which linear solver would be best suited for a given linear system. Recent investigations on selecting linear solvers for a given system have explored the use of classification techniques based on the linear system parameters for solver selection. In this paper, we present a method to develop low-cost high-accuracy classifiers. We show that the cost for constructing a classifier can be significantly reduced by focusing on the computational complexity of each feature. In particular, we filter out low information linear system parameters and then order the remaining parameters to decrease the total computation cost for classification at a prescribed accuracy. Our results indicate that the speedup factor of the time to compute the feature set using our ordering can be as high as 262. The accuracy and computation time of the feature set generated using our method is comparable to a near-optimal one, thus demonstrating the effectiveness of our technique.

AB - The time to solve linear systems depends to a large extent on the choice of the solution method and the properties of the coefficient matrix. Although there are several linear solution methods, in most cases it is impossible to predict apriori which linear solver would be best suited for a given linear system. Recent investigations on selecting linear solvers for a given system have explored the use of classification techniques based on the linear system parameters for solver selection. In this paper, we present a method to develop low-cost high-accuracy classifiers. We show that the cost for constructing a classifier can be significantly reduced by focusing on the computational complexity of each feature. In particular, we filter out low information linear system parameters and then order the remaining parameters to decrease the total computation cost for classification at a prescribed accuracy. Our results indicate that the speedup factor of the time to compute the feature set using our ordering can be as high as 262. The accuracy and computation time of the feature set generated using our method is comparable to a near-optimal one, thus demonstrating the effectiveness of our technique.

UR - http://www.scopus.com/inward/record.url?scp=68849090240&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=68849090240&partnerID=8YFLogxK

U2 - 10.1007/978-3-642-01970-8_45

DO - 10.1007/978-3-642-01970-8_45

M3 - Conference contribution

AN - SCOPUS:68849090240

SN - 3642019692

SN - 9783642019692

T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

SP - 463

EP - 472

BT - Computational Science - ICCS 2009 - 9th International Conference, Proceedings

T2 - 9th International Conference on Computational Science, ICCS 2009

Y2 - 25 May 2009 through 27 May 2009

ER -