TABULAR INTEGRATION IN COMPUTING INDEFINITE INTEGRALS
Keywords:
Integration by parts, Tabular method, (DI) algorithm, Recurrence formulasAbstract
This article is devoted to a comparative analysis of the effectiveness of algorithmic methods in computing indefinite integrals, in comparison with traditional recursive formulas. It also aims to provide a scientific justification of the mathematical foundations of tabular integration and its systematic algorithms used in the computational process.
Downloads
References
Abduhamidov, A. U., Nasimov, H. A., Nosirov, U. M., & Husanov, J. H. (2003). Algebra va analiz asoslari. Toshkent: "O‘qituvchi".
Azlarov, T. T., & Mansurov, H. (2005). Matematik analiz (1-jild). Toshkent: "O‘qituvchi".
Berman, G. N. (2005). Matematik analizdan masalalar to‘plami. Toshkent: "O‘qituvchi". (Integrallash texnikasini mashq qilish uchun asosiy manba).
Demidovich, B. P. (2005). Sbornik zadach i uprajneniy po matematicheskomu analizu. Moskva: "Nauka". (Xalqaro standartdagi murakkab misollar uchun).kir
Sa’dullayev, A., Mansurov, H., Xudoyberganov, G., Vorisov, A., & G‘ulomov, R. (2006). Matematik analiz kursi (1-qism). Toshkent: "O‘zbekiston".
Xudoyberganov, G., Vorisov, A. K., & Mansurov, H. T. (2010). Matematik analizdan ma’ruzalar. Toshkent: "Voris-Nashriyot"
Downloads
Published
Conference Proceedings Volume
Section
License

This work is licensed under a Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 International License.
