New error bounds for linear complementarity problems of S-Nekrasov matrices and B–S-Nekrasov matrices
Sign Up to like & getrecommendations! Published in 2019 at "Computational and Applied Mathematics"
DOI: 10.1007/s40314-019-0818-4
Abstract: In this paper, we give new error bounds for linear complementarity problems when the involved matrices are S-Nekrasov matrices and B–S-Nekrasov matrices, respectively. We prove that the obtained bounds are better than those of Gao… read more here.
Keywords: nekrasov matrices; matrices nekrasov; linear complementarity; new error ... See more keywords
New Error-Bounds With NLOS TOA Localization and the Applications
Sign Up to like & getrecommendations! Published in 2024 at "IEEE Communications Letters"
DOI: 10.1109/lcomm.2024.3419045
Abstract: Non-line-of-sight (NLOS) localization has been a focus in mobile communications over the years. Many ways have been proposed to solve this problem. Among them, wide-band localization with time-of-arrival (TOA) technique can achieve high accuracy. For… read more here.
Keywords: bounds nlos; nlos toa; error bounds; new error ... See more keywords
New error bounds for linear complementarity problems of Σ-SDD matrices and SB-matrices
Sign Up to like & getrecommendations! Published in 2019 at "Open Mathematics"
DOI: 10.1515/math-2019-0127
Abstract: 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… read more here.
Keywords: linear complementarity; sdd matrices; error; error bounds ... See more keywords