• Journal of applied mathematics & informatics
• /
• v.29 no.5_6
• /
• pp.1337-1349
• /
• 2011

So far as a solution of the given consistent linear system is concerned many numerical methods - both mathematically non-iterative as well as iterative - have been reported in the literature over the last couple of centuries. Most of these methods consider all the equations including linearly dependent ones in the system and obtain a solution whenever it exists. Since linearly dependent equations do not add any new information to a system concerning a solution we have proposed an algorithm that identifies them and prunes them in the process of solving the system. The pruning process does not involve row/column interchanges as in the case of Gauss reduction with partial/complete pivoting. We demonstrate here that the use of pruning as an inbuilt part of our solution process reduces computational and storage complexities and also computational error.