The aim of this paper is to propose an efficient three steps iterative method for finding the zeros of the nonlinear equation f(x)=0 . Starting with a suitably chosen , the method generates a sequence of iterates converging to the root. The convergence analysis is proved to establish its five order of convergence. Several examples are given to illustrate the efficiency of the proposed new method and its comparison with other methods.

     Estimating multivariate location and scatter with both affine equivariance and positive break down has always been difficult. Awell-known estimator which satisfies both properties is the Minimum volume Ellipsoid Estimator (MVE) Computing the exact (MVE) is often not feasible, so one usually resorts to an approximate Algorithm. In the regression setup, algorithm for positive-break down estimators like Least Median of squares typically recomputed the intercept at each step, to improve the result. This approach is called intercept adjustment. In this paper we show that a similar technique, called location adjustment, Can be applied to the (MVE). For this purpose we use the Minimum Volume Ball (MVB). In order

In this paper, the computational complexity will be reduced using a revised version of the selected mapping (SLM) algorithm. Where a partial SLM is achieved to reduce the mathematical operations around 50%. Although the peak to average power ratio (PAPR) reduction gain has been slightly degraded, the dramatic reduction in the computational complexity is an outshining achievement. Matlab simulation is used to evaluate the results, where the PAPR result shows the capability of the proposed method.  

The Mannich base ligand was synthesized in an ethanol medium through a condensation reaction of 2-mercaptobenzimidazole and ciprofloxacin at room temperature. Subsequently, several metal complexes of this ligand were prepared. To characterize both the base ligand and the metal complexes, various techniques were employed, including elemental analysis, FT-IR spectroscopy, UV-Vis spectroscopy, molar conductivity measurements, magnetic moment determination, and melting point analysis. The results were shown that the metal complexes formed have the formula [Cr(L)2Cl2] Cl.H2O and [Rh(L)2(H2O)2] Cl3.H2O, where L= mannich base ligand. Based on spectroscopic analytical, coordination with metal ions involves the 'N' donor atom of mannich base

The study aimed to recommend a new spectrophotometric-kinetic method for determination of carbamazepine (CABZ) in its pure form and pharmaceutical forms. The proposed procedure based on the coupling of CABZ with diazotized sulfanilic acid in basic medium to yield a colored azo dye. Factors affecting the reaction yield were studied and the conditions were optimized. The colored product was followed spectrophotometrically via monitoring its absorbance at 396 nm. Under the optimized conditions, two method (the initial rate and fixed time (10 minute)) were applied for constructing the calibration graphs. The graphs were linear in concentration ranges 2.0 to 18.0 µg.mL^-1 for both methods. The proposed was applied successfully in

The objective of an Optimal Power Flow (OPF) algorithm is to find steady state operation point which minimizes generation cost, loss etc. while maintaining an acceptable system performance in terms of limits on generators real and reactive powers, line flow limits etc. The OPF solution includes an objective function. A common objective function concerns the active power generation cost. A Linear programming method is proposed to solve the OPF problem. The Linear Programming (LP) approach transforms the nonlinear optimization problem into an iterative algorithm that in each iteration solves a linear optimization problem resulting from linearization both the objective function and constrains. A computer program, written in MATLAB environme

This study emphasizes the infinite-boundary integro-differential equation. To examine the approximate solution of the problem, two modified optimization algorithms are proposed based on generalized Laguerre functions. In the first technique, the proposed method is applied to the original problem by approximating the solution using the truncated generalized Laguerre polynomial of the unknown function, optimizing coefficients through error minimization, and transforming the integro-differential equation into an algebraic equation. In contrast, the second approach incorporates a penalty term into the objective function to effectively enforce boundary and integral constraints. This technique reduces the original problem to a mathematical optimi

.