PROGRAMMING USING SEIDEL AND NEWTON METHODS TO SOLVE CURVILINEAR NODAL STRESS EQUATIONS IN PYTHON

Main Article Content

Aktamov Shokhzod

Abstract

The Seidel and Newton methods discussed in this article provide solutions for solving curvilinear nodal stress equations in Python. The Seidel method is an iterative technique that updates nodal displacements sequentially until convergence is achieved, while the Newton method utilizes linearization and solves a linear system of equations to obtain the update in nodal displacements.These methods are widely used in engineering fields such as structural analysis and finite element analysis to analyze the stress distribution within complex structures. By implementing the Seidel or Newton method in Python, engineers and analysts can efficiently solve the nonlinear equations and obtain converged nodal displacements. It is important to note that the accuracy and convergence of these methods depend on the nature of the stress equations, the initial guess for nodal displacements, and the chosen convergence criteria. Sensitivity to the initial guess and appropriate convergence criteria should be considered to ensure reliable results. Additionally, validation and verification of the computational model using analytical solutions, experimental data, or benchmark examples are essential steps to ensure the accuracy and reliability of the implemented methods and the numerical model itself. Overall, the Seidel and Newton methods provide powerful tools for solving curvilinear nodal stress equations and can aid in the accurate analysis of structural systems. By understanding the concepts and considerations of these methods, engineers and analysts can make informed decisions and obtain valuable insights into the behavior and performance of the structures under study.

Article Details

How to Cite
Aktamov Shokhzod. (2023). PROGRAMMING USING SEIDEL AND NEWTON METHODS TO SOLVE CURVILINEAR NODAL STRESS EQUATIONS IN PYTHON. Galaxy International Interdisciplinary Research Journal, 11(6), 188–193. Retrieved from https://internationaljournals.co.in/index.php/giirj/article/view/4152
Section
Articles

References

Ratschek H. Teilbarkeitskriterien der Intervallarithmetik // Journal fЁur die reine und angewandte Mathematik. – 1972. – Bd. 252. – S. 128–138.

Rump S. M. Introduction to ACRITH — accurate scientific algorithms // Computerarithmetic, Scientific Computation and Programming Languages / Ed.:

S.M. Markov (Ed.), Scientific Computation and «Mathematical» Modelling, DATECS Publishing, Sofia, 1993.

«Elektr tarmoqlari va tizimlari» fanidan kurs loyihasini bajarish bo‘yicha uslubiy qo‘llanma./Sharipov U.B., Xamidov Sh.V., Xaydarov S.J. – T.: ToshDTU, 2003.

G‘oyibov T.Sh. Elektr tarmoqlari va tizimlari/O‘quv qo‘llanma. – T.: «Voris-nashriyot». 2010. 160 b.