Solve A System of Linear Equations with N Unknowns with esProc

For a system of linear equations with n unknowns, the n unknowns require n equations to form an equation set. e.g.:




Then, how do you solve this system of linear equations with n unknowns with esProc? First, the system of equations should be written in a standard form, and parameters are filled in a text file. Parameters in the same line are separated with Tab. As listed below:



How to solve a system of linear equations with n unknowns by programming? Elimination by addition and subtraction is a common method. See the following system of equations:






If a11 is not equal to zero, we multiply each term of the first equation simultaneously by a21/a11,  subtract the first equation from the second one, then the coefficient of x1 in the second equation becomes zero. If a11 equals to zero, we need to find an equation in which the coefficient of x1 is not zero, and make it the first. In this way, we can eliminate all coefficients of x1 in the equations after the first one. See below:






Now let’s look at the case of b22. In the same method, we continue to eliminate coefficients of x2 in all equations after the second one… We do this continuously until the coefficient of xn-1 in the nth equation is eliminated. At this point, the system of equations will be like the following:






And we can solve it step by step from the nth equation:






If, during the calculation, zero appears in parameters like a11,b22,c33, the system of equations has no solution or infinitely many solutions.

The following shows how to solve a system of linear equations with n unknowns with esProc:


In B1, data is read from text files; parameters of system of equations is transformed into sequence groups in A2:

C1 seeks the number of equations in a system of equations, then the result gets looping execution in A3, and coefficients of xn will be gradually eliminated with the method of elimination by addition and subtraction. During looping execution in B4, we look for the first equation in which the coefficient of xk is not zero from the kth equation; if we cannot find one like this, it means that the term cannot get eliminated. Among the code in line 7, move the equation in which the coefficient of xk is not zero to line k. In line 8 and 9, we eliminate coefficient of xk in equations starting from line k+1.

Having done the elimination of every step, we can start to work out solution gradually from the last equation in A10, during which a sequence called result will be used to store solutions.If there is no solution or infinite many solutions, return Error. Considering that there could be errors with double-precision number during computation, the solutions will be kept to four decimal places.
Result can be checked in A13 after all computations:


If new system of equations is required to be solved:

x1+x2+x3 =1
We only need to modify text EquInput.txt:


With the same program, we compute and read result in A13.


In addition, list of parameters is unnecessary to read-in with text. Instead, it can write directly in esProc. The computing progress is similar to that we’ve explained.


About datathinker

a technical consultant on Database performance optimization, Database storage expansion, Off-database computation. personal blog at: datakeywrod, website: raqsoft
This entry was posted in Application, Program Language. Bookmark the permalink.

Leave a Reply

Fill in your details below or click an icon to log in: Logo

You are commenting using your account. Log Out /  Change )

Google+ photo

You are commenting using your Google+ account. Log Out /  Change )

Twitter picture

You are commenting using your Twitter account. Log Out /  Change )

Facebook photo

You are commenting using your Facebook account. Log Out /  Change )


Connecting to %s