Blit contains a set of highly efficient and open-source iterative sparse linear solvers that can handle multiple right-hand-sides (or block). Compared with the traditional linear solvers which solve for only solution at a time, blit can solve multiple solutions in a single solving process, thus is significantly faster than the conventional solvers. A block solver handles the following equation: A [x1 x2 x3 ... xM]=[b1 b2 b3 ... bM]
where A is a N-by-N sparse (or full) matrix with either real or complex values, bi and xi are the right-hand-side and solution vectors, respectively.