{"title":"RMEIEMLA : The recent advance in improving the robustness of Lanczos-type\u0000 algorithms","authors":"M. Bakar, A. Salhi","doi":"10.1063/1.5121046","DOIUrl":"https://doi.org/10.1063/1.5121046","url":null,"abstract":"Modified embedding interpolation and extrapolation model in Lanczos-types algorithms (MEIEMLA) is well-known as a strategy to avoid breakdown in Lanczos-type algorithms by taking advantage of the patterns which persistently exist in the iterates generated by a Lanczos-type algorithm. It is the improved EIEMLA by interpolating all vector solutions S = x1, x2,…,xk generated by a Lanczos-type algorithm, at one time by using PCHIP. Note, the previous EIEMLA interpolates the vector solutions by arranging S such that it contains all of the ith entries of iterates xk, for i = 1,2,…,n, and n is the dimension of the system. As a result, MEIEMLA performed the solutions of several systems of linear equations (SLEs) more efficient than EIEMLA. However, once running the MEIEMLA, it cannot convergent quickly. It is, therefore, important to put MEIEMLA in a restarting framework. In this paper, we combined the MEIEMLA and restarting in order for Lanczos-types algorithms getting rid off breakdown as well as enhancing their stability. Numerical results are presented and compared with other existing restarting strategies in Lanczos algorithms, including with REIEMLA. The results showed that the restarting MEIEMLA (RMEIEMLA) performed better than other existing restarting strategies.The original version of this article supplied to AIP Publishing contained an error in the reference section. Reference 12 was incomplete and did not include the full Journal title and the page numbers were incorrect. These items have been corrected in the new article published on September 11, 2019.Modified embedding interpolation and extrapolation model in Lanczos-types algorithms (MEIEMLA) is well-known as a strategy to avoid breakdown in Lanczos-type algorithms by taking advantage of the patterns which persistently exist in the iterates generated by a Lanczos-type algorithm. It is the improved EIEMLA by interpolating all vector solutions S = x1, x2,…,xk generated by a Lanczos-type algorithm, at one time by using PCHIP. Note, the previous EIEMLA interpolates the vector solutions by arranging S such that it contains all of the ith entries of iterates xk, for i = 1,2,…,n, and n is the dimension of the system. As a result, MEIEMLA performed the solutions of several systems of linear equations (SLEs) more efficient than EIEMLA. However, once running the MEIEMLA, it cannot convergent quickly. It is, therefore, important to put MEIEMLA in a restarting framework. In this paper, ...","PeriodicalId":407522,"journal":{"name":"THE 4TH INNOVATION AND ANALYTICS CONFERENCE & EXHIBITION (IACE\n 2019)","volume":"35 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-08-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132722134","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}