An EM-based iterative method for solving large sparse linear systems

References

• Saad Y. Iterative methods for sparse linear systems. 2nd ed. Philadelphia: SIAM; 2003.
   Google Scholar
• Kennedy WG, Gentle JE. Statistical computing. New York: Dekker; 1980.
   Google Scholar
• Koenker R, Ng P. SparseM: a sparse matrix package for R. J Stat Softw. 2003;8(6):1–9. doi: 10.18637/jss.v008.i06
   Google Scholar
• Aune E, Eidsvik J, Pokern Y. Iterative numerical methods for sampling from high dimensional Gaussian distributions. Stat Comput. 2013;23(4):501–521. doi: 10.1007/s11222-012-9326-8
   Web of Science ®Google Scholar
• Hestenes MR, Stiefel E. Methods of conjugate gradients for solving linear systems. J Res Natl Bur Stand. 1952;49(6):409–436. doi: 10.6028/jres.049.044
   Google Scholar
• Saad Y, Schultz MH. GMRES: a generalized minimal residual algorithm for solving nonsymmetric linear systems. SIAM J Sci Stat Comput. 1986;7(3):856–869. doi: 10.1137/0907058
   Web of Science ®Google Scholar
• Arnoldi WE. The principle of minimized iterations in the solution of the matrix eigenvalue problem. Q Appl Math. 1951;9(1):17–29. doi: 10.1090/qam/42792
   Web of Science ®Google Scholar
• Elman HC. Iterative methods for large, sparse, nonsymmetric systems of linear equations [PhD thesis]. Yale University; 1982.
   Google Scholar
• Young DM, Jea KC. Generalized conjugate-gradient acceleration of nonsymmetrizable iterative methods. Linear Algebra Its Appl. 1980;34:159–194. doi: 10.1016/0024-3795(80)90165-2
   Web of Science ®Google Scholar
• Axelsson O. Conjugate gradient type methods for unsymmetric and inconsistent systems of linear equations. Linear Algebra Its Appl. 1980;29:1–16. doi: 10.1016/0024-3795(80)90226-8
   Web of Science ®Google Scholar
• Saad Y, Schultz MH. Conjugate gradient-like algorithms for solving nonsymmetric linear systems. Math Comput. 1985;44(170):417–424. doi: 10.1090/S0025-5718-1985-0777273-9
   Web of Science ®Google Scholar
• Paige CC, Saunders MA. Solution of sparse indefinite systems of linear equations. SIAM J Num Anal. 1975;12(4):617–629. doi: 10.1137/0712047
   Web of Science ®Google Scholar
• Lanczos C. An iteration method for the solution of the eigenvalue problem of linear differential and integral operators. J Res Natl Bur Stand. 1950;45(4):255–282. doi: 10.6028/jres.045.026
   Google Scholar
• Bostan A, Jeannerod C-P, Schost É. Solving structured linear systems with large displacement rank. Theor Comput Sci. 2008;407(1):155–181. doi: 10.1016/j.tcs.2008.05.014
   Web of Science ®Google Scholar
• Golub GH, Greif C. On solving block-structured indefinite linear systems. SIAM J Sci Comput. 2003;24(6):2076–2092. doi: 10.1137/S1064827500375096
   Web of Science ®Google Scholar
• Ho KL, Greengard L. A fast direct solver for structured linear systems by recursive skeletonization. SIAM J Sci Comput. 2012;34(5):A2507–A2532. doi: 10.1137/120866683
   Web of Science ®Google Scholar
• Embree M. The tortoise and the hare restart GMRES. SIAM Rev. 2003;45(2):259–266. doi: 10.1137/S003614450139961
   Web of Science ®Google Scholar
• Greenbaum A, Pták V, Strakoš Z. Any nonincreasing convergence curve is possible for GMRES. SIAM J Matrix Anal Appl. 1996;17(3):465–469. doi: 10.1137/S0895479894275030
   Web of Science ®Google Scholar
• Vardi Y, Lee D. From image deblurring to optimal investments: maximum likelihood solutions for positive linear inverse problems. J R Stat Soc Series B. 1993;55(3):569–612.
   Google Scholar
• Dempster AP, Laird NM, Rubin DB. Maximum likelihood from incomplete data via the em algorithm. J Royal Stat Soc Series B. 1977;39(1):1–38.
   Google Scholar
• Walker SG. An iterative algorithm for solving sparse linear equations. Commun Stat Simul Comput. 2017;46(7):5113–5122. doi: 10.1080/03610918.2016.1144766
   Web of Science ®Google Scholar
• Csiszar I, Körner J. Information theory: coding theorems for discrete memoryless systems. Cambridge: Cambridge University Press; 2011.
   Google Scholar
• Pinsker M. Information and information stability of random variables and processes. San Francisco (CA): Holden-Day; 1964.
   Google Scholar
• Csiszzár I, Tusnády G. Information geometry and alternating minimization procedures. Stat Decisions. 1984;(Supplemental Issue No. 1):205–237.
   Google Scholar
• Matrix Market. National Institute of Standards and Technology; 2007. Available from: http://math.nist.gov/MatrixMarket.
   Google Scholar
• Van der Vorst HA. Bi-CGSTAB: a fast and smoothly converging variant of Bi-CG for the solution of nonsymmetric linear systems. SIAM J Sci Stat Comput. 1992;13(2):631–644. doi: 10.1137/0913035
   Web of Science ®Google Scholar
• Golub GH, Van Loan CF. Matrix computations. 3rd ed. Baltimore: Johns Hopkins University Press; 2012.
   Google Scholar
• Liesen J, Tichy` P. Convergence analysis of Krylov subspace methods. GAMM-Mitteilungen. 2004;27(2):153–173. doi: 10.1002/gamm.201490008
   Google Scholar
• Eisenstat SC, Elman HC, Schultz MH. Variational iterative methods for nonsymmetric systems of linear equations. SIAM J Numer Anal. 1983;20(2):345–357. doi: 10.1137/0720023
   Web of Science ®Google Scholar
• Chronopoulos AT. s-step iterative methods for (non) symmetric (in) definite linear systems. SIAM J Numer Anal. 1991;28(6):1776–1789. doi: 10.1137/0728088
   Web of Science ®Google Scholar