Photo from archive.org
García-Esnaola and Peña (Numer. Algor. 67 , 655–667, 2014 ) presented an error bound involving a parameter for linear complementarity problems of Nekrasov matrices. This bound is not effective in… Click to show full abstract
García-Esnaola and Peña (Numer. Algor. 67 , 655–667, 2014 ) presented an error bound involving a parameter for linear complementarity problems of Nekrasov matrices. This bound is not effective in some cases because it tends to infinity when the involved parameter tends to zero. In this paper, the optimal value of this error bound is determined completely by using the monotonicity of functions of this parameter. Numerical examples are given to verify the corresponding results.
Keywords:
linear complementarity;
complementarity problems;
error;
problems nekrasov;
nekrasov matrices
Journal Title: Numerical Algorithms
Year Published: 2019
Link to full text (if available)
Share on Social Media: Sign Up to like & get
recommendations!
Journal Title: Numerical Algorithms
Year Published: 2019
Link to full text (if available)
Share on Social Media: Sign Up to like & get
recommendations!