Theory of Approximation and ApplicationsTheory of Approximation and Applications
http://msj.iau-arak.ac.ir/
Mon, 25 Mar 2019 19:34:00 +0100FeedCreatorTheory of Approximation and Applications
http://msj.iau-arak.ac.ir/
Feed provided by Theory of Approximation and Applications. Click to visit.Numerical Solution of the Burgers' Equation Based on Sinc Method
http://msj.iau-arak.ac.ir/article_663606_0.html
Burgers' equation arises in various areas of applied mathematics,‎‎such as modeling of dynamics‎, ‎heat conduction‎, ‎and acoustic‎‎waves‎ Also‎, ‎this equation has a large variety of applications in‎‎the modeling of water in unsaturated soil‎, ‎dynamics of soil‎‎water‎, ‎models of traffic‎, ‎turbulence and fluid flow‎, ‎mixing and‎‎turbulent diffusion. Many researchers tried to find analytic and numerical solutions of‎‎ this equation by different methods.Sinc method is a powerful numerical tool for finding fast and‎‎accurate solution in various areas of problems.‎In this paper‎, ‎numerical solution of Burgers' equation‎‎is considered by applying Sinc method‎. ‎For this purpose‎, ‎we apply‎‎Sinc method in cooperative with a classic finite difference‎‎formula to‎ ‎Burgers'equation‎. ‎‎The purpose of this paper is to extend the application of the‎‎sinc method for solving Burgers'equation by considering stability‎‎analysis of the method.‎ Numerical examples are provided to verify the validity of proposed methodSun, 03 Mar 2019 20:30:00 +0100Constacyclic Codes over Group Ring (Zq[v])/G
http://msj.iau-arak.ac.ir/article_663607_0.html
Recently, codes over some special ﬁnite rings especially chain rings have been studied. More recently, codes over ﬁnite non-chain rings have been also considered. Study on codes over such rings or rings in general is motivated by the existence of some special maps called Gray maps whose images give codes over ﬁelds. Quantum error-correcting (QEC) codes play a crucial role in protecting quantum information. The construction of quantum codes via classical codes over 2 F was ﬁrst introduced by Calderbank and Shor [4] and Steane [13] in 1996. This method, known as CSS construction, has received a lot of attention and it has allowed to ﬁnd many good quantum stabilizer codes. Later, construction of quantum codes over larger alphabets from classical linear codes over q F has shown by Ketkar et al. in [10]. One direction of the main research in quantum error correction codes is constructing quantum codes that have large minimum distances [9] for a given size and length. In [14], based on classical quaternary constacyclic linear codes, some parameters for quantum codes are obtained. In [8, 9], respectively based on classical negacyclic and constacyclic linear codes some parameters for quantum MDS codes are presented. In this work, we determine self-dual and self-orthogonal codes arising from constacyclic codes over the group ring(Zq[v]/GSun, 03 Mar 2019 20:30:00 +0100Spectral method for Solving Fuzzy Volterra Integral Equations of Second kind
http://msj.iau-arak.ac.ir/article_663608_0.html
This paper, about the solution of fuzzy Volterra integral equation of fuzzy Volterra integral equation of second kind (F-VIE2) using spectral method is discussed. The parametric form of fuzzy driving term is applied for F-VIE2. Then three cases for (F-VIE2) are searched to solve them. This classifications are considered based on the sign of interval. The Gauss-Legendre points and Legendre weights for arithmetics in spectral method are used to solve (F-VIE2). Finally two examples are got to illustrate more.b b b b b b b b b b b b b b b b b b b b b b b b b b b b b b b b b b b b b b b b b b b b b b b b b b b b b b b b b b b b b b b b b b b b b b b b b b b b b b bSun, 03 Mar 2019 20:30:00 +0100Measurement of Inefficiency Slacks in Network Data Envelopment Analysis
http://msj.iau-arak.ac.ir/article_663609_0.html
The two-stage data envelopment analysis models show the performance of individual processes and thus, provide more information for decision-making compared with conventional one-stage models. This article presents a set of additive models (optimistic and pessimistic) to measure inefficiency slacks in which observations are shown with crisp numbers. In the concept of pessimistic efficiency, DMU with balanced input and output data can be scored as efficient. Since pessimistic efficiency represents the minimum efficiency that is guaranteed in any unfavorable conditions, the assessment based on this efficiency is in compliance with our natural meaning, especially in risk-averse situations. Therefore, pessimistic efficiency solely can play a useful role in the DMU ranking. However, it is not a good idea to ignore optimistic efficiency. Hence, it is an inevitable necessity to integrate different performance sizes in order to achieve an overall performance assessment for each DMU. An example of resin manufacturer companies in Iran is presented to explain how to calculate the system and process inefficiency slacks.Sun, 03 Mar 2019 20:30:00 +0100Domination Number of Nagata Extension Ring
http://msj.iau-arak.ac.ir/article_546274_116543.html
Aََََbstract:Let R is a commutative ring whit Z(R) as the set of zero divisors. The total graph of R, denoted by T ((R)) is the (undirected) graph with all elements of R as vertices, and two distinct vertices are adjacent if their sum is a zero divisor. For a graph G = (V; E), a set S is a dominating set if every vertex in V n S is adjacent to a vertex in S. The domination number is equal |S|where |S| is minimum. For R-module M, an Nagata extension (idealization), denoted by R(+)M is a ring with identity and for two elements (r; m); (s; n) of R(+)M we have (r; m) + (s; n) = (r + s; m + n) and (r; m)(s; n) = (rs; rn + sm). In this paper, we seek to determine the bound for the domination number of total graph T ((R(+)M)).Thu, 28 Feb 2019 20:30:00 +0100Fuzzy Farthest Points and Fuzzy Best Approximation Points in Fuzzy Normed Spaces
http://msj.iau-arak.ac.ir/article_546275_116543.html
In this paper we define fuzzy farthest points, fuzzy best approximation points and farthest orthogonality in fuzzy normed spaces and we will find some results. We prove some existence theorems, also we consider fuzzy Hilbert and show every nonempty closed and convex subset of a fuzzy Hilbert space has an unique fuzzy best approximation.It is well know that the conception of fuzzy sets, firstly defined by Zadeh in 1965. Fuzzy set theory provides us with a framework which is wider than that of classical set theory. Various mathematical structures, whose features emphasize the effects of ordered structure, can be developed on the theory. The theory of fuzzy sets has become an area of active research for the last forty years. On the other hand, the notion of fuzzyness has a wide application in many areas of science and engineering, chaos control, nonlinear dynamical systems, etc. In physics, for example, the fuzzy structure of space time is followed by the fat that in strong quantum gravity regime space time points are determined in a fuzzy manner.Thu, 28 Feb 2019 20:30:00 +0100