- Хаким Дододжанович Икрамов, Khakim Dododzhanovich Ikramov, “Об эффективных алгоритмах декомплексификации матриц посредством унитарных подобий и конгруэнций”, Математические заметки, 92, no. 6, 2012, 856
- Yuji Nakatsukasa, Roland W. Freund, “Computing Fundamental Matrix Decompositions Accurately via the Matrix Sign Function in Two Iterations: The Power of Zolotarev's Functions”, SIAM Rev., 58, no. 3, 2016, 461
- Alan George, Kh. Ikramov, “Addendum: Is The Polar Decomposition Finitely Computable?”, SIAM J. Matrix Anal. & Appl., 18, no. 1, 1997, 264
- Kh. D. Ikramov, “Effective algorithms for decomplexifying a matrix by unitary similarities or congruences”, Math Notes, 92, no. 5-6, 2012, 767