{"title":"对仅在一个或多个元素上不同的矩阵序列进行LU分解的一种计算算法","authors":"M. Zahir","doi":"10.1145/74654.74656","DOIUrl":null,"url":null,"abstract":"A computational algorithm for an efficient LU decomposition of a sequence of matrices that differ in one or more elements is presented and some possible areas of engineering and business applications are outlined. CPU time, as measured in an implementation of the algorithm using FORTRAN code, is shown to agree very well with the estimated operations count.","PeriodicalId":177516,"journal":{"name":"ACM Signum Newsletter","volume":"63 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"1989-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"A computational algorithm for LU decomposition of a sequence of matrices that differ only in one or more elements\",\"authors\":\"M. Zahir\",\"doi\":\"10.1145/74654.74656\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"A computational algorithm for an efficient LU decomposition of a sequence of matrices that differ in one or more elements is presented and some possible areas of engineering and business applications are outlined. CPU time, as measured in an implementation of the algorithm using FORTRAN code, is shown to agree very well with the estimated operations count.\",\"PeriodicalId\":177516,\"journal\":{\"name\":\"ACM Signum Newsletter\",\"volume\":\"63 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"1989-11-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"ACM Signum Newsletter\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1145/74654.74656\",\"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 Signum Newsletter","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1145/74654.74656","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
A computational algorithm for LU decomposition of a sequence of matrices that differ only in one or more elements
A computational algorithm for an efficient LU decomposition of a sequence of matrices that differ in one or more elements is presented and some possible areas of engineering and business applications are outlined. CPU time, as measured in an implementation of the algorithm using FORTRAN code, is shown to agree very well with the estimated operations count.
求助内容：
应助结果提醒方式：
京公网安备 11010802042870号
