A 1-norm bound for inverses of triangular matrices with monotone entries (Q927618)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 5285587
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A 1-norm bound for inverses of triangular matrices with monotone entries |
scientific article; zbMATH DE number 5285587 |
Statements
A 1-norm bound for inverses of triangular matrices with monotone entries (English)
0 references
9 June 2008
0 references
Let \(A= [a_{ij}]^n_{i,j=1}\) be an \(n\)-by-\(n\) lower-triangular real matrix with \(a_{ii}\geq a_{i+1,i}\geq\cdots\geq a_{n,i}> a> 0\) for all \(i\), and \(a_{11}\leq a_{22}\leq\cdots\leq a_{nn}\). The main result of this paper gives an upper bound for the 1-norm of the inverse matrix of \(A\), namely, \[ \| A^{-1}\|_1\leq{1\over a}\,\Biggl({a_{nn}\over a_{11}}\Biggr) (2-\rho(a, a_{nn})^{\lceil n/2\rceil}- \rho(a, a_{nn})^{\lfloor n/2\rfloor}), \] where \(\rho\) is defined as \(\rho(x, y)= 1- (x/y)\). For the case of \(a_{11}= a_{22}=\cdots= a_{nn}\), the inequality is shown to be best possible. The result extends and refines the previous ones for (lower-triangular) Toeplitz matrices. The proof is elementary but slightly lengthy.
0 references
inverse matrix
0 references
monotone entries
0 references
triangular matrix
0 references
partial order
0 references
recurrence relation
0 references
upper bound for the 1-norm
0 references
Toeplitz matrices
0 references
0.946741223335266
0 references
0.9025381207466124
0 references
0.8953931331634521
0 references
0.8719980120658875
0 references
0.8653762936592102
0 references