Using gauss - Jordan elimination method with CUDA for linear circuit equation systems


1st World Conference on Innovation and Software Development (INSODE), İstanbul, Türkiye, 2 - 10 Ekim 2011, cilt.1, ss.31-35 identifier

  • Cilt numarası: 1
  • Doi Numarası: 10.1016/j.protcy.2012.02.008
  • Basıldığı Şehir: İstanbul
  • Basıldığı Ülke: Türkiye
  • Sayfa Sayıları: ss.31-35


Many scientific and engineering problems can use a system of linear equations. In this study, solution of Linear Circuit Equation System (LCES) for an nxn matrix using Compute Unified Device Architecture (CUDA) is described. Solution of LCES is realized on Graphics Processing Unit (GPU) instead of Central Processing Unit (CPU). CUDA is a parallel computing architecture developed by NVIDIA. Linear Circuits include resistance, impedance, capacitance, dependent - independent current sources and DC, AC voltage source. In this study, solutions of circuits that include resistance, independent current sources and DC voltage source have analyzes. Circuit analysis frequently involves solution of linear simultaneous equations that are solved Gauss-Jordan Elimination Method in this study. Gauss-Jordan Elimination is a variant of Gaussian Elimination that a method of solving a linear system equations (Ax=B). Gauss-Jordan Elimination is an algorithm for getting matrices in reduced row echelon form using elementary row operations. Gaussian Elimination has two parts. The first part (Forward Elimination) reduces a given system to triangular form. The second step uses back substitution to find the solution of the triangular echelon form system Because of elements of unknowns column matrix are dependent on each other, second step algorithm is not appropriate for parallel programming. Two parts of Gauss-Jordan Elimination are not like Gaussian Elimination's part so it is preferred. GPU implementation is more faster than solution of linear equation systems on CPU. (C) 2011 Published by Elsevier Ltd.