INTERNATIONAL JOURNAL OF MATHEMATICAL MODELLING & COMPUTATION
Year:2015 | Volume:5 | Issue:2|Papers Count:8

In this paper simple quartic trigonometric polynomial blending functions, with a tension parameter, are presented. These type of functions are useful for constructing trigonometric Bezier curves and surfaces, they can be applied to construct continuous shape preserving interpolation spline curves with shape parameters. To better visualize objects and graphics a tension parameter is included. In this work we constructed the Trigonometric Bezier curves followed by a construction of the shape preserving interpolation spline curves with local shape parameters and finally several numerical examples are presented such as open shape preserving interpolation curve, closed shape preserving interpolation curve and surfaces. As a direct application we computed the area surrounded by a closed curve.

In this work the collocation method based on quartic B-spline is developed and applied to two-point boundary value problem in ordinary differential equations. The error analysis and convergence of presented method is discussed. The method illustrated by two test examples which verify that the presented method is applicable and considerable accurate.

In this paper, using a generalized Dunkl translation operator, we obtain a generalization of Titchmarsh's Theorem for the Dunkl transform for functions satisfying the (y, p) - Lipschitz Dunkl condition in the space Lp, a=Lp (R, |x|2a+1dx), where a>-1/2.

In this paper, we will discuss the concept of almost sure convergence for specific groups of fuzzy random variables. For this purpose, we use the type of generalized Chebyshev inequalities. Moreover, we show the concept of almost sure convergence of weighted average pairwise NQD of fuzzy random variables.

This paper uses the L1-norm and the concept of the non-dominated vector, to propose a method to find a well-dispersed subset of non-dominated (WDSND) vectors of a multi-objective mixed integer linear programming (MOMILP) problem.The proposed method generalizes the proposed approach by Tohidi and Razavyan [To- hidi G., S. Razavyan (2014), determining a well-dispersed subset of non-dominated vectors of multi-objective integer linear programming problem, International Journal of Industrial Mathematics, (Accepted for publication)] to find a WDSND vectors of an MOMILP problem.

In this paper, the (m+1) -step Adams-Bashforth, Adams-Moulton, and Predictor Corrector methods are used to solve first-order fuzzy linear ordinary differential equations. The concepts of fuzzy interpolation and generalized strongly differentiability are used, to obtain general algorithms. Each of these algorithms has advantages over current methods. Moreover, for each algorithm a convergence formula can be obtained. The convergence of these methods is proven in detail. Finally, these methods are illustrated using examples of initial value problems.

This paper presents the analysis of a finite buffer renewal input queue wherein the customers can decide either to join the queue with a probability or to balk. The service process is Markovian service process (MSP) governed by an underlying m-state Markov chain. Employing the supplementary variable and embedded Markov chain techniques, the steady- state system length distributions at pre-arrival and arbitrary epochs are obtained. Based on the system length distributions, some performance measures of the model and waiting-time analysis are presented. Finally, numerical results are displayed to show the effect of model parameters on the key performance measures.

A mathematical model presented in this paper describes the dispersion and con- centration of contaminants (ne and coarse) in porous medium with the effect of chemical reaction. Solute transport in porous media is discussed by means of advection-dispersion equation. The effect of particle mass parameter and reaction rate parameter on the dispersion coefficient and mean concentration of a chemical solute is studied by introducing a slug of finite length. Analytical solutions are obtained by varying the dimensionless time, axial distance and length of the solute. The results are depicted using graphs.