首页> 外文会议>International Conference on Numerical Analysis and Applied Mathematics >A New QR Factorization Method by Recursive Blocked Gram-Schmidt Algorithm and Recursive Blocked Cholesky Factorization
【24h】

A New QR Factorization Method by Recursive Blocked Gram-Schmidt Algorithm and Recursive Blocked Cholesky Factorization

机译:递归阻塞克施密特算法和递归阻塞Cholesky系数的新QR分解方法

获取原文

摘要

We propose a new algorithm for efficiently computing the QR factorization of a given matrix A. Our method uses a recursive blocked Gram-Schmidt orthogonalization and a recursive blocked Cholesky factorization. Numerical experiments show that our method is better than the conventional methods.
机译:我们提出了一种新的算法,用于有效计算给定矩阵A的QR分解。我们的方法使用递归阻塞的克施密特正交和递归阻塞的Cholesky分解。数值实验表明,我们的方法优于传统方法。

著录项

相似文献

  • 外文文献
  • 中文文献
  • 专利
获取原文

客服邮箱:kefu@zhangqiaokeyan.com

京公网安备:11010802029741号 ICP备案号:京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有
  • 客服微信

  • 服务号