it is well known that if the coefficient matrix in a linear system is large and sparse or sometimes not readily available, then iterative solvers may become the only choice. the block solvers are an attractive class of iterative solvers for solving linear systems with multiple right-hand sides. in general, the block solvers are more suitable for dense systems with preconditioner. in this paper,...

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...

lsmr (least squares minimal residual) is an iterative method for the solution of the linear system of equations and leastsquares problems. this paper presents a block version of the lsmr algorithm for solving linear systems with multiple right-hand sides. the new algorithm is based on the block bidiagonalization and derived by minimizing the frobenius norm of the resid ual matrix of normal equa...

Introduction: Recent studies of Computed Tomography (CT) conducted on patient dose reduction have recommended using an iterative reconstruction algorithm and mA (mili-Ampere) dose modulation. The current study aimed to evaluate Iterative Dose Reduction Algorithm (IDREAM) as an iterative reconstruction algorithm. Material and Methods: Two CT p...

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...

some algorithms for nding common xed point of a family of mappings isconstructed. indeed, let c be a nonempty closed convex subset of a uniformlyconvex banach space x whose norm is gateaux dierentiable and let {tn} bea family of self-mappings on c such that the set of all common fixed pointsof {tn} is nonempty. we construct a sequence {xn} generated by the hybridmethod and also we give the ...

abstract. the main contribution of the current paper is to propose a new effective numerical method for solving the first-order linear matrix differential equations. properties of the legendre basis operational matrix of integration together with a collocation method are applied to reduce the problem to a coupled linear matrix equations. afterwards, an iterative algorithm is examined for solvin...

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...