Iterative Krylov subspace methods for large sparse linear systems
Saurabh Saojisaurabh.saoji22@gmail.comDepartment of Computer Engineering Nutan Maharashtra Institute of Engineering and TechnologyDepartment of Computer Engineering Nutan Maharastra Institute of Engineering and TechnologyPune, Maharashtra, 410507, IndiaView full profile → , *Budigi PrabhakarCorresponding authorbudigi.prabhakar@niu.edu.inDepartment of Physics Noida International UniversityDepartment of Physics Noida International UniversityGreater Noida, Uttar Pradesh, 203201, IndiaView full profile → , Mikhal Johnjohnmikhal@rknec.eduSchool of Computer Science & Engineering Shri. Ramdevbaba College of Engineering and Management Ramdeobaba UniversityNagpur, Maharashtra, IndiaView full profile → , Kiran Inglekiran.ingle@vit.eduDepartment of Electronics and Telecommunication Engineering Vishwakarma Institute of TechnologyPune, Maharashtra, 411037, IndiaView full profile → , Vrushali G. Rautvrushaliraut4@gmail.comDepartment of Electronics & Telecommunication Sinhgad College of EngineeringPune, Maharashtra, 411041, IndiaView full profile → , K. Nagendra Prasadnagendraprasad1@gmail.comDepartment of Computer Science and Engineering KKR and KSR Institute of Technology and SciencesDepartment of Computer Science and Engineering - Artificial Intelligence KKR and KSR Institute of Technology and SciencesGuntur, Andhra Pradesh, 522017, IndiaView full profile →
* Corresponding author · click or hover a name for details
- Received:
- 10 Dec 2024
- Published Online:
- 30 Sep 2025
- Article type:
- Research Article
- Language:
- EN
- Article no.:
- JIM-2362
- Pages:
- 2207–2215
Abstract
Keywords
Subject Classifications
References
[1] L. Reichel and M. M. Spalević, “Averaged Gauss quadrature formulas: Properties and applications,” J. Comput. Appl. Math., vol. 410, pp. 114232 (2022).
[2] D. L. Djukić, R. M. Mutavdzić Djukić, L. Reichel, and M. M. Spalević, “Weighted averaged Gaussian quadrature rules for modified Chebyshev measures,” Appl. Numer. Math., vol. 200, pp. 195–208 (2024).
[3] O. Balabanov and L. Grigori, “Randomized Gram-Schmidt process with application to GMRES,” SIAM J. Sci. Comput., vol. 44, pp. A1450–A1474 (2022).
[4] S. Xu and F. Xue, “Inexact rational Krylov subspace methods for approximating the action of functions of matrices,” Electron. Trans. Numer. Anal., vol. 58, pp. 538–567 (2023).
[5] C. S. Liu, C. W. Chang, and C. L. Kuo, “Re-orthogonalized/affine GMRES and orthogonalized maximal projection algorithm for solving linear systems,” Algorithms, vol. 17, pp. 266 (2024).
[6] F. Bouyghf, A. Messaoudi, and H. Sadok, “A unified approach to Krylov subspace methods for solving linear systems,” Numer. Algor., vol. 96, pp. 305–332 (2024).
[7] A. B. Gavali, B. P. Gorakh, B. O. Ramchandra, B. T. Tukaram, and E. A. Suresh, “Exploring Assistive Vision Technologies for the Visually Impaired: A Comprehensive Review,” Int. J. Recent Adv. Eng. Technol. (IJRAET), vol. 13, no. 2, pp. 28–34 (Mar. 2025).
[8] C. S. Liu and C. W. Chang, “The SOR and AOR methods with stepwise optimized values of parameters for the iterative solutions of linear systems,” Contemp. Math., vol. 5, pp. 4013–4028 (2024).
[9] V. B. K. Vatti, G. C. Rao, and S. S. Pai, “Reaccelerated over relaxation (ROR) method,” Bull. Int. Math. Virtual Inst., vol. 10, pp. 315–324 (2020).
[10] C. Bedjguelel, H. Gharout, and B. Farhi, “Dynamics analysis of the modified Beverton-Holt model,” J. Interdiscip. Math., vol. 27, no. 6, pp. 1257–1271 (2024), doi: 10.47974/JIM-1748.
[11] S. J. Desai and K. G. Kharade, “Stock Market Price Prediction Using LSTM,” Int. J. Adv. Comput. Theory Eng., vol. 14, no. 1, pp. 16–19 (Apr. 2025).
[12] A. Godbole, R. Dhabliya, V. Deshpande, S. A. Sivakumar, B. M. Shankar, and V. Khetani, “Ethical hacking and penetration testing strengthening cybersecurity posture through offensive security measures,” J. Discrete Math. Sci. Cryptogr., vol. 27, no. 4, pp. 1295–1305 (2024).
