in this study, we modify an iterative non-optimal without memory method, in such a way that is becomes optimal. therefore, we obtain convergence order eight with the some functional evaluations. to justify our proposed method, some numerical examples are given.

in this paper, downlink resource allocation for a sparse code multiple access (scma) based heterogeneous  cellular networks (hcn) is investigated. the main aim of this paper is to obtain joint power allocation and codebook assignment to achieve the least total system transmit power. in this regard, the proposed objective function is formulated as total transmit power subject to users minimum ra...

begin{abstract} In this paper, we introduce an iterative method for amenable semigroup of non expansive mappings and infinite family of non expansive mappings in the frame work of Hilbert spaces. We prove the strong convergence of the proposed iterative algorithm to the unique solution of a variational inequality, which is the optimality condition for a minimization problem. The results present...

Theobjective in this paper to study and present a new iterative method possessing high convergence order for calculating the polar decompostion of a matrix. To do this, it is shown that the new scheme is convergent and has high convergence. The analytical results are upheld via numerical simulations and comparisons.

In this research article, we present sixteenth-order iterative method for solving nonlinear equations. The Iterative method has optimal order of convergence sixteen in the sense of Kung-Traub conjecture [1], It means iterative scheme uses five function evaluations to achieve 16(= 25−1) order of convergence. The proposed iterative method utilize one derivative evaluation and weight functions. Nu...

consider the following consistent sylvester tensor equation[mathscr{x}times_1 a +mathscr{x}times_2 b+mathscr{x}times_3 c=mathscr{d},]where the matrices $a,b, c$ and the tensor $mathscr{d}$ are given and $mathscr{x}$ is the unknown tensor. the current paper concerns with examining a simple and neat framework for accelerating the speed of convergence of the gradient-based iterative algorithm and ...

In the current study we investigate the two-stage iterative method for solving linear systems. Our new results shows which splitting generates convergence fast in iterative methods. Finally, we solve the Poisson-Block tridiagonal matrix from Poisson's equation which arises in mechanical engineering and theoretical physics. Numerical computations are presented based on a particular linear system...

This paper deals with numerical solving semilinear parabolic problems based on the method of upper and lower solutions. A monotone iterative method with quadratic convergence rate is constructed. The monotone iterative method combines an explicit construction of initial upper and lower solutions and the modified accelerated monotone iterative method. The monotone iterative method leads to the e...