scholarly journals Algorithm for the set of similarity criteria formation for a physical process in the class of homogeneous functions

2021 ◽  
Vol 9 (6) ◽  
pp. 38-43
Author(s):  
Anatolii Alpatov ◽  
Victor Kravets ◽  
Dmytro Kolosov ◽  
Volodymyr Kravets ◽  
Erik Lapkhanov
Keyword(s):  
Linear Programming ◽  
Physical Process ◽  
General Algorithm ◽  
Similarity Criteria ◽  
Algebraic Equations ◽  
Combinatorial Method ◽  
Cayley Table ◽  
Homogeneous Functions ◽  
Linear Programming Methods ◽  
Linear Algebraic Equations

The efficiency of application of linear programming methods to problems of the theory of similarity and dimensions is shown. A general algorithm for formation of the set of similarity criteria for a physical process in the class of homogeneous functions is proposed. The set of systems of linear algebraic equations is created using the combinatorial method and chain diagrams. Basic and free variables and their corresponding variants of dimensionless sets of independent arguments, which are taken as the main similarity criteria, are distinguished. The set of derived similarity criteria is found using the basic criteria and the Cayley table.

scholarly journals Solving Linear Programming Problems by Reducing to the Form with an Obvious Answer

2021 ◽  
Vol 28 (4) ◽  
pp. 434-451
Author(s):  
Gleb D. Stepanov
Keyword(s):  
Linear Programming ◽  
Simplex Method ◽  
Basic Solution ◽  
Algebraic Equations ◽  
Farkas Lemma ◽  
Second Stage ◽  
Positive Elements ◽  
Linear Algebraic Equations ◽  
The Matrix ◽  
The Right

The article considers a method for solving a linear programming problem (LPP), which requires finding the minimum or maximum of a linear functional on a set of non-negative solutions of a system of linear algebraic equations with the same unknowns. The method is obtained by improving the classical simplex method, which when involving geometric considerations, in fact, generalizes the Gauss complete exclusion method for solving systems of equations. The proposed method, as well as the method of complete exceptions, proceeds from purely algebraic considerations. It consists of converting the entire LPP, including the objective function, into an equivalent problem with an obvious answer. For the convenience of converting the target functional, the equations are written as linear functionals on the left side and zeros on the right one. From the coefficients of the mentioned functionals, a matrix is formed, which is called the LPP matrix. The zero row of the matrix is the coefficients of the target functional, $a_{00}$ is its free member. The algorithms are described and justified in terms of the transformation of this matrix. In calculations the matrix is a calculation table. The method under consideration by analogy with the simplex method consists of three stages. At the first stage the LPP matrix is reduced to a special 1-canonical form. With such matrices one of the basic solutions of the system is obvious, and the target functional on it is $ a_{00}$, which is very convenient. At the second stage the resulting matrix is transformed into a similar matrix with non-positive elements of the zero column (except $a_{00}$), which entails the non-negativity of the basic solution. At the third stage the matrix is transformed into a matrix that provides non-negativity and optimality of the basic solution. For the second stage the analog of which in the simplex method uses an artificial basis and is the most time-consuming, two variants without artificial variables are given. When describing the first of them, along the way, a very easy-to-understand and remember analogue of the famous Farkas lemma is obtained. The other option is quite simple to use, but its full justification is difficult and will be separately published.

On Improved Approximate Solution of the Fredholm Integral Equation

2006 ◽  
Vol 6 (3) ◽  
pp. 264-268
Author(s):  
G. Berikelashvili ◽  
G. Karkarashvili
Keyword(s):  
Integral Equation ◽  
Approximate Solution ◽  
Fredholm Integral Equation ◽  
Algebraic Equations ◽  
Order Convergence ◽  
One Dimensional ◽  
Averaging Operator ◽  
Linear Algebraic Equations ◽  
Convergence Solution

AbstractA method of approximate solution of the linear one-dimensional Fredholm integral equation of the second kind is constructed. With the help of the Steklov averaging operator the integral equation is approximated by a system of linear algebraic equations. On the basis of the approximation used an increased order convergence solution has been obtained.

scholarly journals Exact statistical solution for the hopping transport of trapped charge via finite Markov jump processes

2021 ◽  
Vol 11 (1) ◽  
Author(s):  
Andrey A. Pil’nik ◽  
Andrey A. Chernov ◽  
Damir R. Islamov
Keyword(s):  
Charge Transport ◽  
Thin Layers ◽  
Jump Processes ◽  
Dielectric Films ◽  
Algebraic Equations ◽  
Markov Jump ◽  
Statistical Solution ◽  
Linear Algebraic Equations ◽  
Special Cases ◽  
Thin Dielectric Films

AbstractIn this study, we developed a discrete theory of the charge transport in thin dielectric films by trapped electrons or holes, that is applicable both for the case of countable and a large number of traps. It was shown that Shockley–Read–Hall-like transport equations, which describe the 1D transport through dielectric layers, might incorrectly describe the charge flow through ultra-thin layers with a countable number of traps, taking into account the injection from and extraction to electrodes (contacts). A comparison with other theoretical models shows a good agreement. The developed model can be applied to one-, two- and three-dimensional systems. The model, formulated in a system of linear algebraic equations, can be implemented in the computational code using different optimized libraries. We demonstrated that analytical solutions can be found for stationary cases for any trap distribution and for the dynamics of system evolution for special cases. These solutions can be used to test the code and for studying the charge transport properties of thin dielectric films.

scholarly journals Two matrix methods for solution of nonlinear and linear Lane-Emden type equations with mixed condition by operational matrix

2015 ◽  
Vol 4 (3) ◽  
pp. 420 ◽  
Author(s):  
Behrooz Basirat ◽  
Mohammad Amin Shahdadi
Keyword(s):  
Bernstein Polynomials ◽  
Operational Matrix ◽  
Numerical Procedure ◽  
Operational Matrices ◽  
Algebraic Equations ◽  
Mixed Condition ◽  
Matrix Methods ◽  
Numerical Examples ◽  
Linear Algebraic Equations ◽  
The Given

<p>The aim of this article is to present an efficient numerical procedure for solving Lane-Emden type equations. We present two practical matrix method for solving Lane-Emden type equations with mixed conditions by Bernstein polynomials operational matrices (BPOMs) on interval [<em>a; b</em>]. This methods transforms Lane-Emden type equations and the given conditions into matrix equation which corresponds to a system of linear algebraic equations. We also give some numerical examples to demonstrate the efficiency and validity of the operational matrices for solving Lane-Emden type equations (LEEs).</p>

scholarly journals Optimal Random Packing of Spheres and Extremal Effective Conductivity

Symmetry ◽  
2021 ◽  
Vol 13 (6) ◽  
pp. 1063
Author(s):  
Vladimir Mityushev ◽  
Zhanat Zhunussova
Keyword(s):  
Effective Conductivity ◽  
Dimensional Space ◽  
Elementary Function ◽  
Voronoi Tessellation ◽  
Random Packing ◽  
Periodicity Cell ◽  
Algebraic Equations ◽  
Optimal Packing ◽  
Linear Algebraic Equations ◽  
Initial Location

A close relation between the optimal packing of spheres in Rd and minimal energy E (effective conductivity) of composites with ideally conducting spherical inclusions is established. The location of inclusions of the optimal-design problem yields the optimal packing of inclusions. The geometrical-packing and physical-conductivity problems are stated in a periodic toroidal d-dimensional space with an arbitrarily fixed number n of nonoverlapping spheres per periodicity cell. Energy E depends on Voronoi tessellation (Delaunay graph) associated with the centers of spheres ak (k=1,2,…,n). All Delaunay graphs are divided into classes of isomorphic periodic graphs. For any fixed n, the number of such classes is finite. Energy E is estimated in the framework of structural approximations and reduced to the study of an elementary function of n variables. The minimum of E over locations of spheres is attained at the optimal packing within a fixed class of graphs. The optimal-packing location is unique within a fixed class up to translations and can be found from linear algebraic equations. Such an approach is useful for random optimal packing where an initial location of balls is randomly chosen; hence, a class of graphs is fixed and can dynamically change following prescribed packing rules. A finite algorithm for any fixed n is constructed to determine the optimal random packing of spheres in Rd.

Sign in / Sign up

Export Citation Format

Share Document