### 抜粋

Several methods have been proposed to calculate a rigorous error bound of an approximate solution of a linear system by floating-point arithmetic. These methods are called 'verification methods'. Applicable range of these methods are different. It depends mainly on the condition number and the dimension of the coefficient matrix whether such methods succeed to work or not. In general, however, the condition number is not known in advance. If the dimension or the condition number is large to some extent, then Oishi-Rump's method, which is known as the fastest verification method for this purpose, may fail. There are more robust verification methods whose computational cost is larger than the Oishi-Rump's one. It is not so efficient to apply such robust methods to well-conditioned problems. The aim of this paper is to choose a suitable verification method whose computational cost is minimum to succeed. First in this paper, four fast verification methods for linear systems are briefly reviewed. Next, a compromise method between Oishi-Rump's and Ogita-Oishi's one is developed. Then, an algorithm which automatically and efficiently chooses an appropriate verification method from five verification methods is proposed. The proposed algorithm does as much work as necessary to calculate error bounds of approximate solutions of linear systems. Finally, numerical results are presented.

元の言語 | English |
---|---|

ページ（範囲） | 363-382 |

ページ数 | 20 |

ジャーナル | Numerical Algorithms |

巻 | 56 |

発行部数 | 3 |

DOI | |

出版物ステータス | Published - 2011 3 1 |

### ASJC Scopus subject areas

- Applied Mathematics

## フィンガープリント An algorithm for automatically selecting a suitable verification method for linear systems' の研究トピックを掘り下げます。これらはともに一意のフィンガープリントを構成します。

## これを引用

*Numerical Algorithms*,

*56*(3), 363-382. https://doi.org/10.1007/s11075-010-9389-6