Combining randomized and deterministic iterative algorithms for high accuracy solution of large linear systems and boundary integral equations

References

[1] E. Carson and N. J. Higham, A new analysis of iterative refinement and its application to accurate solution of ill-conditioned sparse linear systems, SIAM J. Sci. Comput. 39 (2017), no. 6, A2834–A2856. 10.1137/17M1122918Search in Google Scholar

[2] E. Carson and N. J. Higham, Accelerating the solution of linear systems by iterative refinement in three precisions, SIAM J. Sci. Comput. 40 (2018), no. 2, A817–A847. 10.1137/17M1140819Search in Google Scholar

[3] E. J. Craig, The N-step iteration procedures, J. Math. Phys. 34 (1955), 64–73. 10.1002/sapm195534164Search in Google Scholar

[4] H. C. Elman, D. J. Silvester and A. J. Wathen, Finite Elements and Fast Iterative Solvers: With Applications in Incompressible Fluid Dynamics, 2nd ed., Numer. Math. Sci. Comput., Oxford University, Oxford, 2014. 10.1093/acprof:oso/9780199678792.001.0001Search in Google Scholar

[5] J. H. Halton, Sequential Monte Carlo techniques for the solution of linear systems, J. Sci. Comput. 9 (1994), no. 2, 213–257. 10.1007/BF01578388Search in Google Scholar

[6] J. H. Halton, Sequential Monte Carlo for linear systems—a practical summary, Monte Carlo Methods Appl. 14 (2008), no. 1, 1–27. 10.1515/MCMA.2008.001Search in Google Scholar

[7] N. J. Higham, Accuracy and Stability of Numerical Algorithms, 2nd ed., Society for Industrial and Applied Mathematics, Philadelphia, 2002. 10.1137/1.9780898718027Search in Google Scholar

[8] N. J. Higham and T. Mary, A new approach to probabilistic rounding error analysis, SIAM J. Sci. Comput. 41 (2019), no. 5, A2815–A2835. 10.1137/18M1226312Search in Google Scholar

[9] N. J. Higham and T. Mary, Mixed precision algorithms in numerical linear algebra, Acta Numer. 31 (2022), 347–414. 10.1017/S0962492922000022Search in Google Scholar

[10] A. Kireeva, I. Aksyuk and K. K. Sabelfeld, Two stochastic algorithms for solving elastostatics problems governed by the Lamé equation, Monte Carlo Methods Appl. 29 (2023), no. 2, 143–160. 10.1515/mcma-2023-2008Search in Google Scholar

[11] M. Mascagni and N. A. Simonov, The random walk on the boundary method for calculating capacitance, J. Comput. Phys. 195 (2004), no. 2, 465–473. 10.1016/j.jcp.2003.10.005Search in Google Scholar

[12] C. Moler, Iterative refinement in floating point, J. ACM 14 (1967), no. 2, 316–321. 10.1145/321386.321394Search in Google Scholar

[13] Y. Nakatsukasa and J. A. Tropp, Fast and accurate randomized algorithms for linear systems and eigenvalue problems, SIAM J. Matrix Anal. Appl. 45 (2024), no. 2, 1183–1214. 10.1137/23M1565413Search in Google Scholar

[14] Y. Saad, Numerical Methods for Large Eigenvalue Problems, Classics Appl. Math. 66, Society for Industrial and Applied Mathematics, Philadelphia, 2011. 10.1137/1.9781611970739Search in Google Scholar

[15] K. K. Sabelfeld, Vector algorithms of the Monte Carlo method for solving systems of second-order elliptic equations and the Lamé equation, Dokl. Akad. Nauk SSSR 262 (1982), no. 5, 1076–1080. Search in Google Scholar

[16] K. K. Sabelfeld, Vector Monte Carlo stochastic matrix-based algorithms for large linear systems, Monte Carlo Methods Appl. 22 (2016), no. 3, 259–264. 10.1515/mcma-2016-0112Search in Google Scholar

[17] K. K. Sabelfeld, A new randomized vector algorithm for iterative solution of large linear systems, Appl. Math. Lett. 126 (2022), Article ID 107830. 10.1016/j.aml.2021.107830Search in Google Scholar

[18] K. K. Sabelfeld and G. Agarkov, Randomized vector algorithm with iterative refinement for solving boundary integral equations, Monte Carlo Methods Appl. 30 (2024), no. 4, 375–388. 10.1515/mcma-2024-2022Search in Google Scholar

[19] K. K. Sabelfeld and A. E. Kireeva, Randomized iterative linear solvers with refinement for large dense matrices, Monte Carlo Methods Appl. 29 (2023), no. 4, 357–378. 10.1515/mcma-2023-2013Search in Google Scholar

[20] K. K. Sabelfeld and N. A. Simonov, Random Walks on Boundary for Solving PDEs, VSP, Utrecht, 1994. 10.1515/9783110942026Search in Google Scholar

[21] K. K. Sabelfeld and N. A. Simonov, Stochastic Methods for Boundary Value Problems. Numerics for High-Dimensional PDEs and Applications, De Gruyter, Berlin, 2016. 10.1515/9783110479454Search in Google Scholar

[22] R. Sugimoto, T. Chen, Y. Jiang, C. Batty and T. Hachisuka, A practical walk-on-boundary method for boundary value problems, ACM Trans. Graph. 42 (2023), no. 4, Paper No. 81. 10.1145/3592109Search in Google Scholar

[23] J. A. Tropp, A. Yurtsever, M. Udell and V. Cevher, Streaming low-rank matrix approximation with an application to scientific simulation, SIAM J. Sci. Comput. 41 (2019), no. 4, A2430–A2463. 10.1137/18M1201068Search in Google Scholar

[24] A. J. Walker, New fast method for generating discrete random numbers with arbitrary frequency distributions, Electron. Lett. 10 (1974), no. 8, 127–128. 10.1049/el:19740097Search in Google Scholar

[25] J. H. Wilkinson, Rounding Errors in Algebraic Processes, Prentice-Hall, Englewood Cliffs, 1963. 10.2307/2002959Search in Google Scholar