A sparse matrix library with automatic selection of iterative solvers and preconditioners

Takao Sakurai, Takahiro Katagiri, Hisayasu Kuroda, Ken Naono, Mitsuyoshi Igai, Satoshi Ohshima

研究成果: ジャーナルへの寄稿Conference article

3 引用 (Scopus)

抄録

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 runtime 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.

元の言語英語
ページ(範囲)1332-1341
ページ数10
ジャーナルProcedia Computer Science
18
DOI
出版物ステータス出版済み - 1 1 2013
イベント13th Annual International Conference on Computational Science, ICCS 2013 - Barcelona, スペイン
継続期間: 6 5 20136 7 2013

All Science Journal Classification (ASJC) codes

  • Computer Science(all)

これを引用

A sparse matrix library with automatic selection of iterative solvers and preconditioners. / Sakurai, Takao; Katagiri, Takahiro; Kuroda, Hisayasu; Naono, Ken; Igai, Mitsuyoshi; Ohshima, Satoshi.

:: Procedia Computer Science, 巻 18, 01.01.2013, p. 1332-1341.

研究成果: ジャーナルへの寄稿Conference article

Sakurai, Takao ; Katagiri, Takahiro ; Kuroda, Hisayasu ; Naono, Ken ; Igai, Mitsuyoshi ; Ohshima, Satoshi. / A sparse matrix library with automatic selection of iterative solvers and preconditioners. :: Procedia Computer Science. 2013 ; 巻 18. pp. 1332-1341.
@article{adb7f039966a46a381d768366c72b309,
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 runtime 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.",
author = "Takao Sakurai and Takahiro Katagiri and Hisayasu Kuroda and Ken Naono and Mitsuyoshi Igai and Satoshi Ohshima",
year = "2013",
month = "1",
day = "1",
doi = "10.1016/j.procs.2013.05.300",
language = "English",
volume = "18",
pages = "1332--1341",
journal = "Procedia Computer Science",
issn = "1877-0509",
publisher = "Elsevier BV",

}

TY - JOUR

T1 - A sparse matrix library with automatic selection of iterative solvers and preconditioners

AU - Sakurai, Takao

AU - Katagiri, Takahiro

AU - Kuroda, Hisayasu

AU - Naono, Ken

AU - Igai, Mitsuyoshi

AU - Ohshima, Satoshi

PY - 2013/1/1

Y1 - 2013/1/1

N2 - 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 runtime 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.

AB - 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 runtime 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.

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

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

U2 - 10.1016/j.procs.2013.05.300

DO - 10.1016/j.procs.2013.05.300

M3 - Conference article

AN - SCOPUS:84896984818

VL - 18

SP - 1332

EP - 1341

JO - Procedia Computer Science

JF - Procedia Computer Science

SN - 1877-0509

ER -