2013
DOI: 10.1016/j.amc.2012.11.056
|View full text |Cite
|
Sign up to set email alerts
|

Infinity norm bounds for the inverse of Nekrasov matrices

Abstract: From the application point of view, it is important to have a good upper bound for the maximum norm of the inverse of a given matrix A. In this paper we will give two simple and practical upper bounds for the maximum norm of the inverse of a Nekrasov matrix.

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

2
28
0

Year Published

2014
2014
2020
2020

Publication Types

Select...
6

Relationship

1
5

Authors

Journals

citations
Cited by 34 publications
(30 citation statements)
references
References 5 publications
2
28
0
Order By: Relevance
“…As indicated in [2], in the particular case of Nekrasov matrices, the bounds (2.5) and (2.6) improve the corresponding bounds presented in [1].…”
Section: )supporting
confidence: 51%
See 1 more Smart Citation
“…As indicated in [2], in the particular case of Nekrasov matrices, the bounds (2.5) and (2.6) improve the corresponding bounds presented in [1].…”
Section: )supporting
confidence: 51%
“…As was shown in [9], the bound (1.5) generally improves the earlier bounds proposed by Cvetković et al in [1] and, for an SDD matrix A = (a ij ), the bound (1.5) is at least as good as the classical Varah bound [14]…”
Section: Introductionsupporting
confidence: 53%
“…Matrix A 3 is neither SDD nor Nekrasov, but it does satisfy our new fP 1 ; P 2 g-Nekrasov condition, where P 1 is the identical permutation of order 6 and P 2 is counteridentical permutation of order 6. In the following table, we compare the results for max-norm bounds of the inverse matrix obtained using Theorem 3.1 and Theorem 3.2 of this paper to those of Varah, for SDD matrices, and to the bounds for Nekrasov matrices presented in [3] (in Table 1 we call them Nekrasov I and Nekrasov II). Exact values for the max-norm of the inverse matrix are as follows: As one can see from Table 1, our bounds are better than Varah for some SDD matrices, and, in some cases, they are better than bounds for Nekrasov matrices presented in [3].…”
Section: Numerical Examplesmentioning
confidence: 99%
“…In the following table, we compare the results for max-norm bounds of the inverse matrix obtained using Theorem 3.1 and Theorem 3.2 of this paper to those of Varah, for SDD matrices, and to the bounds for Nekrasov matrices presented in [3] (in Table 1 we call them Nekrasov I and Nekrasov II). Exact values for the max-norm of the inverse matrix are as follows: As one can see from Table 1, our bounds are better than Varah for some SDD matrices, and, in some cases, they are better than bounds for Nekrasov matrices presented in [3]. If the matrix is neither SDD nor Nekrasov, like, for example, A 3 , the only bounds that can be applied are bounds (8) and (10).…”
Section: Numerical Examplesmentioning
confidence: 99%
See 1 more Smart Citation