Islamic Azad University, Central tehran Branch
International Journal of Mathematical Modelling & Computations
2228-6225
2228-6233
5
1 (WINTER)
2015
03
21
NON-POLYNOMIAL SPLINE FOR THE NUMERICAL SOLUTION OF PROBLEMS IN CALCULUS OF VARIATIONS
1
14
EN
Reza
Jalilian
Department of Mathematics, Razi University Tagh Bostan, Kermanshah
Iran, Islamic Republic of
Department of Mathematics
J.
Rashidinia
K.
Farjian
H.
Jalilian
A Class of new methods based on a septic non-polynomial 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 [28-32].
Two-point boundary value problem,Non-polynomial spline,Convergence analysis,Calculus of variation
http://ijm2c.iauctb.ac.ir/article_521877.html
http://ijm2c.iauctb.ac.ir/article_521877_dab2fe60e4cafabea45566ed258cdda9.pdf
Islamic Azad University, Central tehran Branch
International Journal of Mathematical Modelling & Computations
2228-6225
2228-6233
5
1 (WINTER)
2015
03
21
CONVERGENCE THEOREMS FOR ASYMPTOTICALLY PSEUDOCONTRACTIVE MAPPINGS IN THE INTERMEDIATE SENSE FOR THE MODIFIED NOOR ITERATIVE SCHEME
15
28
EN
Godwin Amechi
Okeke
Department of Mathematics, University of Lagos, Nigeria
Nigeria
Lecturer,Department of Mathematics,University of Lagos,Nigeria.
Johnson O
Olaleru
Department of Mathematics, University of Lagos, Nigeria.
Nigeria
Professor of Fixed Point Theory (mathematics)
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].
Asymptotically pseudocontractive mapping in the intermediate sense,weak and strong convergence theorems,the modified Noor iterative scheme
http://ijm2c.iauctb.ac.ir/article_521878.html
http://ijm2c.iauctb.ac.ir/article_521878_a671b0276673586a5ea44ed58c572c1a.pdf
Islamic Azad University, Central tehran Branch
International Journal of Mathematical Modelling & Computations
2228-6225
2228-6233
5
1 (WINTER)
2015
03
21
ANALYSIS OF DISCRETE-TIME MACHINE REPAIR PROBLEM WITH TWO REMOVABLE SERVERS UNDER TRIADIC POLICY
29
40
EN
Veena
Goswami
KIIT University
India
Professor & Dean ,
School of Computer Application,KIIT University, Bhubaneswar
P. Vijaya
Laxmi
<span>This paper analyzes a controllable discrete-time machine repair problem with</span><br /><span>L operating machines and two repairmen. The number of working servers can be adjusted</span><br /><span>depending on the number of failed machines in the system one at a time at machine's failure or</span><br /><span>at service completion epochs. Analytical closed-form solutions of the stationary probabilities of</span><br /><span>the number of failed machines in the system are obtained. We develop the total expected cost</span><br /><span>function per machine per unit time and obtain the optimal operating policy and the optimal</span><br /><span>service rate at minimum cost using quadratic ¯t search method and simulated annealing</span><br /><span>method. Various performance measures along with numerical results to illustrate the in°uence</span><br /><span>of various parameters on the bu®er behavior are also presented.</span>
discrete-time,Triadic policy,Machine-repair,Cost,Quadratic ¯t search method,Queue
http://ijm2c.iauctb.ac.ir/article_521879.html
http://ijm2c.iauctb.ac.ir/article_521879_356392a2b8c0f99c48942750fc8984b8.pdf
Islamic Azad University, Central tehran Branch
International Journal of Mathematical Modelling & Computations
2228-6225
2228-6233
5
1 (WINTER)
2015
03
21
A MODIFIED STEFFENSEN'S METHOD WITH MEMORY FOR NONLINEAR EQUATIONS
41
48
EN
Farhad
Khaksar Haghani
Department of Mathematics, Shahrekord Branch, Islamic Azad University, Shahrekord, Iran
Iran, Islamic Republic of
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 Steffensen-type method with memory for solving nonlinear equations. Numerical results are also given to support the underlying theory of the article.
Steffensen's method,root,order,with memory
http://ijm2c.iauctb.ac.ir/article_521880.html
http://ijm2c.iauctb.ac.ir/article_521880_42e504c4fb6d9baf0714d12ced0a8240.pdf
Islamic Azad University, Central tehran Branch
International Journal of Mathematical Modelling & Computations
2228-6225
2228-6233
5
1 (WINTER)
2015
03
21
A NON-MARKOVIAN BATCH ARRIVAL QUEUE WITH SERVICE INTERRUPTION AND EXTENDED SERVER VACATION
49
67
EN
G.
Ayyappan
K.
Sathiya
<span>A single server provides service to all arriving customers with service</span><br /><span>time following general distribution. After every service completion the</span><br /><span>server has the option to leave for phase one vacation of random length</span><br /><span>with probability p or continue to stay in the system with probability</span><br /><span>1 p. As soon as the completion of phase one vacation, the server</span><br /><span>may take phase two vacation with probability q or to remain in the</span><br /><span>system with probability 1q, after phase two vacation again the server</span><br /><span>has the option to take phase three vacation with probability r or to</span><br /><span>remain in the system with probability 1 r. The vacation times are</span><br /><span>assumed to be general. The server is interrupted at random and the</span><br /><span>duration of attending interruption follows exponential distribution. Also</span><br /><span>we assume, the customer whose service is interrupted goes back to the</span><br /><span>head of the queue where the arrivals are Poisson. The time dependent</span><br /><span>probability generating functions have been obtained in terms of their</span><br /><span>Laplace transforms and the corresponding steady state results have been</span><br /><span>obtained explicitly. Also the mean number of customers in the queue</span><br /><span>and system and the waiting time in the queue and system are also</span><br /><span>derived. Particular cases and numerical results are discussed.</span>
http://ijm2c.iauctb.ac.ir/article_521881.html
http://ijm2c.iauctb.ac.ir/article_521881_b4df512d27999c6ae83a5bc3dd2dda7a.pdf
Islamic Azad University, Central tehran Branch
International Journal of Mathematical Modelling & Computations
2228-6225
2228-6233
5
1 (WINTER)
2015
03
21
A STABLE COUPLED NEWTON'S ITERATION FOR THE MATRIX INVERSE $P$-TH ROOT
69
79
EN
Amir
Sadeghi
Young Researcher Club, Shahre-rey branch, Islamic Azad university, Tehran, Iran.
Iran, Islamic Republic of
<span>The computation of the inverse roots of matrices arises in evaluating non-symmetric</span><br /><span>eigenvalue problems, solving nonlinear matrix equations, computing some matrix</span><br /><span>functions, control theory and several other areas of applications. It is possible to</span><br /><span>approximate the matrix inverse pth roots by exploiting a specialized version of New-</span><br /><span>ton's method, but previous researchers have mentioned that some iterations have</span><br /><span>poor convergence and stability properties. In this work, a stable recursive technique</span><br /><span>to evaluate an inverse pth root of a given matrix is presented. The scheme is analyzed</span><br /><span>and its properties are investigated. Computational experiments are also performed</span><br /><span>to illustrate the strengths and weaknesses of the proposed method.</span>
Inverse matrix pth roots,Coupled Newton's iterations,Convergency,Stability
http://ijm2c.iauctb.ac.ir/article_521882.html
http://ijm2c.iauctb.ac.ir/article_521882_1dcc734aab3ddae6b987f1056e33dcda.pdf
Islamic Azad University, Central tehran Branch
International Journal of Mathematical Modelling & Computations
2228-6225
2228-6233
5
1 (WINTER)
2015
03
21
DIFFERENTIAL TRANSFORMATION METHOD FOR SOLVING FUZZY FRACTIONAL HEAT EQUATIONS
81
89
EN
Bahman
Ghazanfari
Lorestan university
Iran, Islamic Republic of
Assist. Prof. in Appl. Math.Department of Mathematics
Parvin
Ebrahimi
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.
fuzzy fractional heat,Differential transformation method,fuzzy Caputo's derivative
http://ijm2c.iauctb.ac.ir/article_521883.html
http://ijm2c.iauctb.ac.ir/article_521883_04a7136a538f379b97491ba2a31c5009.pdf
Islamic Azad University, Central tehran Branch
International Journal of Mathematical Modelling & Computations
2228-6225
2228-6233
5
1 (WINTER)
2015
03
21
A TAYLOR SERIES APPROACH FOR SOLVING LINEAR FRACTIONAL DECENTRALIZED BI-LEVEL MULTI-OBJECTIVE DECISION-MAKING UNDER FUZZINESS
91
97
EN
Mansour
Saraj
Nima
Safaei
Iran, Islamic Republic of
<span>This paper presents a Taylor series approach for solving linear fractional de-</span><br /><span>centralized bi-level multi-objective decision-making (LFDBL-MODM) problems with a</span><br /><span>single decision maker at the upper level and multiple decision makers at the lower level.</span><br /><span>In the proposed approach, the membership functions associated with each objective(s) of</span><br /><span>the level(s) of LFDBL-MODM are transformed by using a Taylor series and then they are</span><br /><span>unified. On using the Kuhn-Tucker conditions, the problem is finally reduced to a single</span><br /><span>objective. Numerical example is given in order to illustrate the efficiency and superiority</span><br /><span>of the proposed approach.</span>
Bilevel programming,Fractional programming,Fuzzy programming,Kuhn- Tucker conditions,Taylor series
http://ijm2c.iauctb.ac.ir/article_521884.html
http://ijm2c.iauctb.ac.ir/article_521884_9e834a2abe1359437d67299ca12e2de7.pdf