2015
2
2
2
0
1

Residual norm steepest descent based iterative algorithms for Sylvester tensor equations
https://jmm.guilan.ac.ir/article_105.html
1
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 gradientbased iterative algorithm and its modified version for solving the mentioned Sylvester tensor equation without setting the restriction of the existence of a unique solution. Numerical experiments are reported which confirm the validity of the presented results.
0

115
131


Fatemeh
Panjeh Ali Beik
Iran
f.beik@vru.ac.ir


Salman
AhmadiAsl
Iran
s.ahmadiasl@stu.vru.ac.ir
Sylvester tensor equation
iterative algorithm
Convergence
1

On the optimal correction of inconsistent matrix equations $AX = B$ and $XC = D$ with orthogonal constraint
https://jmm.guilan.ac.ir/article_106.html
1
This work focuses on the correction of both the coecient and the right hand side matrices of the inconsistent matrix equations $AX = B$ and $XC = D$ with orthogonal constraint. By optimal correction approach, a general representation of the orthogonal solution is obtained. This method is tested on two examples to show that the optimal correction is eective and highly accurate.
0

132
142


Saeed
Ketabchi
Iran
sketabchi@guilan.ac.ir


Elham
Samadi
Iran
elhamsamadi65@yahoo.com


Hossein
Aminikhah
Iran
aminikhah@guilan.ac.ir
1

Homotopy perturbation method for solving fractional Bratutype equation
https://jmm.guilan.ac.ir/article_107.html
1
In this paper, the homotopy perturbation method (HPM) is applied to obtain an approximate solution of the fractional Bratutype equations. The convergence of the method is also studied. The fractional derivatives are described in the modied RiemannLiouville sense. The results show that the proposed method is very ecient and convenient and can readily be applied to a large class of fractional problems.
0

143
155


Bahman
Ghazanfari
Iran
bahman_ghazanfari@yahoo.com


Amaneh
Sepahvandzadeh
Iran
sepahvandzade_amane@yahoo.com
1

On the numerical solution of integral equations of the fourth kind with higher index: differentiability and tractability index3
https://jmm.guilan.ac.ir/article_108.html
1
In this paper, we consider a particular class of integral equations of the fourth kind and show that tractability and differentiability index of the given system are 3. Tractability and dierentiability index are introduced based on thesmoothing property of a Volterra integral operator and index reduction procedure, respectively. Using the notion of index, we give sucient conditions for the existence and uniqueness of the solutions for the index3 system. Then, a numerical technique based on the Chebyshev polynomial collocation methods including the matrixvector multiplication representation is proposed for the solution of these systems and the performance of the numerical scheme is illustrated by means of some test problems.
0

156
169


Saeed
Pishbin
Iran
s.pishbin@urmia.ac.ir
1

Global least squares solution of matrix equation $sum_{j=1}^s A_jX_jB_j = E$
https://jmm.guilan.ac.ir/article_109.html
1
In this paper, an iterative method is proposed for solving matrix equation $sum_{j=1}^s A_jX_jB_j = E$. This method is based on the global least squares (GLLSQR) method for solving the linear system of equations with the multiple right hand sides. For applying the GLLSQR algorithm to solve the above matrix equation, a new linear operator, its adjoint and a new inner product are dened. It is proved that the new iterative method obtains the least norm solution of the mentioned matrix equation within finite iteration steps in the exact arithmetic, when the above matrix equation is consistent. Moreover, the optimal approximate solution $(X_1^* ,X_2^* ,ldots,X_s^*)$ to a given multiple matrices $( bar{X}_1, bar{X}_2,ldots,bar{X}_s)$ can be derived by nding the least norm solution of a new matrix equation. Finally, some numerical experiments are given to illustrate the eciency of the new method.
0

170
186


Saeed
Karimi
Iran
karimi@pgu.ac.ir
1

A single server perishable inventory system with N additional options for service
https://jmm.guilan.ac.ir/article_110.html
1
This article presents a perishable (s; S) inventory system under continuous review at a service facility in which a waiting hall for customers is of nite size M. The arrival instants of customers to the service station constitutes a Poisson process. The life time of each items is assumed to be exponential. All arriving customers demand the rst "essential" service, whereas only some of them demand the second "optional" service, and the second service is multioptional. The joint probability distribution of the number of customers in the waiting hall and the inventory level is obtained for the steady state case. Some important system performance measures in the steady state are derived, and the longrun total expected cost rate is also calculated. We have derived the LaplaceStieljes transforms of waiting time distribution of customers in the waiting hall. The results are illustrated numerically.
0

187
216


Jeganathan
Kathirvel
Iran
jegan.nathan85@yahoo.com
1

A comparative study of fuzzy norms of linear operators on a fuzzy normed linear spaces
https://jmm.guilan.ac.ir/article_111.html
1
In the present paper, we rst modify the concepts of weakly fuzzy boundedness, strongly fuzzy boundedness, fuzzy continuity, strongly fuzzy continuity and weakly fuzzy continuity. Then, we try to nd some relations by making a comparative study of the fuzzy norms of linear operators.
0

217
234
Morteza
Saheli
Morteza
Saheli
Iran


Morteza
Saheli
Iran
saheli@vru.ac.ir
Fuzzy norm
Fuzzy normed linear space
Fuzzy bounded linear operator