Mathematics Stack Exchange is a question and answer site for people studying math at any level and professionals in related fields. Join them; it only takes a minute:

Sign up
Here's how it works:
  1. Anybody can ask a question
  2. Anybody can answer
  3. The best answers are voted up and rise to the top

Is it easier (computationally speaking) to solve the matrix equation of the form $A\vec{x}=\vec{0}$ (with $\vec{x} \neq \vec{0}$) than for the general case $A\vec{x}=\vec{b}$ ?

share|cite|improve this question
up vote 6 down vote accepted

It depends. Suppose $Ax=b$ has infinitely many solutions. Then to find all the solutions you have to do all the computations needed for solving $Ax=0$, and a little bit extra. On the other hand, suppose $Ax=b$ has no solution. Then you can stop computing as soon as you get to (the equivalent of) $0=1$, whereas to solve $Ax=0$ you have to keep going beyond that.

share|cite|improve this answer

Your Answer


By posting your answer, you agree to the privacy policy and terms of service.

Not the answer you're looking for? Browse other questions tagged or ask your own question.