Resumen: We introduce strong B-matrices and strong B-Nekrasov matrices, for which some error bounds for linear complementarity problems are analyzed. In particular, it is proved that the bounds of García-Esnaola and Peña (Appl. Math. Lett. 22, 1071–1075, 2009) and of (Numer. Algor. 72, 435–445, 2016) are asymptotically optimal for strong B-matrices and strong B-Nekrasov matrices, respectively. Other comparisons with a bound of Li and Li (Appl. Math. Lett. 57, 108–113, 2016) are performed. Idioma: Inglés DOI: 10.1007/s11075-018-0495-1 Año: 2018 Publicado en: Numerical Algorithms 80 (2018), 521 – 532 ISSN: 1017-1398 Factor impacto JCR: 2.417 (2018) Categ. JCR: MATHEMATICS, APPLIED rank: 24 / 254 = 0.094 (2018) - Q1 - T1 Factor impacto SCIMAGO: 0.937 - Applied Mathematics (Q2)