Name
Title | ||
|---|---|---|
A Sparse Matrix Library With Automatic Selection Of Iterative Solvers And Preconditioners |
Abstract | ||
|---|---|---|
Many iterative solvers and preconditioners have recently been proposed for linear iterative matrix libraries. Currently, library users have to manually select the solvers and preconditioners to solve their target matrix. However, if they select the wrong combination of the two, they have to spend a lot of time on calculations or they cannot obtain the solution. Therefore, an approach for the automatic selection of solvers and preconditioners is needed. We have developed a function that automatically selects an effective solver/preconditioner combination by referencing the history of relative residuals at run-time to predict whether the solver will converge or stagnate. Numerical evaluation with 50 Florida matrices showed that the proposed function can select effective combinations in all matrices. This suggests that our function can play a significant role in sparse iterative matrix computations. (C) 2013 The Authors. Published by Elsevier B.V. and peer review under responsibility of the organizers of the 2013 International Conference on Computational Science |
Year | DOI | Venue |
|---|---|---|
2013 | 10.1016/j.procs.2013.05.300 | 2013 INTERNATIONAL CONFERENCE ON COMPUTATIONAL SCIENCE |
Keywords | Field | DocType |
Auto-tuning, linear problem, sparse matrix, iterative solver, preconditioner | Linear problem,Mathematical optimization,Preconditioner,Computer science,Matrix (mathematics),Computational science,Solver,Auto tuning,Sparse matrix,Computation | Conference |
Volume | ISSN | Citations |
18 | 1877-0509 | 0 |
PageRank | References | Authors |
0.34 | 6 | 6 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Takao Sakurai | 1 | 2 | 0.77 |
| Takahiro Katagiri | 2 | 121 | 17.01 |
| Hisayasu Kuroda | 3 | 10 | 4.97 |
| Ken Naono | 4 | 8 | 5.74 |
| Mitsuyoshi Igai | 5 | 2 | 1.44 |
| Satoshi Ohshima | 6 | 53 | 8.47 |