Thread: Solving purely symbolic systems of linear equations

Hello,

I'm working through a finite element text which provides a symbolic solution to a system of linear equations which I suspect might be incorrect based on some checks that I've done. I'm interested in double checking their math, but I'm finding it excessively complicated with the techniques that I know how to use. Here is the system:





I'm trying to solve for .



First I tried substitution by solving the first equation for and plugging into the second equation. Then I tried solving that for , etc. The math just got so messy that I gave up.

I next tried setting up the equations in matrix format:



I tried solving for the alpha vector by inverting the 3x3 matrix using Gauss-Jordan elimination on the following:



This seems just as complicated. I noticed that the book made mention of a determinant in the solution (although it did not show a solution process. Is there an easier way of solving this system symbolically that I am not aware of?

Thanks,
James

I think it's just Gaussian elimination. However, since you must divide by variables at some spots, you gotta make sure that you don't get zeroes in the denominator. The system has a unique solution if the matrix is invertible, right? So you can just take the determinant and see.

Hint: Once you solve for a1,a2 and a3, the denominators will be just the determinant of the coefficient matrix.

In fact, try the 2D case and then extend it.

Hi Vlasev,

Thanks for your response!

I went through the 2D case and was able to prove to myself that the denominator is the determinant of the coefficient matrix. I would like to now understand how I can use that knowledge a priori when solving to somehow simplify the process. As I see it, it doesn't really eliminate any complexity if I still have to solve the whole system longhand and then pull out the determinant from the denominators of each entry after the fact. Is there some trick that I'm missing here?

Thanks,
James