Are there any special algorithms which solves a sparse linear system efficiently when the rhs of the system has only a few nonzero elements or the the rhs is a basis vector ?
The size of the matrix has commonly more than a few ten thousand entries and is complex, unsymmetric but square. I want to calculate the solution to the system many times but not more than the size of the rhs. The rhs changes but has a constant number in the range of 1 to 200 non zero entries. This value is fix, but the position in the vector change for each run.