Hi
the solution with linear programming works very well!
Even if I take more 'realistic' matrices with dimensions of about 25x60,
the calculation of the basis goes well (if I increase the number of
iterations to 1000).
Meanwhile I also found an algorithm for an exact calculation of the extreme
ray
On Wed, Apr 11, 2012 at 06:04:28AM -0700, capy_bara wrote:
> Dear all,
>
> I want to explore the nullspace of a matrix S: I currently use the function
> Null from the MASS package to get a basis for the null space:
> > S = matrix(nrow=3, ncol=5, c(1,0,0,-1,1,1,1,-1,-1,0,-1,0,0,0,-1)); S
> > MASS:
On Wed, Apr 11, 2012 at 06:04:28AM -0700, capy_bara wrote:
> Dear all,
>
> I want to explore the nullspace of a matrix S: I currently use the function
> Null from the MASS package to get a basis for the null space:
> > S = matrix(nrow=3, ncol=5, c(1,0,0,-1,1,1,1,-1,-1,0,-1,0,0,0,-1)); S
> > MASS:
Dear all,
I want to explore the nullspace of a matrix S: I currently use the function
Null from the MASS package to get a basis for the null space:
> S = matrix(nrow=3, ncol=5, c(1,0,0,-1,1,1,1,-1,-1,0,-1,0,0,0,-1)); S
> MASS::Null(t(S))
My problem is that I actually need a nonnegative basis for
4 matches
Mail list logo