scholarly journals Analysis of the Production Task Model With Fuzzy Information About Direct Cost Factors and the Final Product Demand

2019 ◽  
Vol 09 (4) ◽  
pp. 32-45 ◽  
Author(s):  
A.V. Panteleev ◽  
V.S. Saveleva
Keyword(s):  
Strong Solution ◽  
Direct Cost ◽  
Linear Equations ◽  
Sufficient Conditions ◽  
Production Task ◽  
Fuzzy Information ◽  
System Of Linear Equations ◽  
Fuzzy Matrix ◽  
Linear System Of Equations ◽  
The Matrix

The article discusses the study of a mathematical model of execution of the production task in the presence of fuzzy information about the matrixes of direct costs and final demand. By solving a problem with fuzzy information we mean the solution of a linear system of equations with a fuzzy matrix and a fuzzy right-hand side described by fuzzy triangular numbers in a form of deviations from the mean. In this task of search of inter-sectoral balance the LU-decomposition method for the matrix of direct cost which is further used for solving the system of linear equations is applied. A software implementation of a numerical method for finding a strong solution of a fuzzy system of linear equations consisting of two successive stages is described. At the first stage, the necessary and sufficient conditions for the existence of a strong solution are verified. At the second stage, the solution of the system is found, which is written in the form of a fuzzy matrix. The influence of the fuzzy numbers parameters on the final result was studied.

Spectral analysis of M/G/1 and G/M/1 type Markov chains

1996 ◽  
Vol 28 (01) ◽  
pp. 114-165 ◽  
Author(s):  
H. R. Gail ◽  
S. L. Hantler ◽  
B. A. Taylor
Keyword(s):  
Markov Chains ◽  
Generating Functions ◽  
Complex Analysis ◽  
Linear Equations ◽  
Sufficient Conditions ◽  
Equilibrium Analysis ◽  
Transform Method ◽  
Technical Problems ◽  
The Matrix ◽  
Transient Case

When analyzing the equilibrium behavior of M/G/1 type Markov chains by transform methods, restrictive hypotheses are often made to avoid technical problems that arise in applying results from complex analysis and linear algebra. It is shown that such restrictive assumptions are unnecessary, and an analysis of these chains using generating functions is given under only the natural hypotheses that first moments (or second moments in the null recurrent case) exist. The key to the analysis is the identification of an important subspace of the space of bounded solutions of the system of homogeneous vector-valued Wiener–Hopf equations associated with the chain. In particular, the linear equations in the boundary probabilities obtained from the transform method are shown to correspond to a spectral basis of the shift operator on this subspace. Necessary and sufficient conditions under which the chain is ergodic, null recurrent or transient are derived in terms of properties of the matrix-valued generating functions determined by transitions of the Markov chain. In the transient case, the Martin exit boundary is identified and shown to be associated with certain eigenvalues and vectors of one of these generating functions. An equilibrium analysis of the class of G/M/1 type Markov chains by similar methods is also presented.

scholarly journals Matrix and vector sequence transformations revisited

1995 ◽  
Vol 38 (3) ◽  
pp. 495-510 ◽  
Author(s):  
C. Brezinski ◽  
A. Salam
Keyword(s):  
Linear Equations ◽  
Convergence Acceleration ◽  
Difference Operators ◽  
Scalar Case ◽  
Extrapolation Methods ◽  
System Of Linear Equations ◽  
Vector Sequence ◽  
The Matrix ◽  
Sequence Transformations

Sequence transformations are extrapolation methods. They are used for the purpose of convergence acceleration. In the scalar case, such algorithms can be obtained by two different approaches which are equivalent. The first one is an elimination approach based on the solution of a system of linear equations and it makes use of determinants. The second approach is based on the notion of annihilation difference operators. In this paper, these two approaches are generalized to the matrix and the vector cases.

scholarly journals A novel interpretation of least squares solution

1992 ◽  
Vol 15 (1) ◽  
pp. 41-46
Author(s):  
Jack-Kang Chan
Keyword(s):  
Least Squares ◽  
Source Localization ◽  
Convex Combination ◽  
Linear Equations ◽  
Singular Values ◽  
Statistical Interpretation ◽  
System Of Linear Equations ◽  
Overdetermined System ◽  
The Matrix ◽  
Cramer’S Rule

We show that the well-known least squares (LS) solution of an overdetermined system of linear equations is a convex combination of all the non-trivial solutions weighed by the squares of the corresponding denominator determinants of the Cramer's rule. This Least Squares Decomposition (LSD) gives an alternate statistical interpretation of least squares, as well as another geometric meaning. Furthermore, when the singular values of the matrix of the overdetermined system are not small, the LSD may be able to provide flexible solutions. As an illustration, we apply the LSD to interpret the LS-solution in the problem of source localization.

scholarly journals MATHEMATICAL MODELING OF THE 3(Н)-QUINAZOLIN-4-ONЕ SYNTHESIS PROCESS

2021 ◽  
pp. 51-57
Keyword(s):  
Mathematical Modeling ◽  
Reaction Rate ◽  
Linear Equations ◽  
Product Yield ◽  
Farm Animals ◽  
Synthesis Process ◽  
Optimal Conditions ◽  
System Of Linear Equations ◽  
Molar Ratios ◽  
The Matrix

The aim is to optimize the conditions for the synthesis of 3(H)-quinazolin-4-one by the method of mathematical modeling to develop a technology for producing the substance of a new domestic drug used in the treatment of farm animals from helminths. In mathematical modeling, the method of a small number of squares was used. Analytical dependences of the product yield on temperature, reaction time, and molar ratios of the starting materials were determined. A system of linear equations has been compiled. The system of linear equations was performed by the matrix method (A, B, C).The average reaction rate was determined. Based on the results obtained, a 3(H)-quinazolin-4-one diagram using the Maple 18 program and an icon diagram of the reaction duration, temperature, and reaction rate are shown. Based on the results of mathematical modeling, a highly efficient technological scheme for obtaining 3(H)-quinazolin-4-one has been developed. Based on this technology, compound 3(H)-quinazolin-4-one was synthesized in quantitative products at the Institute of Plant Chemistry, at a pilot production plant.The results obtained confirmed the found optimal conditions

scholarly journals HERMITE POLYNOMIAL APPROACH FOR SOLVING SINGULAR PERTURBATED DELAY DIFFERENTIAL EQUATIONS

2020 ◽  
Vol 20 (4) ◽  
pp. 845-854
Author(s):  
SUAYIP YUZBASI ◽  
NURCAN BAYKUS SAVASANERIL
Keyword(s):  
Algebraic System ◽  
Hermite Polynomial ◽  
Linear Equations ◽  
Hermite Polynomials ◽  
System Of Linear Equations ◽  
Collocation Points ◽  
The Matrix ◽  
Collocation Approach ◽  
Delay Differential ◽  
Derivatives Of

In this study, a collocation approach based on the Hermite polyomials is applied to solve the singularly perturbated delay differential eqautions by boundary conditions. By means of the matix relations of the Hermite polynomials and the derivatives of them, main problem is reduced to a matrix equation. And then, collocation points are placed in equation of the matrix. Hence, the singular perturbed problem is transformed into an algebraic system of linear equations. This system is solved and thus the coefficients of the assumed approximate solution are determined. Numerical applications are made for various values of N.

scholarly journals Improved Heuristics for Short Linear Programs

2019 ◽  
pp. 203-230
Author(s):  
Quan Quan Tan ◽  
Thomas Peyrin
Keyword(s):  
Random Matrices ◽  
Selection Criteria ◽  
Block Cipher ◽  
State Of The Art ◽  
Linear Equations ◽  
Linear Programs ◽  
System Of Linear Equations ◽  
New Methods ◽  
The Matrix

In this article, we propose new heuristics for minimising the amount of XOR gates required to compute a system of linear equations in GF(2). We first revisit the well known Boyar-Peralta strategy and argue that a proper randomisation process during the selection phases can lead to great improvements. We then propose new selection criteria and explain their rationale. Our new methods outperform state-of-the-art algorithms such as Paar or Boyar-Peralta (or open synthesis tools such as Yosys) when tested on random matrices with various densities. They can be applied to matrices of reasonable sizes (up to about 32 × 32). Notably, we provide a new implementation record for the matrix underlying the MixColumns function of the AES block cipher, requiring only 94 XORs.

scholarly journals Convergence of relaxed chaotic parallel iterative methods

1994 ◽  
Vol 50 (1) ◽  
pp. 167-176 ◽  
Author(s):  
Peter E. Kloeden ◽  
Dong-Jin Yuan
Keyword(s):  
Iterative Methods ◽  
Large Scale ◽  
Linear Equations ◽  
Sufficient Conditions ◽  
System Of Linear Equations ◽  
Parallel Iterative Methods ◽  
Parallel Iterative

Sufficient conditions involving uniform multisplittings are established for the convergence of relaxed and AOR versions of asynchronous or chaotic parallel iterative methods for solving a large scale nonsingular system of linear equations Ax = b.

FUZZY CENTRE BASED SOLUTION OF FUZZY COMPLEX LINEAR SYSTEM OF EQUATIONS

2013 ◽  
Vol 21 (04) ◽  
pp. 629-642 ◽  
Author(s):  
DIPTIRANJAN BEHERA ◽  
S. CHAKRAVERTY
Keyword(s):  
Linear Time ◽  
Linear Equations ◽  
Electric Circuit ◽  
System Of Linear Equations ◽  
New Approach ◽  
Linear System Of Equations ◽  
Linear Time Invariant ◽  
Complex Linear ◽  
Time Invariant ◽  
Good Agreement

A new approach to solve Fuzzy Complex System of Linear Equations (FCSLE) based on fuzzy complex centre procedure is presented here. Few theorems related to the investigation are stated and proved. Finally the presented procedure is used to analyze an example problem of linear time invariant electric circuit with complex crisp coefficient and fuzzy complex sources. The results obtained are also compared with the known solutions and are found to be in good agreement.

Spectral analysis of M/G/1 and G/M/1 type Markov chains

1996 ◽  
Vol 28 (1) ◽  
pp. 114-165 ◽  
Author(s):  
H. R. Gail ◽  
S. L. Hantler ◽  
B. A. Taylor
Keyword(s):  
Markov Chains ◽  
Generating Functions ◽  
Complex Analysis ◽  
Linear Equations ◽  
Sufficient Conditions ◽  
Equilibrium Analysis ◽  
Transform Method ◽  
Technical Problems ◽  
The Matrix ◽  
Transient Case

When analyzing the equilibrium behavior of M/G/1 type Markov chains by transform methods, restrictive hypotheses are often made to avoid technical problems that arise in applying results from complex analysis and linear algebra. It is shown that such restrictive assumptions are unnecessary, and an analysis of these chains using generating functions is given under only the natural hypotheses that first moments (or second moments in the null recurrent case) exist. The key to the analysis is the identification of an important subspace of the space of bounded solutions of the system of homogeneous vector-valued Wiener–Hopf equations associated with the chain. In particular, the linear equations in the boundary probabilities obtained from the transform method are shown to correspond to a spectral basis of the shift operator on this subspace. Necessary and sufficient conditions under which the chain is ergodic, null recurrent or transient are derived in terms of properties of the matrix-valued generating functions determined by transitions of the Markov chain. In the transient case, the Martin exit boundary is identified and shown to be associated with certain eigenvalues and vectors of one of these generating functions. An equilibrium analysis of the class of G/M/1 type Markov chains by similar methods is also presented.

Sign in / Sign up

Export Citation Format

Share Document