A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is
Triangular solution of linear systems in tensor product format
Performance Evaluation Review
This paper presents an algorithm to solve linear systems expressed by a matrix stored in a tensor product format. The proposed solution is based on a LU decomposition of the matrix keeping the tensor product structure. It is shown that the complexity of the decomposition is negligible and the backward and forward substitutions are no more complex than two standard vector-matrices multiplications. Finally, applications of the proposed algorithm and the comparison with other similar techniques are discussed.doi:10.1145/544397.544409 fatcat:bado4fsi5vb6bkkhpsv2qpdb6y