I am solving a system of linear equations Ax=b where A is a matrix (121*121) which contains a rational polynomial of unknown "kappa" along with floating numbers. I am using Linear algebra package with the LinearSolve command and option "solve" to find out unknown vector x in MAPLE 18. b is a vector having entries zero and 1. Maple solves for x and result is a long expression i.e. x[i] is a rational polynomial in kappa; a very long rational polynomial which I am importing as a text. The problem is that A*x-b is not close to zero for any randomly chosen value of kappa. In particular, it is seen that for kappa>=4 the error is less but it shoots up for kappa=2. Maple provides an acceptable solution for smaller size Matrix ( for example dimension of A less than 80). What is the best existing solver (Maple, Mathematica, MATLAB (symbolic)) to tackle large no of equations like this?
updates: As suggested by Matthew P., it seems that the round-off error accumulates due to floating point approximation. One way is to use symbolic calculation for as many steps as possible ( retain sqrt(2) and pi as it is, don't use 1.414213562 and 3.141592654 as a replacement ). In this way, the accuracy increases but the overall time for the computation shoots up as the number of equations reaches more than 150. [I am waiting for the results, maple is running for 40 hours]. For the reference, I have attached text files dealing with A*y=b; for 41 equations. Note kappa is replaced by x in the attachment.