{"title":"求解Toeplitz线性系统的新算法","authors":"O. F. Aoulad, C. Tajani","doi":"10.23939/mmc2023.03.807","DOIUrl":null,"url":null,"abstract":"In this paper, we are interested in solving the Toeplitz linear systems. By exploiting the special Toeplitz structure, we give a new decomposition form of the coefficient matrix. Based on this matrix decomposition form and combined with the Sherman–Morrison formula, we propose an efficient algorithm for solving the considered problem. A typical example is presented to illustrate the different steps of the proposed algorithm. In addition, numerical tests are given showing the efficiency of our algorithm.","PeriodicalId":37156,"journal":{"name":"Mathematical Modeling and Computing","volume":null,"pages":null},"PeriodicalIF":0.0000,"publicationDate":"2023-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"A new algorithm for solving Toeplitz linear systems\",\"authors\":\"O. F. Aoulad, C. Tajani\",\"doi\":\"10.23939/mmc2023.03.807\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"In this paper, we are interested in solving the Toeplitz linear systems. By exploiting the special Toeplitz structure, we give a new decomposition form of the coefficient matrix. Based on this matrix decomposition form and combined with the Sherman–Morrison formula, we propose an efficient algorithm for solving the considered problem. A typical example is presented to illustrate the different steps of the proposed algorithm. In addition, numerical tests are given showing the efficiency of our algorithm.\",\"PeriodicalId\":37156,\"journal\":{\"name\":\"Mathematical Modeling and Computing\",\"volume\":null,\"pages\":null},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2023-01-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Mathematical Modeling and Computing\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.23939/mmc2023.03.807\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"Q3\",\"JCRName\":\"Mathematics\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Mathematical Modeling and Computing","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.23939/mmc2023.03.807","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q3","JCRName":"Mathematics","Score":null,"Total":0}
A new algorithm for solving Toeplitz linear systems
In this paper, we are interested in solving the Toeplitz linear systems. By exploiting the special Toeplitz structure, we give a new decomposition form of the coefficient matrix. Based on this matrix decomposition form and combined with the Sherman–Morrison formula, we propose an efficient algorithm for solving the considered problem. A typical example is presented to illustrate the different steps of the proposed algorithm. In addition, numerical tests are given showing the efficiency of our algorithm.
京公网安备 11010802042870号
京ICP备2023020795号-1
分享
求助内容：
应助结果提醒方式：
扫码关注我们
