Services & Resources / Wolfram Forums
MathGroup Archive
*Archive Index
*Ask about this page
*Print this page
*Give us feedback
*Sign up for the Wolfram Insider

MathGroup Archive 2001

[Date Index] [Thread Index] [Author Index]

Search the Archive

complexity of Mathematica NullSpace[]

  • To: mathgroup at
  • Subject: [mg28528] complexity of Mathematica NullSpace[]
  • From: axc at
  • Date: Wed, 25 Apr 2001 01:30:31 -0400 (EDT)
  • Organization: Case Western Reserve University
  • Sender: owner-wri-mathgroup at

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

  • Prev by Date: A tough Integral
  • Next by Date: Regressions and the Mathematica buttons
  • Previous by thread: Re: A tough Integral
  • Next by thread: Re: complexity of Mathematica NullSpace[]