How are simultaneous equations calculated using a computer?
As long as the equations are linear, you can solve them by using Gaussian elimination on the augmented matrix. It's not the fastest way to do it, especially for larger systems of equations, but it's the most intuitive technique, IMO, and pretty simple to code up. Are you looking to write something for yourself to help you learn more about linear algebra?sid_galt said:How are simultaneous equations calculated using a computer?
At the end, of course, since we really only can solve systems of linear equations
I hope you know the evils of cramer's rule. It is bad news.peterbone said:There are lots of different methods. For example, numerically. Here is an analytical method I wrote using Cramer's rule to invert the matrix.
Hurkyl said:What do you mean by that?
As LeBrad mentioned, there aren't any standard, foolproof solution procedure for non-linear equations in general in the way there are for linear systems.Hurkyl said:What do you mean by that?
You just need to think of about Gaussian elimination in a systematic way. That is for an arbitrary matrix at an arbitrary stage in reduction what should be done next. A few whiles and fors and it is done. Other things to think about are if you need to solve multiple systems having the same matrix you might consider using a LU decomposition. To help with round off you might consider full or partial pivoting, or conbining iterative and direct methods.sid_galt said:Thank you for all the replies.
Actually I am looking forward to implementing the vortex panel method in Java. Thing is, methods like Gaussian elimination are fine, only I am finding it difficult how to encode the appropriate elementary row operations to convert the matrix to a triangular one.