Úsh diagonalli matricaǵa iye SATSdı aydaw usılında sanlı sheshiw hám kompyuterde modellestiriw

Authors

Keywords: tridiagonal matrix, Thomas algorithm (TDMA), Gauss method, Jacobi matrix, difference matrix, main diagonal, Thomas coefficients, symmetric matrix, recurrence relations, diagonal dominance condition, boundary conditions

Abstract

The article discusses an efficient numerical algorithm for solving a system of linear algebraic equations (SLAE) with a tridiagonal matrix — the Thomas algorithm (also known as the tridiagonal matrix algorithm, TDMA). The step-by-step description of the algorithm, its advantages, limitations, and applications are provided. The implementation of the developed software product based on this algorithm is also presented. The article is enriched with examples of practical applications.

References

1. Otarov A.A., Allanazarov J.P. Esaplaw usılları. – Nókis: «Bilim», 2006.

2. Самарскии А.А., Гулин А.В. Численне методы математической физики. – Москва: «Наука», 1989.

3. Исаев А.А., Коробов В.И. Численне методы решения задач математической физики. – Москва: «Высшая школа», 1991.

4. Тихонов А.Н., Самарскии А.А. Уравнения математической физики. – Москва: «Наука», 1977.

5. Samandarov B.S., Shixiev R.V., Qazimbetova M.M., Asqarov Q.A. Pythonda programmalastırıw tiykarları. – Tashkent: «Metodist», 2023.