Weakly chained diagonally dominant matrix

Venn Diagram showing the containment of weakly chained diagonally dominant (WCDD) matrices relative to weakly diagonally dominant (WDD) and strictly diagonally dominant (SDD) matrices.

In mathematics, the weakly chained diagonally dominant matrices are a family of nonsingular matrices that include the strictly diagonally dominant matrices.

Definition

Preliminaries

We say row $i$ of a complex matrix $A=(a_{ij})$ is strictly diagonally dominant (SDD) if $|a_{ii}|>\textstyle {\sum _{j\neq i}}|a_{ij}|$ . We say $A$ is SDD if all of its rows are SDD. Weakly diagonally dominant (WDD) is defined with $\geq$ instead.

The directed graph associated with an $m\times m$ complex matrix $A=(a_{ij})$ is given by the vertices $\{1,\ldots ,m\}$ and edges defined as follows: there exists an edge from $i\rightarrow j$ if and only if $a_{ij}\neq 0$ .

Definition

A complex square matrix $A$ is said to be weakly chained diagonally dominant (WCDD) if

$A$ is WDD and
for each row $i$ of $A$ , there exists a walk in the directed graph of $A$ from $i$ to an SDD row.

Note that if $i$ is itself an SDD row, the trivial walk $i\rightarrow i$ satisfies the second requirement in the above definition.

Example

The directed graph associated with the WCDD matrix in the example. The first row, which is SDD, is highlighted. Note that regardless of which node

i

we start at, we can find a walk

i\rightarrow (i-1)\rightarrow (i-2)\rightarrow \cdots \rightarrow 1

The matrix

{\begin{pmatrix}1\\-1&1\\&-1&1\\&&\ddots &\ddots \\&&&-1&1\end{pmatrix}}

is WCDD.

Properties

Nonsingularity

A WCDD matrix is nonsingular.^[1]

Proof:^[2] Let $A=(a_{ij})$ be a WCDD matrix. Suppose there exists a nonzero $x$ in the null space of $A$ . Without loss of generality, let $i_{1}$ be such that $|x_{i_{1}}|=1\geq |x_{j}|$ for all $j$ . Since $A$ is WCDD, we may pick a walk $i_{1}\rightarrow i_{2}\rightarrow \cdots \rightarrow i_{m}$ ending at an SDD row $i_{m}$ .

Taking modulii on both sides of

-a_{i_{1}i_{1}}x_{i_{1}}=\sum _{j\neq i_{1}}a_{i_{1j}}x_{j}

and applying the triangle inequality yields

\left|a_{i_{1}i_{1}}\right|\leq \sum _{j\neq i_{1}}\left|a_{i_{1}j}\right|\left|x_{j}\right|\leq \sum _{j\neq i_{1}}\left|a_{i_{1}j}\right|,

and hence row $i_{1}$ is not SDD. Moreover, since $A$ is WDD, the above chain of inequalities holds with equality so that $|x_{j}|=1$ whenever $a_{i_{1}j}\neq 0$ . Therefore, $|x_{i_{2}}|=1$ . Repeating this argument with $i_{2}$ , $i_{3}$ , etc., we find that $i_{m}$ is not SDD, a contradiction. $\square$

Recalling that an irreducible matrix is one whose associated directed graph is strongly connected, a trivial corollary of the above is that an irreducibly diagonally dominant matrix (i.e., an irreducible WDD matrix with at least one SDD row) is nonsingular.^[3]

Relationship with M-matrices

The following are equivalent:^[4]

$A$ is a WDD M-matrix.
$A$ is a nonsingular WDD L-matrix;
$A$ is a WCDD L-matrix;

In fact, WCDD L-matrices were studied (by James H. Bramble and B. E. Hubbard) as early as 1964 in a journal article^[5] in which they appear under the alternate name of matrices of positive type.

Moreover, if $A$ is an $n\times n$ WCDD L-matrix, we can bound its inverse as follows:^[6]

\left\Vert A^{-1}\right\Vert _{\infty }\leq \sum _{i}\left[a_{ii}\prod _{j=1}^{i}(1-u_{j})\right]^{-1}

where

u_{i}={\frac {1}{\left|a_{ii}\right|}}\sum _{j=i+1}^{n}\left|a_{ij}\right|.

Note that $u_{n}$ is always zero and that the right-hand side of the bound above is $\infty$ whenever one or more of the constants $u_{i}$ is one.

Tighter bounds for the inverse of a WCDD L-matrix are known.^[7]^[8]^[9]^[10]

Applications

Due to their relationship with M-matrices (see above), WCDD matrices appear often in practical applications. Some examples are given below.

Markov decision processes

Consider a Markov chain on the finite state space $\{1,\ldots ,m\}$ . Let $\{\pi \}$ be a (finite) set of stationary policies and $P(\pi )$ be the transition matrix for the chain under policy $\pi$ . Let $\rho (\pi )\in [0,1]^{m}$ denote an $m$ -vector corresponding to the discount factor at each state of the Markov chain. Because each $P(\pi )$ is a right stochastic matrix, $\{I-\operatorname {diag} (\rho (\pi ))P(\pi )\}$ is a family of WDD L-matrices. Convergence of R. A. Howard's policy iteration algorithm to the solution of a Markov decision process is guaranteed whenever this family consists only of inverse-positive matrices.^[11] As mentioned in a previous section, this occurs if and only if each member of the family is WCDD.

Monotone numerical schemes

WCDD L-matrices arise naturally from monotone approximation schemes for partial differential equations.

For example, consider the one-dimensional Poisson problem

u^{\prime \prime }(x)=f(x)

for

x\in (0,1)

with Dirichlet boundary conditions $u(0)=u(1)=0$ . Letting $\{0,h,2h,\ldots ,1\}$ be a numerical grid (for some positive $h$ that divides unity), a monotone finite difference scheme for the Poisson problem takes the form of

-A{\vec {u}}=h^{2}{\vec {f}}

where

{\vec {f}}_{j}=f(jh)

and

A={\begin{pmatrix}2&-1\\-1&2&-1\\&-1&2&-1\\&&\ddots &\ddots &\ddots \\&&&-1&2&-1\\&&&&-1&2\end{pmatrix}}.

Note that $A$ is a WCDD L-matrix.

References

↑ Shivakumar, P. N.; Chew, Kim Ho (1974). "A Sufficient Condition for Nonvanishing of Determinants" (PDF). Proceedings of the American Mathematical Society. 43 (1): 63. ISSN 0002-9939. doi:10.1090/S0002-9939-1974-0332820-0.
↑ Azimzadeh, Parsiad; Forsyth, Peter A. (2016). "Weakly Chained Matrices, Policy Iteration, and Impulse Control" (PDF). SIAM Journal on Numerical Analysis. 54 (3): 1341–1364. ISSN 0036-1429. arXiv:1510.03928 . doi:10.1137/15M1043431.
↑ Horn, Roger A.; Johnson, Charles R. (1990). "Matrix analysis". Cambridge University Press, Cambridge.
↑ Azimzadeh, Parsiad. "A fast and stable test to check if a weakly diagonally dominant matrix is an M-Matrix" (PDF). arXiv:1701.06951 .
↑ Bramble, James H.; Hubbard, B. E. (1964). "On a finite difference analogue of an elliptic problem which is neither diagonally dominant nor of non-negative type". Journal of Mathematical Physics. 43: 117–132. doi:10.1002/sapm1964431117.
↑ Shivakumar, P. N.; Williams, Joseph J.; Ye, Qiang; Marinov, Corneliu A. (1996). "On Two-Sided Bounds Related to Weakly Diagonally Dominant M-Matrices with Application to Digital Circuit Dynamics". SIAM Journal on Matrix Analysis and Applications. 17 (2): 298–312. ISSN 0895-4798. doi:10.1137/S0895479894276370.
↑ Cheng, Guang-Hui; Huang, Ting-Zhu (2007). "An upper bound for $\Vert A^{-1}\Vert _{\infty }$ of strictly diagonally dominant M-matrices". Linear Algebra and its Applications. 426 (2-3): 667–673. ISSN 0024-3795. doi:10.1016/j.laa.2007.06.001.
↑ Li, Wen (2008). "The infinity norm bound for the inverse of nonsingular diagonal dominant matrices". Applied Mathematics Letters. 21 (3): 258–263. ISSN 0893-9659. doi:10.1016/j.aml.2007.03.018.
↑ Wang, Ping (2009). "An upper bound for $\Vert A^{-1}\Vert _{\infty }$ of strictly diagonally dominant M-matrices". Linear Algebra and its Applications. 431 (5-7): 511–517. ISSN 0024-3795. doi:10.1016/j.laa.2009.02.037.
↑ Huang, Ting-Zhu; Zhu, Yan (2010). "Estimation of $\Vert A^{-1}\Vert _{\infty }$ for weakly chained diagonally dominant M-matrices". Linear Algebra and its Applications. 432 (2-3): 670–677. ISSN 0024-3795. doi:10.1016/j.laa.2009.09.012.
↑ Bokanowski, Olivier; Maroso, Stefania; Zidani, Hasnaa (2009). "Some Convergence Results for Howard's Algorithm" (PDF). SIAM Journal on Numerical Analysis. 47 (4): 3001–3026. ISSN 0036-1429. doi:10.1137/08073041X.

This article is issued from Wikipedia. The text is licensed under Creative Commons - Attribution - Sharealike. Additional terms may apply for the media files.