2015
5
1
1
0
NONPOLYNOMIAL SPLINE FOR THE NUMERICAL SOLUTION OF PROBLEMS IN CALCULUS OF VARIATIONS
2
2
A Class of new methods based on a septic nonpolynomial spline function for the numerical solution of problems in calculus of variations is presented. The local truncation errors and the methods of order 2th, 4th, 6th, 8th, 10th, and 12th, are obtained. The inverse of some band matrixes are obtained which are required in proving the convergence analysis of the presented method. Convergence analysis of these methods is discussed. Numerical results are given to illustrate
the eciency of methods and compared with the methods in [2832].
1

1
14


Reza
Jalilian
Department of Mathematics, Razi University Tagh Bostan, Kermanshah
Iran, Islamic Republic of
Department of Mathematics
Department of Mathematics, Razi University
Iran


J.
Rashidinia
Iran


K.
Farjian
Iran


H.
Jalilian
Iran
Twopoint boundary value problem
Nonpolynomial spline
Convergence analysis
Calculus of variation
CONVERGENCE THEOREMS FOR ASYMPTOTICALLY PSEUDOCONTRACTIVE MAPPINGS IN THE INTERMEDIATE SENSE FOR THE MODIFIED NOOR ITERATIVE SCHEME
2
2
We study the convergence of the modified Noor iterative scheme for the class of asymptotically pseudocontractive mappings in the intermediate sense which is not necessarily Lipschitzian. Our results improves, extends and unifies the results of Schu [23] and Qin {it et al.} [25].
1

15
28


Godwin Amechi
Okeke
Department of Mathematics, University of Lagos, Nigeria
Nigeria
Lecturer,Department of Mathematics,University of Lagos,Nigeria.
Department of Mathematics, University of
Iran


Johnson O
Olaleru
Department of Mathematics, University of Lagos, Nigeria.
Nigeria
Professor of Fixed Point Theory (mathematics)
Department of Mathematics, University of
Iran
Asymptotically pseudocontractive mapping in the intermediate sense
weak and strong convergence theorems
the modified Noor iterative scheme
ANALYSIS OF DISCRETETIME MACHINE REPAIR PROBLEM WITH TWO REMOVABLE SERVERS UNDER TRIADIC POLICY
2
2
This paper analyzes a controllable discretetime machine repair problem withL operating machines and two repairmen. The number of working servers can be adjusteddepending on the number of failed machines in the system one at a time at machine's failure orat service completion epochs. Analytical closedform solutions of the stationary probabilities ofthe number of failed machines in the system are obtained. We develop the total expected costfunction per machine per unit time and obtain the optimal operating policy and the optimalservice rate at minimum cost using quadratic ¯t search method and simulated annealingmethod. Various performance measures along with numerical results to illustrate the in°uenceof various parameters on the bu®er behavior are also presented.
1

29
40


Veena
Goswami
KIIT University
India
Professor & Dean ,
School of Computer Application,KIIT University, Bhubaneswar
KIIT University
India
Professor & Dean
Iran


P. Vijaya
Laxmi
Iran
discretetime
Triadic policy
Machinerepair
cost
Quadratic ¯t search method
Queue
A MODIFIED STEFFENSEN'S METHOD WITH MEMORY FOR NONLINEAR EQUATIONS
2
2
In this note, we propose a modification of Steffensen's method with some free parameters. These parameters are then be used for further acceleration via the concept of with memorization. In this way, we derive a fast Steffensentype method with memory for solving nonlinear equations. Numerical results are also given to support the underlying theory of the article.
1

41
48


Farhad
Khaksar Haghani
Department of Mathematics, Shahrekord Branch, Islamic Azad University, Shahrekord, Iran
Iran, Islamic Republic of
Department of Mathematics, Shahrekord Branch,
Iran
Steffensen's method
Root
order
with memory
A NONMARKOVIAN BATCH ARRIVAL QUEUE WITH SERVICE INTERRUPTION AND EXTENDED SERVER VACATION
2
2
A single server provides service to all arriving customers with servicetime following general distribution. After every service completion theserver has the option to leave for phase one vacation of random lengthwith probability p or continue to stay in the system with probability1 p. As soon as the completion of phase one vacation, the servermay take phase two vacation with probability q or to remain in thesystem with probability 1q, after phase two vacation again the serverhas the option to take phase three vacation with probability r or toremain in the system with probability 1 r. The vacation times areassumed to be general. The server is interrupted at random and theduration of attending interruption follows exponential distribution. Alsowe assume, the customer whose service is interrupted goes back to thehead of the queue where the arrivals are Poisson. The time dependentprobability generating functions have been obtained in terms of theirLaplace transforms and the corresponding steady state results have beenobtained explicitly. Also the mean number of customers in the queueand system and the waiting time in the queue and system are alsoderived. Particular cases and numerical results are discussed.
1

49
67


G.
Ayyappan
Iran


K.
Sathiya
Iran
A STABLE COUPLED NEWTON'S ITERATION FOR THE MATRIX INVERSE $P$TH ROOT
2
2
The computation of the inverse roots of matrices arises in evaluating nonsymmetriceigenvalue problems, solving nonlinear matrix equations, computing some matrixfunctions, control theory and several other areas of applications. It is possible toapproximate the matrix inverse pth roots by exploiting a specialized version of Newton's method, but previous researchers have mentioned that some iterations havepoor convergence and stability properties. In this work, a stable recursive techniqueto evaluate an inverse pth root of a given matrix is presented. The scheme is analyzedand its properties are investigated. Computational experiments are also performedto illustrate the strengths and weaknesses of the proposed method.
1

69
79


Amir
Sadeghi
Young Researcher Club, Shahrerey branch, Islamic Azad university, Tehran, Iran.
Iran, Islamic Republic of
Young Researcher Club, Shahrerey branch,
Iran
Inverse matrix pth roots
Coupled Newton's iterations
Convergency
Stability
DIFFERENTIAL TRANSFORMATION METHOD FOR SOLVING FUZZY FRACTIONAL HEAT EQUATIONS
2
2
In this paper, the differential transformation method (DTM) was applied to solve fuzzy fractional heat equations. The elementary properties of this method were given. The approximate and exact solutions of these equations were calculated in the form of series with easily computable terms. The proposed method was also illustrated by some examples. The results revealed that DTM is a highly effective scheme for obtaining approximate analytical solutions of fuzzy fractional heat equations.
1

81
89


Bahman
Ghazanfari
Lorestan university
Iran, Islamic Republic of
Assist. Prof. in Appl. Math.Department of Mathematics
Lorestan university
Iran, Islamic Republic
Iran


Parvin
Ebrahimi
Iran
fuzzy fractional heat
Differential transformation method
fuzzy Caputo's derivative
A TAYLOR SERIES APPROACH FOR SOLVING LINEAR FRACTIONAL DECENTRALIZED BILEVEL MULTIOBJECTIVE DECISIONMAKING UNDER FUZZINESS
2
2
This paper presents a Taylor series approach for solving linear fractional decentralized bilevel multiobjective decisionmaking (LFDBLMODM) problems with asingle decision maker at the upper level and multiple decision makers at the lower level.In the proposed approach, the membership functions associated with each objective(s) ofthe level(s) of LFDBLMODM are transformed by using a Taylor series and then they areunified. On using the KuhnTucker conditions, the problem is finally reduced to a singleobjective. Numerical example is given in order to illustrate the efficiency and superiorityof the proposed approach.
1

91
97


Mansour
Saraj
Iran


Nima
Safaei
Iran, Islamic Republic of
Iran, Islamic Republic of
Iran
Bilevel programming
Fractional programming
Fuzzy Programming
Kuhn Tucker conditions
Taylor series