Abstract
In this paper, we consider ??Nekrasov matrices, a generalization of {P1, P2}?Nekrasov matrices obtained by introducing the set ? = {P1, P2, ..., Pm} of m simultaneous permutations of rows and columns of the given matrix. For point-wise and block ??Nekrasov matrices we give infinity norm bounds for the inverse. For ??Nekrasov B?matrices, obtained through a special rank one perturbation, we present main results on infinity norm bounds for the inverse and error bounds for linear complementarity problems. Numerical examples illustrate the benefits of new bounds.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
