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

I know that there are many methods that solve linear equations $Ax = b$ iteratively. But I'm curious if there's one that in each iteration tells us a bound on the solution. Specifically, assume $Ax^* = b$, and our iterations are $x^1, x^2, x^3, \ldots, x^i, \ldots, x^*$(the superscripted $i$ are counters of iterations). Can we from $x^i$ obtain that $l^i \leq x^* \leq u^i$ where $\leq$ should be understand element-wise, or $\|x^*\| \le \varepsilon$?

share|cite|improve this question
Iterative solutions require an initial guess $x_0$. If the bounds on $x_0-x$ are known, then the bounds that you are asking for a calculable. Otherwise, I don't think it is possible. – dexter04 Nov 18 '12 at 17:56

Your Answer


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

Browse other questions tagged or ask your own question.