摘要

In this paper we consider the variants of Gram-Schmidt such as Classical Gram-Schmidt and Modified Grain-Schmidt algorithms. It is shown that for problems of dimension more than two the round-off error of operation q(1)(T)q(2) has more propagation in both of algorithms. To cure this difficulty we will present an algorithm, namely Optimized Modified Gram-Schmidt algorithm. Numerical examples indicate the accuracy of this algorithm. We show that this method can improve the loss of orthogonality of the orthogonalization in some ill-conditioned cases.

  • 出版日期2018-5