scholarly journals Sharp ULP rounding error bound for the hypotenuse function

1999 ◽  
Vol 68 (227) ◽  
pp. 1143-1149 ◽  
Author(s):  
Abraham Ziv
Keyword(s):  
2021 ◽  
Vol 115 ◽  
pp. 107917
Author(s):  
Ángel Carmona-Poyato ◽  
Nicolás Luis Fernández-Garcia ◽  
Francisco José Madrid-Cuevas ◽  
Antonio Manuel Durán-Rosal

2019 ◽  
Vol 17 (1) ◽  
pp. 1599-1614
Author(s):  
Zhiwu Hou ◽  
Xia Jing ◽  
Lei Gao

Abstract A new error bound for the linear complementarity problem (LCP) of Σ-SDD matrices is given, which depends only on the entries of the involved matrices. Numerical examples are given to show that the new bound is better than that provided by García-Esnaola and Peña [Linear Algebra Appl., 2013, 438, 1339–1446] in some cases. Based on the obtained results, we also give an error bound for the LCP of SB-matrices. It is proved that the new bound is sharper than that provided by Dai et al. [Numer. Algor., 2012, 61, 121–139] under certain assumptions.


Bernoulli ◽  
2015 ◽  
Vol 21 (1) ◽  
pp. 335-359 ◽  
Author(s):  
Louis H.Y. Chen ◽  
Xiao Fang

Sign in / Sign up

Export Citation Format

Share Document