Browsing by Author "Regmi, Samundra"
Now showing 1 - 13 of 13
- Results Per Page
- Sort Options
Item A Study of Convergence of Sixth-Order Contraharmonic-Mean Newton’s Method (CHN) with Applications and Dynamics(2024-01-10) Singh, Manoj K.; Argyros, Ioannis K.; Regmi, SamundraWe develop the local convergence of the six order Contraharmonic-mean Newton’s method (CHN) to solve Banach space valued equations. Our analysis approach is two fold: The first way uses Taylor’s series and derivatives of higher orders. The second one uses only the first derivatives. We examine the theoretical results by solving a boundary value problem also using the examples relating the proposed method with other’s methods such as Newton’s, Kou’s and Jarratt’s to show that the proposed method performs better. The conjugate maps for second-degree polynomial are verified. We also calculate the fixed points (extraneous). The article is completed with the study of basins of attraction, which support and further validate the theoretical and numerical results.Item Asymptotically Newton-Type Methods without Inverses for Solving Equations(2024-04-02) Argyros, Ioannis K.; George, Santhosh; Shakhno, Stepan; Regmi, Samundra; Havdiak, Mykhailo; Argyros, Michael I.The implementation of Newton’s method for solving nonlinear equations in abstract domains requires the inversion of a linear operator at each step. Such an inversion may be computationally very expensive or impossible to find. That is why alternative iterative methods are developed in this article that require no inversion or only one inversion of a linear operator at each step. The inverse of the operator is replaced by a frozen sum of linear operators depending on the Fréchet derivative of an operator. The numerical examples illustrate that for all practical purposes, the new methods are as effective as Newton’s but much cheaper to implement. The same methodology can be used to create similar alternatives to other methods using inversions of linear operators such as divided differences or other linear operators.Item Comparison between Two Competing Newton-Type High Convergence Order Schemes for Equations on Banach Spaces(2023-10-30) Argyros, Ioannis K.; Singh, Manoj K.; Regmi, SamundraWe carried out a local comparison between two ninth convergence order schemes for solving nonlinear equations, relying on first-order Fréchet derivatives. Earlier investigations require the existence as well as the boundedness of derivatives of a high order to prove the convergence of these schemes. However, these derivatives are not in the schemes. These assumptions restrict the applicability of the schemes, which may converge. Numerical results along with a boundary value problem are given to examine the theoretical results. Both schemes are symmetrical not only in the theoretical results (formation and convergence order), but the numerical and dynamical results are also similar. We calculated the convergence radii of the nonlinear schemes. Moreover, we obtained the extraneous fixed points for the proposed schemes, which are repulsive and are not part of the solution space. Lastly, the theoretical and numerical results are supported by the dynamic results, where we plotted basins of attraction for a selected test function.Item Convergence of Derivative-Free Iterative Methods with or without Memory in Banach Space(2023-09-19) George, Santhosh; Argyros, Ioannis K.; Regmi, SamundraA method without memory as well as a method with memory are developed free of derivatives for solving equations in Banach spaces. The convergence order of these methods is established in the scalar case using Taylor expansions and hypotheses on higher-order derivatives which do not appear in these methods. But this way, their applicability is limited. That is why, in this paper, their local and semi-local convergence analyses (which have not been given previously) are provided using only the divided differences of order one, which actually appears in these methods. Moreover, we provide computable error distances and uniqueness of the solution results, which have not been given before. Since our technique is very general, it can be used to extend the applicability of other methods using linear operators with inverses along the same lines. Numerical experiments are also provided in this article to illustrate the theoretical results.Item Convergence of High-Order Derivative-Free Algorithms for the Iterative Solution of Systems of Not Necessarily Differentiable Equations(2024-02-29) Regmi, Samundra; Argyros, Ioannis K.; George, SanthoshIn this study, we extended the applicability of a derivative-free algorithm to encompass the solution of operators that may be either differentiable or non-differentiable. Conditions weaker than the ones in earlier studies are employed for the convergence analysis. The earlier results considered assumptions up to the existence of the ninth order derivative of the main operator, even though there are no derivatives in the algorithm, and the Taylor series on the finite Euclidian space restricts the applicability of the algorithm. Moreover, the previous results could not be used for non-differentiable equations, although the algorithm could converge. The new local result used only conditions on the divided difference in the algorithm to show the convergence. Moreover, the more challenging semi-local convergence that had not previously been studied was considered using majorizing sequences. The paper included results on the upper bounds of the error estimates and domains where there was only one solution for the equation. The methodology of this paper is applicable to other algorithms using inverses and in the setting of a Banach space. Numerical examples further validate our approach.Item Fixed-Point Results of Generalized (ϕ,Ψ)-Contractive Mappings in Partially Ordered Controlled Metric Spaces with an Application to a System of Integral Equations(2024-06-20) Akram, Mohammad; Alshaikey, Salha; Ishtiaq, Umar; Farhan, Muhammad; Argyros, Ioannis K.; Regmi, SamundraIn this manuscript, we prove numerous results concerning fixed points, common fixed points, coincidence points, coupled coincidence points, and coupled common fixed points for (ϕ,Ψ)-contractive mappings in the framework of partially ordered controlled metric spaces. Our findings introduce a novel perspective on this mathematical context, and we illustrate the uniqueness of our findings through various explanatory examples. Also, we apply the main result to find the existence and uniqueness of the solution of the system of integral equations as an application.Item Generalized Convergence for Multi-Step Schemes under Weak Conditions(2024-01-09) Behl, Ramandeep; Argyros, Ioannis K.; Alshehri, Hashim; Regmi, SamundraWe have developed a local convergence analysis for a general scheme of high-order convergence, aiming to solve equations in Banach spaces. A priori estimates are developed based on the error distances. This way, we know in advance the number of iterations required to reach a predetermined error tolerance. Moreover, a radius of convergence is determined, allowing for a selection of initial points assuring the convergence of the scheme. Furthermore, a neighborhood that contains only one solution to the equation is specified. Notably, we present the generalized convergence of these schemes under weak conditions. Our findings are based on generalized continuity requirements and contain a new semi-local convergence analysis (with a majorizing sequence) not seen in earlier studies based on Taylor series and derivatives which are not present in the scheme. We conclude with a good collection of numerical results derived from applied science problems.Item Generalized Iterative Method of Order Four with Divided Differences(2023-09-07) Regmi, Samundra; Argyros, Ioannis K.; Deep, GaganNumerous applications from diverse disciplines are formulated as an equation or system of equations in abstract spaces such as Euclidean multidimensional, Hilbert, or Banach, to mention a few. Researchers worldwide are developing methodologies to handle the solutions of such equations. A plethora of these equations are not differentiable. These methodologies can also be applied to solve differentiable equations. A particular method is utilized as a sample via which the methodology is described. The same methodology can be used on other methods utilizing inverses of linear operators. The problem with existing approaches on the local convergence of iterative methods is the usage of Taylor expansion series. This way, the convergence is shown but by assuming the existence of high-order derivatives which do not appear on the iterative methods. Moreover, bounds on the error distances that can be computed are not available in advance. Furthermore, the isolation of a solution of the equation is not discussed either. These concerns reduce the applicability of iterative methods and constitute the motivation for developing this article. The novelty of this article is that it positively addresses all these concerns under weaker convergence conditions. Finally, the more important and harder to study semi-local analysis of convergence is presented using majorizing scalar sequences. Experiments are further performed to demonstrate the theory.Item Hybrid Newton-like Inverse Free Algorithms for Solving Nonlinear Equations(2024-04-10) Argyros, Ioannis K.; George, Santhosh; Regmi, Samundra; Argyros, Christopher I.Iterative algorithms requiring the computationally expensive in general inversion of linear operators are difficult to implement. This is the reason why hybrid Newton-like algorithms without inverses are developed in this paper to solve Banach space-valued nonlinear equations. The inverses of the linear operator are exchanged by a finite sum of fixed linear operators. Two types of convergence analysis are presented for these algorithms: the semilocal and the local. The Fréchet derivative of the operator on the equation is controlled by a majorant function. The semi-local analysis also relies on majorizing sequences. The celebrated contraction mapping principle is utilized to study the convergence of the Krasnoselskij-like algorithm. The numerical experimentation demonstrates that the new algorithms are essentially as effective but less expensive to implement. Although the new approach is demonstrated for Newton-like algorithms, it can be applied to other single-step, multistep, or multipoint algorithms using inverses of linear operators along the same lines.Item On the Kantorovich Theory for Nonsingular and Singular Equations(2024-05-28) Argyros, Ioannis K.; George, Santhosh; Regmi, Samundra; Argyros, Michael I.We develop a new Kantorovich-like convergence analysis of Newton-type methods to solve nonsingular and singular nonlinear equations in Banach spaces. The outer or generalized inverses are exchanged by a finite sum of linear operators making the implementation of these methods easier than in earlier studies. The analysis uses relaxed generalized continuity of the derivatives of operators involved required to control the derivative and on real majorizing sequences. The same approach can also be implemented on other iterative methods with inverses. The examples complement the theory by verifying the convergence conditions and demonstrating the performance of the methods.Item Parameter Choice Strategy That Computes Regularization Parameter before Computing the Regularized Solution(2024-05-13) George, Santhosh; Padikkal, Jidesh; Kunnarath, Ajil; Argyros, Ioannis K.; Regmi, SamundraThe modeling of many problems of practical interest leads to nonlinear ill-posed equations (for example, the parameter identification problem (see the Numerical section)). In this article, we introduce a new source condition (SC) and a new parameter choice strategy (PCS) for the Tikhonov regularization (TR) method for nonlinear ill-posed problems. The new PCS is introduced using a new SC to compute the regularization parameter (RP) before computing the regularized solution. The theoretical results are verified using a numerical example.Item Symmetric-Type Multi-Step Difference Methods for Solving Nonlinear Equations(2024-03-08) Argyros, Ioannis K.; Shakhno, Stepan; Regmi, Samundra; Yarmola, Halyna; Argyros, Michael I.Symmetric-type methods (STM) without derivatives have been used extensively to solve nonlinear equations in various spaces. In particular, multi-step STMs of a higher order of convergence are very useful. By freezing the divided differences in the methods and using a weight operator a method is generated using m steps (m a natural number) of convergence order 2 m. This method avoids a large increase in the number of operator evaluations. However, there are several problems with the conditions used to show the convergence: the existence of high order derivatives is assumed, which are not in the method; there are no a priori results for the error distances or information on the uniqueness of the solutions. Therefore, the earlier studies cannot guarantee the convergence of the method to solve nondifferentiable equations. However, the method may converge to the solution. Thus, the convergence conditions can be weakened. These problems arise since the convergence order is determined using the Taylor series which requires the existence of high-order derivatives which are not present in the method, and they may not even exist. These concerns are our motivation for authoring this article. Moreover, the novelty of this article is that all the aforementioned problems are addressed positively, and by using conditions only related to the divided differences in the method. Furthermore, a more challenging and important semi-local analysis of convergence is presented utilizing majorizing sequences in combination with the concept of the generalized continuity of the divided difference involved. The convergence is also extended from the Euclidean to the Banach space. We have chosen to demonstrate our technique in the present method. But it can be used in other studies using the Taylor series to show the convergence of the method. The applicability of other single- or multi-step methods using the inverses of linear operators with or without derivatives can also be extended with the same methodology along the same lines. Several examples are provided to test the theoretical results and validate the performance of the method.Item Three-Step Derivative-Free Method of Order Six(2023-09-11) Kumar, Sunil; Sharma, Janak Raj; Argyros, Ioannis K.; Regmi, SamundraDerivative-free iterative methods are useful to approximate the numerical solutions when the given function lacks explicit derivative information or when the derivatives are too expensive to compute. Exploring the convergence properties of such methods is crucial in their development. The convergence behavior of such approaches and determining their practical applicability require conducting local as well as semi-local convergence analysis. In this study, we explore the convergence properties of a sixth-order derivative-free method. Previous local convergence studies assumed the existence of derivatives of high order even when the method itself was not utilizing any derivatives. These assumptions imposed limitations on its applicability. In this paper, we extend the local analysis by providing estimates for the error bounds of the method. Consequently, its applicability expands across a broader range of problems. Moreover, the more important and challenging semi-local convergence not investigated in earlier studies is also developed. Additionally, we survey recent advancements in this field. The outcomes presented in this paper can be proved valuable to practitioners and researchers engaged in the development and analysis of derivative-free numerical algorithms. Numerical tests illuminate and validate further the theoretical results.