ORIGINAL_ARTICLE
Set a bi-objective redundancy allocation model to optimize the reliability and cost of the Series-parallel systems using NSGA II problem
With the huge global and wide range of attention placed upon quality, promoting and optimize the reliability of the products during the design process has turned out to be a high priority. In this study, the researcher have adopted one of the existing models in the reliability science and propose a bi-objective model for redundancy allocation in the series-parallel systems in accordance with the redundancy policy- given that failure rate depends on the number of the active elements. The objective behind the proposed model is to maximize the reliability and to minimize the total cost of the system. Internal connection cost, which is the most common parameter in electronic systems, put in this model in order to simulate the real-world conditions. As the proposed model is an NP-Hard one(for getting results), the researcher adopted a Non-dominated Sorting Genetic Algorithm (NSGA II) after optimizing its operatorsâ€™ rate by using Response Surface Methodology (RSM).
http://ijim.srbiau.ac.ir/article_8625_838db30d35416df4c8c36953986c7517.pdf
2016-08-01T11:23:20
2018-03-19T11:23:20
171
176
reliability
Series
Parallel System
Redundancy Allocation Problem
Non-dominated Sorting Genetic Algorithm
Response Surface Methodology
M. R.
Shahriari
shahriari.mr@gmail.com
true
1
Faculty of Management, South Tehran Branch, Islamic Azad University, Tehran, Iran.
Faculty of Management, South Tehran Branch, Islamic Azad University, Tehran, Iran.
Faculty of Management, South Tehran Branch, Islamic Azad University, Tehran, Iran.
LEAD_AUTHOR
ORIGINAL_ARTICLE
A new algorithm for solving Van der Pol equation based on piecewise spectral Adomian decomposition method
In this article, a new method is introduced to give approximate solution to Van der Pol equation. The proposed method is based on the combination of two different methods, the spectral Adomian decomposition method (SADM) and piecewise method, called the piecewise Adomian decomposition method (PSADM). The numerical results obtained from the proposed method show that this method is an effective, accurate and powerful tool for solving Van der Pol equation and, the comparison show that the proposed technique is in good agreement with the numerical results obtained using Runge-Kutta method. The advantage of piecewise spectral Adomian decomposition method over piecewise Adomian decomposition method is that it does not need to calculate complex integrals. Another merit of this method is that, unlike the spectral method, it does not require the solution of any linear or nonlinear system of equations. Furthermore, the proposed method is easy to implement and computationally very attractive.
http://ijim.srbiau.ac.ir/article_8691_3746046425fd9e53b0b7ff5c70e7b55a.pdf
2016-08-01T11:23:20
2018-03-19T11:23:20
177
184
Van der Pol equation
Spectral Adomian decomposition method
Piecewise method
Runge-Kutta method
S. GH
Hosseini
ghasem602@yahoo.com
true
1
Department of Mathematics, Science and Research Branch, Islamic Azad University, Tehran, Iran.
Department of Mathematics, Science and Research Branch, Islamic Azad University, Tehran, Iran.
Department of Mathematics, Science and Research Branch, Islamic Azad University, Tehran, Iran.
LEAD_AUTHOR
E.
Babolian
true
2
Department of Mathematics, Science and Research Branch, Islamic Azad University, Tehran, Iran.
Department of Mathematics, Science and Research Branch, Islamic Azad University, Tehran, Iran.
Department of Mathematics, Science and Research Branch, Islamic Azad University, Tehran, Iran.
AUTHOR
S.
Abbasbandy
true
3
Department of Mathematics, Science and Research Branch, Islamic Azad University, Tehran, Iran.
Department of Mathematics, Science and Research Branch, Islamic Azad University, Tehran, Iran.
Department of Mathematics, Science and Research Branch, Islamic Azad University, Tehran, Iran.
AUTHOR
ORIGINAL_ARTICLE
A Study on Intuitionistic Fuzzy and Normal Fuzzy M-Subgroup, M-Homomorphism and Isomorphism
In this paper, we introduce some properties of an intuitionistic normal fuzzy m-subgroup of m- group with m-homomorphism and isomorphism. We study he image, the pre-image and the inverse mapping of the intuitionistic normal fuzzy m-subgroups.
http://ijim.srbiau.ac.ir/article_8692_68f3976b86381f7efa2759012af734a9.pdf
2016-08-01T11:23:20
2018-03-19T11:23:20
185
188
Intuitionistic Fuzzy Sets
M-Groups
Intuitionistic Fuzzy M-Subgroups
Intuitionistic Normal Fuzzy
M-Subgroups
M-Homomorphism
M.
Oqla Massa'deh
moradoqla2000@yahoo.com
true
1
Department of Applied Science, Ajloun College, Al-Balqa'Applied University, Jordan.
Department of Applied Science, Ajloun College, Al-Balqa'Applied University, Jordan.
Department of Applied Science, Ajloun College, Al-Balqa'Applied University, Jordan.
LEAD_AUTHOR
ORIGINAL_ARTICLE
Estimation of portfolio efficient frontier by different measures of risk via DEA
In this paper, linear Data Envelopment Analysis models are used to estimate Markowitz efficient frontier. Conventional DEA models assume non-negative values for inputs and outputs. however, variance is the only variable in these models that takes non-negative values. Therefore, negative data models which the risk of the assets had been used as an input and expected return was the output are utilized . At the beginning variance was considered as a risk measure. However, both theories and practices indicate that variance is not a good measure of risk. Then value at risk is introduced as new risk measure. In this paper,we should prove that with increasing sample size, the frontiers of the linear models with both variance and value at risk , as risk measure, gradually approximate the frontiers of the mean-variance and mean-value at risk models and non-linear model with negative data. Finally, we present a numerical example with variance and value at risk that obtained via historical simulation and variance-covariance method as risk measures to demonstrate the usefulness and effectiveness of our claim.
http://ijim.srbiau.ac.ir/article_9188_36643109d7a34768bfc33cb98d9717cd.pdf
2016-08-01T11:23:20
2018-03-19T11:23:20
189
200
Portfolio
Data envelopment analysis (DEA)
Value at Risk (VaR)
Negative data
M.
Sanei
true
1
Department of Applied Mathematics, Islamic Azad University of Central Tehran Branch, Tehran, Iran.
Department of Applied Mathematics, Islamic Azad University of Central Tehran Branch, Tehran, Iran.
Department of Applied Mathematics, Islamic Azad University of Central Tehran Branch, Tehran, Iran.
AUTHOR
S.
Banihashemi
shbanihashemi@atu.ac.ir
true
2
Department of Mathematics, Faculty of Mathematics and Computer Science, Allameh Tabataba'i University, Tehran Iran.
Department of Mathematics, Faculty of Mathematics and Computer Science, Allameh Tabataba'i University, Tehran Iran.
Department of Mathematics, Faculty of Mathematics and Computer Science, Allameh Tabataba'i University, Tehran Iran.
LEAD_AUTHOR
M.
Kaveh
true
3
Department of Applied Mathematics, Islamic Azad University of Central Tehran Branch, Tehran, Iran.
Department of Applied Mathematics, Islamic Azad University of Central Tehran Branch, Tehran, Iran.
Department of Applied Mathematics, Islamic Azad University of Central Tehran Branch, Tehran, Iran.
AUTHOR
ORIGINAL_ARTICLE
Bernoulli operational matrix method for system of linear Volterra integral equations
In this paper, the numerical technique based on hybrid Bernoulli and Block-Pulse functions has been developed to approximate the solution of system of linear Volterra integral equations. System of Volterra integral equations arose in many physical problems such as elastodynamic, quasi-static visco-elasticity and magneto-electro-elastic dynamic problems. These functions are formed by the hybridization of Bernoulli polynomials and Block-Pulse functions which are orthonormal and have compact support on $[0, 1]$. By these orthonormal bases we drove new operational matrix which was a sparse matrix. By use of this new operational matrix we reduces the system of integral equations to a system of linear algebraic equations that can be solved easily by any usual numerical method. The numerical results obtained by the presented method have been compared with some existed methods and they have been in good agreement with the analytical solutions and other methods that prove the profit and efficiency of the proposed method.
http://ijim.srbiau.ac.ir/article_9189_91e225da0ff23fce4239c7b6194453d5.pdf
2016-08-01T11:23:20
2018-03-19T11:23:20
201
207
System of Volterra integral equations
Bernoulli polynomials
Hybrid functions
Operational matrix
E.
Hashemizadeh
hashemizadeh@kiau.ac.ir
true
1
Department of Mathematics, Karaj Branch, Islamic Azad University, Karaj, Iran.
Department of Mathematics, Karaj Branch, Islamic Azad University, Karaj, Iran.
Department of Mathematics, Karaj Branch, Islamic Azad University, Karaj, Iran.
LEAD_AUTHOR
M.
Mohsenyzadeh
true
2
Department of Mathematics, Karaj Branch, Islamic Azad University, Karaj, Iran.
Department of Mathematics, Karaj Branch, Islamic Azad University, Karaj, Iran.
Department of Mathematics, Karaj Branch, Islamic Azad University, Karaj, Iran.
AUTHOR
ORIGINAL_ARTICLE
A new network simplex algorithm to reduce consecutive degenerate pivots and prevent stalling
It is well known that in operations research, degeneracy can cause a cycle in a network simplex algorithm which can be prevented by maintaining strong feasible bases in each pivot. Also, in a network consists of n arcs and m nodes, not considering any new conditions on the entering variable, the upper bound of consecutive degenerate pivots is equal $\left( \begin{array}{c} n-m+k \\ k \\ \end{array} \right)$ where $k$ is the number of degenerate arcs in the basis. As well as, the network simplex algorithm may stall if it goes through some long consecutive degenerate pivot. Through conditions such as (LRC) and (LRS) upon entering variable rules, this upper bound can be reduced to $mn$ and $m^2$ respectively. In this current paper we first suggest a new algorithm for anti--stalling in which a new condition is provided to the entering variable and then show that through this algorithm there are at most $k$ consecutive degenerate pivots.
http://ijim.srbiau.ac.ir/article_9190_4e92d4271d80d8fd8a05e16a5cd7d4bb.pdf
2016-08-01T11:23:20
2018-03-19T11:23:20
209
214
Network flow problem
Network simplex algorithm
Degeneracy
Strong feasible basis
Stalling
Z.
Aghababazadeh
true
1
Department of Mathematics, Science and Research Branch, Islamic Azad University, Tehran, Iran.
Department of Mathematics, Science and Research Branch, Islamic Azad University, Tehran, Iran.
Department of Mathematics, Science and Research Branch, Islamic Azad University, Tehran, Iran.
AUTHOR
M.
Rostamy-Malkhalifeh
mohsen_rostamy@yahoo.com
true
2
Department of Mathematics, Science and Research Branch, Islamic Azad University, Tehran, Iran.
Department of Mathematics, Science and Research Branch, Islamic Azad University, Tehran, Iran.
Department of Mathematics, Science and Research Branch, Islamic Azad University, Tehran, Iran.
LEAD_AUTHOR
ORIGINAL_ARTICLE
The spectral iterative method for Solving Fractional-Order Logistic Equation
In this paper, a new spectral-iterative method is employed to give approximate solutions of fractional logistic differential equation. This approach is based on combination of two different methods, i.e. the iterative method \cite{35} and the spectral method. The method reduces the differential equation to systems of linear algebraic equations and then the resulting systems are solved by a numerical method. The solutions obtained are compared with Adomian decomposition method and iterative method used in \cite{35} and Adams method \cite{36}.
http://ijim.srbiau.ac.ir/article_9268_d01a89e924ffaf9f3349f2d065b0b6e6.pdf
2016-08-01T11:23:20
2018-03-19T11:23:20
215
223
Adomian decomposition method (ADM)
Iterative method (IM)
Spectral method
Fractional logistic equation
Collocation method
A.
Shoja
shoja@riau.ac.ir
true
1
Department of Mathematics, Science and Research Branches, Islamic Azad University, Tehran, Iran.
Department of Mathematics, Science and Research Branches, Islamic Azad University, Tehran, Iran.
Department of Mathematics, Science and Research Branches, Islamic Azad University, Tehran, Iran.
LEAD_AUTHOR
E.
Babolian
true
2
Department of Mathematics, Science and Research Branches, Islamic Azad University, Tehran, Iran.
Department of Mathematics, Science and Research Branches, Islamic Azad University, Tehran, Iran.
Department of Mathematics, Science and Research Branches, Islamic Azad University, Tehran, Iran.
AUTHOR
A. R.
Vahidi
true
3
Department of Mathematics, Science and Research Branches, Islamic Azad University, Tehran, Iran.
Department of Mathematics, Science and Research Branches, Islamic Azad University, Tehran, Iran.
Department of Mathematics, Science and Research Branches, Islamic Azad University, Tehran, Iran.
AUTHOR
ORIGINAL_ARTICLE
A new iterative with memory class for solving nonlinear equations
In this work we develop a new optimal without memory class for approximating a simple root of a nonlinear equation. This class includes three parameters. Therefore, we try to derive some with memory methods so that the convergence order increases as high as possible. Some numerical examples are also presented.
http://ijim.srbiau.ac.ir/article_9272_60133e06347fe8429c0b49ac76218a8e.pdf
2016-08-01T11:23:20
2018-03-19T11:23:20
225
229
Multi-step methods
Nonlinear equations
Optimal order
Methods with memory
Kung-Traub's conjecture.
P.
Bassiri
true
1
Department of Mathematics, Payame Noor University (PNU), P. O. Box, 19395-3697, Tehran, Iran.
Department of Mathematics, Payame Noor University (PNU), P. O. Box, 19395-3697, Tehran, Iran.
Department of Mathematics, Payame Noor University (PNU), P. O. Box, 19395-3697, Tehran, Iran.
AUTHOR
P.
Bakhtiari
bakhtiaripr@yahoo.com
true
2
Young Researchers and Elite Club, Hamedan Branch, Islamic Azad University, Hamedan, Iran.
Young Researchers and Elite Club, Hamedan Branch, Islamic Azad University, Hamedan, Iran.
Young Researchers and Elite Club, Hamedan Branch, Islamic Azad University, Hamedan, Iran.
LEAD_AUTHOR
S.
Abbasbandy
true
3
Department of Mathematics, Imam Khomeini International University, Ghazvin, 34149-16818, Iran.
Department of Mathematics, Imam Khomeini International University, Ghazvin, 34149-16818, Iran.
Department of Mathematics, Imam Khomeini International University, Ghazvin, 34149-16818, Iran.
AUTHOR
ORIGINAL_ARTICLE
Solving robot selection problem by a new interval-valued hesitant fuzzy multi-attributes group decision method
Selecting the most suitable robot among their wide range of specifications and capabilities is an important issue to perform the hazardous and repetitive jobs. Companies should take into consideration powerful group decision-making (GDM) methods to evaluate the candidates or potential robots versus the selected attributes (criteria). In this study, a new GDM method is proposed by utilizing the complex proportional assessment method under interval-valued hesitant fuzzy (IVHF)-environment. In the proposed method, a group of experts is established to evaluate the candidates or alternatives among the conflicted attributes. In addition, experts assign their preferences and judgments about the rating of alternatives and the relative importance of each attribute by linguistic terms which are converted to interval-valued hesitant fuzzy elements (IVHFEs). Also, the attributesâ€™ weights and expertsâ€™ weights are applied in procedure of the proposed interval-valued hesitant fuzzy group decision-making (IVHF-GDM) method. Hence, the expertsâ€™ opinions about the relative importance of each attribute are considered in determination of attributesâ€™ weights. Thus, we propose a hybrid maximizing deviation method under uncertainty. Finally, an illustrative example is presented to show the feasibility of the proposed IVHF-GDM method and also the obtained ranking results are compared with a recent method from the literature.
http://ijim.srbiau.ac.ir/article_9273_42246ee95b59af90adbffe6c9db43ca4.pdf
2016-08-01T11:23:20
2018-03-19T11:23:20
231
240
Robot selection problem
Group decision making analysis
Interval-valued hesitant fuzzy sets
S. M.
Mousavi
true
1
Department of Industrial Engineering, Faculty of Engineering, Shahed University, Tehran, Iran.
Department of Industrial Engineering, Faculty of Engineering, Shahed University, Tehran, Iran.
Department of Industrial Engineering, Faculty of Engineering, Shahed University, Tehran, Iran.
AUTHOR
B.
Vahdani
b.vahdani@gmail.com
true
2
Faculty of Industrial and Mechanical Engineering, Qazvin Branch, Islamic Azad University, Qazvin, Iran.
Faculty of Industrial and Mechanical Engineering, Qazvin Branch, Islamic Azad University, Qazvin, Iran.
Faculty of Industrial and Mechanical Engineering, Qazvin Branch, Islamic Azad University, Qazvin, Iran.
LEAD_AUTHOR
H.
Gitinavard
true
3
Young Researchers and Elite Club, South Tehran Branch, Islamic Azad University, Tehran, Iran.
Young Researchers and Elite Club, South Tehran Branch, Islamic Azad University, Tehran, Iran.
Young Researchers and Elite Club, South Tehran Branch, Islamic Azad University, Tehran, Iran.
AUTHOR
H.
Hashemi
true
4
Young Researchers and Elite Club, South Tehran Branch, Islamic Azad University, Tehran, Iran
Young Researchers and Elite Club, South Tehran Branch, Islamic Azad University, Tehran, Iran
Young Researchers and Elite Club, South Tehran Branch, Islamic Azad University, Tehran, Iran
AUTHOR
ORIGINAL_ARTICLE
Determining Malmquist Productivity Index in DEA and DEA-R based on Value Efficiency
Malmquist Productivity Index (MPI) is a numeric index that is of great importance in measuring productivity and its changes. In recent years, tools like DEA have been utilized for determining MPI. In the present paper, some models are recommended for calculating MPI when there are just ratio data available. Then, using DEA and DEA-R, some models are proposed under the constant returns to scale (CRS) technology and based on value efficiency (VE) in order to calculate MPI when there is just a ratio of the output to the input data (and vice versa). Finally, in an applied study on 30 welfare service companies under CRS technology, the progress and/or regression of companies are determined in DEA and DEA-R.
http://ijim.srbiau.ac.ir/article_9274_68c6aceb8409a720fea5afaa5f39014a.pdf
2016-08-01T11:23:20
2018-03-19T11:23:20
241
254
Malmquist
Value Efficiency
DEA
DEA-R
M. R.
Mozaffari
mozaffari854@yahoo.com
true
1
Department of Mathematics, Shiraz Branch, Islamic Azad University, Shiraz, Iran.
Department of Mathematics, Shiraz Branch, Islamic Azad University, Shiraz, Iran.
Department of Mathematics, Shiraz Branch, Islamic Azad University, Shiraz, Iran.
LEAD_AUTHOR
ORIGINAL_ARTICLE
A Multi-supplier Inventory Model with Permissible Delay in Payment and Discount
This paper proposes a multi-supplier multi-product inventory model in which the suppliers have unlimited production capacity, allow delayed payment, and offer either an all-unit or incremental discount. The retailer can delay payment until after they have sold all the units of the purchased product. The retailerâ€™s warehouse is limited, but the surplus can be stored in a rented warehouse at a higher holding cost. The demand over a finite planning horizon is known. This model aims to choose the best set of suppliers and also seeks to determine the economic order quantity allocated to each supplier. The model will be formulated as a mixed integer and nonlinear programming model which is NP-hard and will be solved by using genetic algorithm (GA), simulated annealing (SA) algorithm, and vibration damping optimization (VDO) algorithm. Finally, the performance of the algorithms will be compared.
http://ijim.srbiau.ac.ir/article_9275_4b6726bc95d4919fe318de54b8079811.pdf
2016-08-01T11:23:20
2018-03-19T11:23:20
255
268
Economic order quantity
Genetic Algorithm
Simulated annealing
Vibration damping optimization
M.
Farhangi
true
1
Faculty of Industrial and Mechanical Engineering, Qazvin Branch, Islamic Azad University, Qazvin, Iran.
Faculty of Industrial and Mechanical Engineering, Qazvin Branch, Islamic Azad University, Qazvin, Iran.
Faculty of Industrial and Mechanical Engineering, Qazvin Branch, Islamic Azad University, Qazvin, Iran.
AUTHOR
E.
Mehdizadeh
emehdi@qiau.ac.ir
true
2
Faculty of Industrial and Mechanical Engineering, Qazvin Branch, Islamic Azad University, Qazvin, Iran.
Faculty of Industrial and Mechanical Engineering, Qazvin Branch, Islamic Azad University, Qazvin, Iran.
Faculty of Industrial and Mechanical Engineering, Qazvin Branch, Islamic Azad University, Qazvin, Iran.
LEAD_AUTHOR
ORIGINAL_ARTICLE
Flexibility of Variations in Radial and Non-Radial Data Envelopment Analysis Models
One of the major problems in Data Envelopment Analysis (DEA) is to determine the projection of inefficient Decision Making Units (DMUs) into the efficient frontier. In conventional DEA models, inputs and outputs of inefficient DMUs alter arbitrarily for reaching to the efficient frontier. Nevertheless, sometimes the ability of DMUs is defined and restricted. Moreover, there are situations in the real world applications that limited resources exist. Therefore, in these cases inputs and outputs cannot vary irrationally. Actually, there are pre-specified alteration levels of inputs and outputs. For this purpose, the current study proposes DEA-based models, radial and non-radial models, to evaluate the relative efficiency of DMUs with restricted input and output variables. Furthermore, non-radial super-efficiency models are extended for ranking efficient DMUs. An example from the banking sector is used to illustrate the proposed approach.
http://ijim.srbiau.ac.ir/article_9284_e694fc40bf3e261c237e84f8e4532407.pdf
2016-08-01T11:23:20
2018-03-19T11:23:20
269
278
Data envelopment analysis (DEA)
Efficiency
Input/Output
Variations
S.
Kordrostami
kordrostami@liau.ac.ir
true
1
Department of Mathematics, Lahijan Branch, Islamic Azad University, Lahijan, Iran
Department of Mathematics, Lahijan Branch, Islamic Azad University, Lahijan, Iran
Department of Mathematics, Lahijan Branch, Islamic Azad University, Lahijan, Iran
LEAD_AUTHOR
A.
Amirteimoori
true
2
Department of Applied Mathematics, Rasht Branch, Islamic Azad University, Rasht, Iran.
Department of Applied Mathematics, Rasht Branch, Islamic Azad University, Rasht, Iran.
Department of Applied Mathematics, Rasht Branch, Islamic Azad University, Rasht, Iran.
AUTHOR
M.
Jahani Sayyad Noveiri
true
3
Department of Mathematics, Lahijan Branch, Islamic Azad University, Lahijan, Iran.
Department of Mathematics, Lahijan Branch, Islamic Azad University, Lahijan, Iran.
Department of Mathematics, Lahijan Branch, Islamic Azad University, Lahijan, Iran.
AUTHOR
ORIGINAL_ARTICLE
Two-phase Boundary Layer Flow, Heat and Mass Transfer of a Dusty Liquid past a Stretching Sheet with Thermal Radiation
The problem of two-phase MHD boundary layer flow, heat and mass transfer over a stretching sheet with fluid-particle suspension and thermal radiation has been studied. The effect of mass transfer in dusty fluid over a stretching sheet is considered for the first time. The governing equations are reduced to a set of non-linear ordinary differential equations under suitable similarity transformations. The transformed equations are then solved numerically. The influence of various physical parameters such as magnetic parameter, fluid-particle interaction parameters, Prandtl number, Eckert number and thermal radiation parameter on velocity, temperature and concentration of both fluid and particle phase is analyzed. The numerical results of the present investigation were compared with previously published results and found to be an excellent agreement. It is found that, the momentum, thermal and solute boundary layer thickness of both fluid and dust phase are reduced for higher values of mass concentration of suspended dust particles.
http://ijim.srbiau.ac.ir/article_9303_d51b9f50fdf5d36b22fd7b4b929183cc.pdf
2016-08-01T11:23:20
2018-03-19T11:23:20
279
292
Boundary layer flow
heat and mass transfer
Stretching sheet
Thermal radiation
Fluid-particle suspension
Numerical solution.
K. L.
Krupa Lakshmi
true
1
Department of Studies and Research in Mathematics, Kuvempu University, Shimoga-577 451, Karnataka, INDIA.
Department of Studies and Research in Mathematics, Kuvempu University, Shimoga-577 451, Karnataka, INDIA.
Department of Studies and Research in Mathematics, Kuvempu University, Shimoga-577 451, Karnataka, INDIA.
AUTHOR
B. J.
Gireesha
bjgireesu@rediffmail.com
true
2
Department of Studies and Research in Mathematics, Kuvempu University, Shimoga-577 451, Karnataka, INDIA.
Department of Studies and Research in Mathematics, Kuvempu University, Shimoga-577 451, Karnataka, INDIA.
Department of Studies and Research in Mathematics, Kuvempu University, Shimoga-577 451, Karnataka, INDIA.
LEAD_AUTHOR
Rama
S R Gorla
true
3
Department of Mechanical Engineering, Cleveland State University, Cleveland, OHIO, USA.
Department of Mechanical Engineering, Cleveland State University, Cleveland, OHIO, USA.
Department of Mechanical Engineering, Cleveland State University, Cleveland, OHIO, USA.
AUTHOR
B.
Mahanthesh
true
4
Department of Mathematics and Statistics, Christ University, Bangalore-560027, Karnataka, INDIA.
Department of Mathematics and Statistics, Christ University, Bangalore-560027, Karnataka, INDIA.
Department of Mathematics and Statistics, Christ University, Bangalore-560027, Karnataka, INDIA.
AUTHOR
ORIGINAL_ARTICLE
Generalized H-differentiability for solving second order linear fuzzy differential equations
In this paper, a new approach for solving the second order fuzzy differential equations (FDE) with fuzzy initial value, under strongly generalized H-differentiability is presented. Solving first order fuzzy differential equations by extending 1-cut solution of the original problem and solving fuzzy integro-differential equations has been investigated by some authors (see for example \cite{darabi1,TS}), but these methods have been done for fuzzy problems with triangular fuzzy initial value. Therefore by extending the r-cut solutions of the original problem we will obviate this deficiency. The presented idea is based on: if a second order fuzzy differential equation satisfy the Lipschitz condition then the initial value problem has a unique solution on a specific interval, therefore our main purpose is to present a method to find an interval on which the solution is valid.
http://ijim.srbiau.ac.ir/article_9311_8ad3a79c53a5c322e00dcab156a70273.pdf
2016-08-01T11:23:20
2018-03-19T11:23:20
293
301
Fuzzy differential equations (FDE)
Strongly generalized H-differentiability
r-cut solutions
P.
Darabi
pedarabi@gmail.com
true
1
Department of Mathematics, Farhangian University, Tehran, Iran.
Department of Mathematics, Farhangian University, Tehran, Iran.
Department of Mathematics, Farhangian University, Tehran, Iran.
LEAD_AUTHOR
S.
Moloudzadeh
true
2
Department of Mathematics, Faculty of Education, Soran University, Soran/Erbil, Kurdistan Region, Iraq.
Department of Mathematics, Faculty of Education, Soran University, Soran/Erbil, Kurdistan Region, Iraq.
Department of Mathematics, Faculty of Education, Soran University, Soran/Erbil, Kurdistan Region, Iraq.
AUTHOR
H.
Khandani
true
3
Department of Mathematics, Mahabad Branch, Islamic Azad University, Mahabad, Iran.
Department of Mathematics, Mahabad Branch, Islamic Azad University, Mahabad, Iran.
Department of Mathematics, Mahabad Branch, Islamic Azad University, Mahabad, Iran.
AUTHOR
ORIGINAL_ARTICLE
Numerical Solution of Fractional Control System by Haar-wavelet Operational Matrix Method
In recent years, there has been greater attempt to find numerical solutions of differential equations using wavelet's methods. The following method is based on vector forms of Haar-wavelet functions. In this paper, we will introduce one dimensional Haar-wavelet functions and the Haar-wavelet operational matrices of the fractional order integration. Also the Haar-wavelet operational matrices of the fractional order differentiation are obtained. Then we propose the Haar-wavelet operational matrix method to achieve the Haar-wavelet time response output solution of fractional order linear systems where a fractional derivative is defined in the Caputo sense. Using collocation points, we have a Sylvester equation which can be solve by Block Krylov subspace methods. So we have analyzed the errors. The method has been tested by a numerical example. Since wavelet representations of a vector function can be more accurate and take less computer time, they are often more useful.
http://ijim.srbiau.ac.ir/article_9321_f560edcfffb097d4a30b1308f8f1d189.pdf
2016-08-01T11:23:20
2018-03-19T11:23:20
303
312
Fractional control system
Haar wavelet
Sylvester equation
M.
Mashoof
true
1
Department of Mathematics, Lahijan Branch, Islamic Azad University, Lahijan, Iran.
Department of Mathematics, Lahijan Branch, Islamic Azad University, Lahijan, Iran.
Department of Mathematics, Lahijan Branch, Islamic Azad University, Lahijan, Iran.
AUTHOR
A. H.
Refahi Sheikhani
ah\_refahi@liau.ac.ir
true
2
Department of Mathematics, Lahijan Branch, Islamic Azad University, Lahijan, Iran.
Department of Mathematics, Lahijan Branch, Islamic Azad University, Lahijan, Iran.
Department of Mathematics, Lahijan Branch, Islamic Azad University, Lahijan, Iran.
LEAD_AUTHOR