engleski

Programming Successive Elimination Method Optimised for Solving Linear Equations System with Populated Matrix

The proposed algorithm of successive elimination method (SEM) is optimised for solving regular linear equations system with matrix that is fully populated and in general not symmetric. The number of numerical operations is same as required for Gauss’ s elimination method, but the requirements to memory space is reduced by 75%. In addition, used memory continuously changes during calculation process, from zero to maximum and back to zero. By that reasons, the number of data swaps between RAM and slow external memory (hard disk) performed by operating system is significantly reduced or completely avoided. That manifests in remarkable speed up of the computer program based on SEM strategy, especially when the bigger equations system is solved. Such computer programs are listed and described in this article.

linear equations system; successive elimination method; numerical method; computer program; algorithm; computer program

nije evidentirano