4
$\begingroup$

So I understand that the effective formula for the orthogonal basis of a matrix is the same in both modified and classical Gram Schmidt algorithm. Can someone explain whats the numerical instability that arises with classical gram schmidt? and how does modified solve it.

$\endgroup$
2
  • 4
    $\begingroup$ this sounds like classic numeric linear algebra textbook stuff. please have a look at: maths.manchester.ac.uk/~higham/asna/index.php $\endgroup$
    – Suvrit
    Jun 18, 2011 at 13:29
  • 1
    $\begingroup$ Type "numerical instability gram-schmidt" into Google and you get plenty of well-informed responses. Even YouTube video demonstrations. $\endgroup$ Jun 18, 2011 at 22:03

2 Answers 2

1
$\begingroup$

Here's the link:

http://en.wikipedia.org/wiki/Gram%E2%80%93Schmidt_process

$\endgroup$
0
$\begingroup$

As I remember, because of rounding off the numbers - vectors loose their orthoginality in non-modified version. Wikipedia article about Gram-Schmidt explains the modification.

$\endgroup$

Your Answer

By clicking “Post Your Answer”, you agree to our terms of service and acknowledge you have read our privacy policy.

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