Home / Current Issue / Paper 1722139
Numerical Methods for Solving Nonlinear Equations in Engineering Problems
Subject area: Science,Engineering and Technology · Area of research: Numerical Methods in Engineering
Abstract
Nonlinear equations are fundamental in engineering and applied physics, appearing in structural mechanics, thermodynamics, electrical systems, fluid dynamics, and control theory. Due to the inherent nonlinearity of governing equations, analytical solutions are rarely obtainable, necessitating numerical approximation techniques. This paper presents a rigorous mathematical framework for analyzing iterative methods used to solve nonlinear equations of the form. We study five classical numerical methods: Bisection Method, Newton–Raphson Method, Secant Method, Fixed Point Iteration, and Regula Falsi Method. The focus is on convergence theory, stability conditions, and error propagation behavior. Using tools from real analysis, including the Intermediate Value Theorem, Taylor series expansion, and Banach contraction mapping theorem, we derive sufficient conditions for convergence and explicit error bounds. The study further investigates convergence rates, showing that Newton’s method achieves quadratic convergence while secant method achieves superlinear convergence. The results provide a mathematically rigorous foundation for selecting numerical methods in computational engineering problems where accuracy, efficiency, and stability are critical.
How to cite this paper
@article{1722139,
author = {Lavkush Pandey},
title = {Numerical Methods for Solving Nonlinear Equations in Engineering Problems},
journal = {Iconic Research And Engineering Journals},
year = {2026},
volume = {10},
number = {1},
pages = {3964-3970},
issn = {2456-8880},
url = {https://www.irejournals.com/formatedpaper/1722139.pdf},
abstract = {Nonlinear equations are fundamental in engineering and applied physics, appearing in structural mechanics, thermodynamics, electrical systems, fluid dynamics, and control theory. Due to the inherent nonlinearity of governing equations, analytical solutions are rarely obtainable, necessitating numerical approximation techniques. This paper presents a rigorous mathematical framework for analyzing iterative methods used to solve nonlinear equations of the form. We study five classical numerical methods: Bisection Method, Newton–Raphson Method, Secant Method, Fixed Point Iteration, and Regula Falsi Method. The focus is on convergence theory, stability conditions, and error propagation behavior. Using tools from real analysis, including the Intermediate Value Theorem, Taylor series expansion, and Banach contraction mapping theorem, we derive sufficient conditions for convergence and explicit error bounds. The study further investigates convergence rates, showing that Newton’s method achieves quadratic convergence while secant method achieves superlinear convergence. The results provide a mathematically rigorous foundation for selecting numerical methods in computational engineering problems where accuracy, efficiency, and stability are critical.},
month = {July},
}