## Linear characterization of inverse of Stieltjes matrix

### Remember to vote up questions/answers you find interesting or helpful (requires 15 reputation points)

Is there a linear characterization of being the inverse of a Stieltjes matrix? In other words, if $A$ is a $n \times n$ matrix over the reals, is there a set of linear equations in the entries of $A$ such that $A$ is a the inverse of a Stieltjes matrix if and only if these linear conditions are satisfied?

-

What is "Stieltjes matrix" ? – Alexander Chervov Apr 25 2012 at 18:55

## 2 Answers

As far as I know, an exact characterization of the form you want is unknown. A necessary condition, for an inverse M-matrix (weaker than inverse Stieltjes) is the so-called "path product condition" - see http://www.math.temple.edu/~abed/JS07.pdf.

Another necessary condition is that the principal minors be all positive (and they are multilinear in the entries): see for example: http://mathoverflow.net/questions/14987/inverse-m-matrix

ADDITION: There is an "if and only if" characterization of the sort you want for inverse M-matrices (well, almost, since it's multilinear, but maybe that's what you meant :). See Theorem 2.9.1 in the new survey by Johnson & Smith:

http://www.sciencedirect.com/science/article/pii/S0024379511001273 Charles R. Johnson & Ronald L. Smith, Inverse M-matrices, II, Linear Algebra and its Applications, Volume 435, Issue 5, 1 September 2011, Pages 953–983

Let $A \geq 0$. $A$ is an inverse $M$-matrix iff:

(a) $A$ has at least one diagonal positive entry

(b) all Schur complements of order 2 are nonnegative

(c) all Schur complements of order 1 are positive

-

### You can accept an answer to one of your own questions by clicking the check mark next to it. This awards 15 reputation points to the person who answered and 2 reputation points to you.

A partial answer is given in this paper.:

￼A linear algebra proof that the inverse of a strictly ultra metric matrix is a strictly diagonally dominant Stieltjes matrix (Nabben + Varga, SIAM journal of matrix analysis, 1994).

-
{"extraction_info": {"found_math": true, "script_math_tex": 0, "script_math_asciimath": 0, "math_annotations": 0, "math_alttext": 0, "mathml": 0, "mathjax_tag": 0, "mathjax_inline_tex": 8, "mathjax_display_tex": 0, "mathjax_asciimath": 0, "img_math": 0, "codecogs_latex": 0, "wp_latex": 0, "mimetex.cgi": 0, "/images/math/codecogs": 0, "mathtex.cgi": 0}, "config": {"markdown_headings": true, "markdown_code": true, "boilerplate_config": {"ratio_threshold": 0.18, "absolute_threshold": 10, "end_threshold": 15, "enable": true}, "remove_buttons": true, "remove_image_figures": true, "remove_link_clusters": true, "table_config": {"min_rows": 2, "min_cols": 3, "format": "github"}, "remove_chinese": true, "remove_edit_buttons": true, "extract_latex": true}, "english_confidence": 0.879411518573761, "perplexity_flag": "middle"}