How to generate a semipositive indecomposible matrix of nxn
I am still using MC 11.
I was able to make a random square matrix called A of n dimension, with 1<n<1000 (infinite would have been better but my pc horse power is limited). A needed to be positive, with Max Eigenvalue lower than 1.
I used the following combination of formulas, which probably is not the optimum, but it works.
1): Z(z,z)=:rnd(1/n) # so to have numbers that fulfill the condition MaxEval<1
2) A=: matrix(n,n,Z)
I would like to refine it, and I ask kindly advice.
The constrains that I would like to add in generating A are the following.
a) Still a nxn square Matrix with Max Eigenvalue lower than 1.
b) But A should be semi-positive, with random coefficients, including zeros and not just positive as above.
c) However A should be indecomposable (called also irreducible), i.e. A^x (with x a positive number) should turn a positive matrix.
Thanks for any suggestion.

