改进迭代改进

ACM '71 Pub Date : 1900-01-01 DOI:10.1145/800184.810539
E. Puccinelli
{"title":"改进迭代改进","authors":"E. Puccinelli","doi":"10.1145/800184.810539","DOIUrl":null,"url":null,"abstract":"This paper describes a scheme for iteratively improving the decomposition of a given matrix A into the product of two matrices B and C. Although B and C may be completely general matrices, the scheme is most practically applicable in the LU and QR decompositions of a matrix. The proposed scheme is first shown to improve perturbed L and U factors of a given matrix A. Next, it is shown that this process will allow for the solution of a badly conditioned system of linear equations when other methods, such as direct triangular decomposition, fail miserably. Finally even when a method such as direct triangular decomposition works, but iterative improvement of the initial solution must be made, the proposed scheme may achieve comparable results and prove to be more economical under certain conditions.","PeriodicalId":126192,"journal":{"name":"ACM '71","volume":"219 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"1900-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Improving iterative improvement\",\"authors\":\"E. Puccinelli\",\"doi\":\"10.1145/800184.810539\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"This paper describes a scheme for iteratively improving the decomposition of a given matrix A into the product of two matrices B and C. Although B and C may be completely general matrices, the scheme is most practically applicable in the LU and QR decompositions of a matrix. The proposed scheme is first shown to improve perturbed L and U factors of a given matrix A. Next, it is shown that this process will allow for the solution of a badly conditioned system of linear equations when other methods, such as direct triangular decomposition, fail miserably. Finally even when a method such as direct triangular decomposition works, but iterative improvement of the initial solution must be made, the proposed scheme may achieve comparable results and prove to be more economical under certain conditions.\",\"PeriodicalId\":126192,\"journal\":{\"name\":\"ACM '71\",\"volume\":\"219 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"1900-01-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"ACM '71\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1145/800184.810539\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"ACM '71","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1145/800184.810539","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0

摘要

本文描述了一种迭代改进矩阵a分解为两个矩阵B和C的乘积的方案。尽管B和C可能是完全一般的矩阵,但该方案在矩阵的LU和QR分解中最实际适用。提出的方案首先被证明可以改善给定矩阵a的扰动L和U因子,然后被证明当其他方法(如直接三角分解)惨败时,该过程将允许求解条件恶劣的线性方程组。最后,即使直接三角分解等方法有效,但必须对初始解进行迭代改进,所提出的方案在一定条件下也可以获得类似的结果,并且证明更经济。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
Improving iterative improvement
This paper describes a scheme for iteratively improving the decomposition of a given matrix A into the product of two matrices B and C. Although B and C may be completely general matrices, the scheme is most practically applicable in the LU and QR decompositions of a matrix. The proposed scheme is first shown to improve perturbed L and U factors of a given matrix A. Next, it is shown that this process will allow for the solution of a badly conditioned system of linear equations when other methods, such as direct triangular decomposition, fail miserably. Finally even when a method such as direct triangular decomposition works, but iterative improvement of the initial solution must be made, the proposed scheme may achieve comparable results and prove to be more economical under certain conditions.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
0.00%
发文量
0
期刊最新文献
The Least Common Bigram: A dictionary arrangement technique for computerized natural-language text searching Interactive graphical spline approximation to boundary value problems System for Heuristic and Rapid Processing of Component Layout and Wiring (SHARPCLAW) A version of Beale's method avoiding the free-variables Troika for architectural planning
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
0
微信
客服QQ
Book学术公众号 扫码关注我们
反馈
×
意见反馈
请填写您的意见或建议
请填写您的手机或邮箱
已复制链接
已复制链接
快去分享给好友吧!
我知道了
×
扫码分享
扫码分享
Book学术官方微信
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术
文献互助 智能选刊 最新文献 互助须知 联系我们:info@booksci.cn
Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。
Copyright © 2023 Book学术 All rights reserved.
ghs 京公网安备 11010802042870号 京ICP备2023020795号-1