期刊
COMPUTERS & MATHEMATICS WITH APPLICATIONS
卷 50, 期 7, 页码 1069-1075出版社
PERGAMON-ELSEVIER SCIENCE LTD
DOI: 10.1016/j.camwa.2005.08.009
关键词
numerical linear algebra; QR factorization; Gram-Schmidt orthogonalization; reorthogonalization; rounding error analysis
In this paper, we study numerical behavior of several computational variants of the Gram-Schmidt orthogonalization process. We focus on the orthogonality of computed vectors which may be significantly lost in the classical or modified Gram-Schmidt algorithm, while the Gram-Schmidt algorithm with reorthogonalization has been shown to compute vectors which are orthogonal to machine precision level. The implications for practical implementation and its impact on the efficiency in the parallel computer environment are considered. (c) 2005 Elsevier Ltd. All rights reserved.
作者
我是这篇论文的作者
点击您的名字以认领此论文并将其添加到您的个人资料中。
推荐
暂无数据