[1] R. H. Bartels and G. W. Stewart, Solution of the matrix equation AX+XB=C [F4], Commun. ACM, 15 (1972), pp. 820–826.
[2] C. A. Bavely and G. W. Stewart, An algorithm for computing reducing subspaces by block diagonalization, SIAM J. Numer. Anal., 16 (1979), pp. 359–367.
[3] P. Benner, E. S. Quintana-Ort´ı, and G. Quintana-Ort´ı, Solving stable Sylvester equations via rational iterative schemes, J. Sci. Comput., 28 (2006), pp. 51–83.
[4] A.-L. Cirneanu and C.-E. Moldoveanu, Use of digital technology in integrated mathematics education, Appl. Syst. Innov., 7 (2024).
[5] M. Dehghan and M. Hajarian, Determination of a matrix function using the divided difference method of Newton and the interpolation technique of Hermite, J. Comput. Appl. Math., 231 (2009), pp. 67–81.
[6] , Computing matrix functions using mixed interpolation methods, Math. Comput. Modelling, 52 (2010),pp. 826–836.
[7] M. Dehghan, G. Karamali, and A. Shirilord, An iterative scheme for a class of generalized Sylvester matrix equations, AUT J. Math. Comput., 5 (2024), pp. 195–215.
[8] M. Dehghan and A. Shirilord, Matrix multisplitting Picard-iterative method for solving generalized absolute value matrix equation, Appl. Numer. Math., 158 (2020), pp. 425–438.
[9] , On the Hermitian and skew-Hermitian splitting-like iteration approach for solving complex continuous- time algebraic Riccati matrix equation, Appl. Numer. Math., 170 (2021), pp. 109–127.
[10] N. J. Higham, Computing real square roots of a real matrix, Linear Algebra Appl., 88/89 (1987), pp. 405–430.
[11] , Stable iterations for the matrix square root, Numer. Algorithms, 15 (1997), pp. 227–242.
[12] , Functions of Matrices, Society for Industrial and Applied Mathematics (SIAM), Philadelphia, PA, 2008. Theory and Computation.
[13] R. A. Horn and C. R. Johnson, Topics in matrix analysis, Cambridge University Press, 1991.
[14] B. Iannazzo, On the Newton method for the matrix pth root, SIAM J. Matrix Anal. Appl., 28 (2006), pp. 503– 523.
[15] M. Kim, J. Kim, and W. Lee, Intellectual disabilities and programming: Improving computational thinking- based problem solving, Educ. Inf. Technol., (2025).
[16] D. Lambi´c, Presenting practical application of mathematics by the use of programming software with easily available visual components, Teach. Math. Appl., 30 (2011), pp. 10–18.
[17] J. Li, Z. Mei, and X. Kong, A new version of the Smith method for solving Sylvester equation and discrete- time Sylvester equation, J. Appl. Anal. Comput., 6 (2016), pp. 582–599.
[18] W. Malmia, S. H. Makatita, S. Lisaholit, A. Azwan, I. Magfirah, H. Tinggapi, and M. C. B. Umanailo, Problem-based learning as an effort to improve student learning outcomes, Int. J. Sci. Technol. Res, 8 (2019), pp. 1140–1143.
[19] M. Moccari, Smoothing the absolute value equations by the component-wise analysis, J. Math. Model., 13 (2025), pp. 251–262.
[20] M. Moccari, T. Lotfi, and V. Torkashvand, On the stability of a two-step method for a fourth-degree family by computer designs along with applications, Int. J. Nonlinear Anal. Appl., 14 (2023), pp. 261–282
[21] B. N. Parlett, A recurrence among the elements of functions of triangular matrices, Linear Algebra Appl., 14 (1976), pp. 117–121.
[22] G. Polya, How to Solve It. A New Aspect of Mathematical Method, Princeton University Press, Princeton, NJ, 1948.
[23] A. Shirilord and M. Dehghan, Closed-form solution of non-symmetric algebraic Riccati matrix equation, Appl. Math. Lett., 131 (2022), pp. Paper No. 108040, 10.
[24] M. Z. Ullah, V. Torkashvand, S. Shateyi, and M. Asma, Using matrix eigenvalues to construct an iterative method with the highest possible efficiency index two, Mathematics, 10 (2022), p. 1370.
[25] S. Wolfram, Mathematica, Wolfram Media, 1999.
