Anh, Pham Ky; Dung, Vu Tien Parallel iterative regularization algorithms for large overdetermined linear systems. (English) Zbl 1270.65019 Int. J. Comput. Methods 7, No. 4, 525-537 (2010). Summary: In this paper, we study the performance of some parallel iterative regularization methods for solving large overdetermined systems of linear equations. Cited in 2 Documents MSC: 65F10 Iterative numerical methods for linear systems 65Y05 Parallel numerical computation Keywords:iterative regularization method; ill-posed problem; parallel computation PDFBibTeX XMLCite \textit{P. K. Anh} and \textit{V. T. Dung}, Int. J. Comput. Methods 7, No. 4, 525--537 (2010; Zbl 1270.65019) Full Text: DOI References: [1] Anh P. K., Appl. Math. Comput. 212 pp 542– [2] Bakunshinski A. B., Iterative Methods for Solving Ill-Posed Problems (1989) [3] DOI: 10.1007/978-94-011-1026-6 · doi:10.1007/978-94-011-1026-6 [4] Buong N., Appl. Math. Sci. 2 pp 725– [5] Calvetti D., BIT 43 pp 1– [6] Gallivan K. A., Parallel Algorithms for Matrix Computations (1990) · Zbl 0711.00021 [7] DOI: 10.1515/9783110208276 · Zbl 1145.65037 · doi:10.1515/9783110208276 [8] DOI: 10.1023/A:1008643727926 · Zbl 0924.49009 · doi:10.1023/A:1008643727926 [9] DOI: 10.1016/S0377-0427(00)00412-X · Zbl 0965.65051 · doi:10.1016/S0377-0427(00)00412-X This reference list is based on information provided by the publisher or from digital mathematics libraries. Its items are heuristically matched to zbMATH identifiers and may contain data conversion errors. In some cases that data have been complemented/enhanced by data from zbMATH Open. This attempts to reflect the references listed in the original paper as accurately as possible without claiming completeness or a perfect matching.