Ramandeep Behl
Assistant Professor
Research Interests
Make your next move.
Prepare your application
Review drafts before you send them.
Explore related searches
Articles (16)
Year:
2027
Year:
2026
Year:
2025
Year:
2025
Year:
2025
Year:
2025
High-order iterative techniques without derivatives for multiple roots have wide-ranging applications in the following: optimization tasks, where the objective function lacks explicit derivatives or is computationally expensive to evaluate; engineering; design finance; data science; and computational physics. The versatility and robustness of derivative-free fourth-order methods make them a valuable tool for tackling complex real-world optimization challenges. An optimal extension of the Traub–Steffensen technique for finding multiple roots is presented in this work. In contrast to past studies, the new expanded technique effectively handles functions with multiple zeros. In addition, a theorem is presented to analyze the convergence order of the proposed technique. We also examine the convergence analysis for four real-life problems, namely, Planck’s law radiation, Van der Waals, the Manning equation for isentropic supersonic flow, the blood rheology model, and two well-known academic problems. The efficiency of the approach and its convergence behavior are studied, providing valuable insights for practical and academic applications.
Year:
2023
We propose a new optimal iterative scheme without memory free from derivatives for solving non-linear equations. There are many iterative schemes existing in the literature which either diverge or fail to work when f′(x)=0. However, our proposed scheme works even in these cases. In addition, we extended the same idea for iterative methods with memory with the help of self-accelerating parameters estimated from the current and previous approximations. As a result, the order of convergence increased from four to seven without the addition of any further functional evaluation. To confirm the theoretical results, numerical examples and comparisons with some of the existing methods are included which reveal that our scheme is more efficient than the existing schemes. Furthermore, basins of attraction are also included to describe a clear picture of the convergence of the proposed method as well as some of the existing methods.
Year:
2023
In this manuscript, we introduce a two‐step convergent iterative scheme to compute the roots with multiplicity of nonlinear equations. Most of the schemes in literature have flexibility at either first substep or second step, while our scheme has the flexibility of choice at both substeps so that many existing methods are obtained as special cases. Our scheme has another advantage over earlier studies: It not only works for but also . It is shown that the methods obtained by our scheme are optimal as they satisfy Kung–Traub conjecture. Several physical and chemical examples are considered to check the performance of the methods and to analyze the theoretical results, and it is found that our methods show preferred outcomes over the existing schemes. Likewise, the basins of attraction of the schemes also confirm the same results for the performance of the suggested techniques over the compared ones.
Year:
2023
Year:
2023
Year:
2023
Year:
2023
Year:
2023
Year:
2023
Year:
2023
Year:
2022
Collaborators (5)
Azizah Alrajhi
-
HIGINIO RAMOS
Profesor
Universidad de Salamanca
Juan R Torregrosa
Subdirector de investigación
Universitat Politècnica de València
Changbum Chun
-
Eulalia Martínez
PROFESORA TITULAR DE UNIVERSIDAD
Universitat Politècnica de València
Make your next move.
Prepare your application
Review drafts before you send them.