Solving a System of Linear Algebraic Equations with a Tridiagonal Matrix: A New Look at Cramer’s Rule

2021 ◽  
Vol 14 (3) ◽  
pp. 249-257
Author(s):  
S. K. Kydyraliev ◽  
S. N. Sklyar ◽  
A. B. Urdaletova
2006 ◽  
Vol 6 (3) ◽  
pp. 264-268
Author(s):  
G. Berikelashvili ◽  
G. Karkarashvili

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.


2021 ◽  
Vol 11 (1) ◽  
Author(s):  
Andrey A. Pil’nik ◽  
Andrey A. Chernov ◽  
Damir R. Islamov

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.


2015 ◽  
Vol 4 (3) ◽  
pp. 420 ◽  
Author(s):  
Behrooz Basirat ◽  
Mohammad Amin Shahdadi

<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>


Symmetry ◽  
2021 ◽  
Vol 13 (6) ◽  
pp. 1063
Author(s):  
Vladimir Mityushev ◽  
Zhanat Zhunussova

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.


Author(s):  
D. C. F. Leigh

ABSTRACTA method, very suitable for use with an automatic computer, of solving the Hartree-Womersley approximation to the incompressible boundary-layer equation is developed. It is based on an iterative process and the Choleski method of solving a simultaneous set of linear algebraic equations. The programming of this method for an automatic computer is discussed. Tables of a solution of the boundary-layer equation in a region upstream of the separation point are given. In the upstream neighbourhood of separation this solution is compared with Goldstein's asymptotic solution and the agreement is good.


Sign in / Sign up

Export Citation Format

Share Document