complexity of Mathematica NullSpace[]
- To: mathgroup at smc.vnet.net
- Subject: [mg28528] complexity of Mathematica NullSpace[]
- From: axc at poincare.EECS.cwru.edu
- Date: Wed, 25 Apr 2001 01:30:31 -0400 (EDT)
- Organization: Case Western Reserve University
- Sender: owner-wri-mathgroup at wolfram.com
anyone know what algorithm Mathematica uses in NullSpace[] and its complexity
and while you're at it, if it's easier to find NullSpace[B] when B is
boolean, and when it's over {-1,0,1}?
alan calvitti
case western reserve u
- Follow-Ups:
- Re: complexity of Mathematica NullSpace[]
- From: Daniel Lichtblau <danl@wolfram.com>
- Re: complexity of Mathematica NullSpace[]