Solves the system
A %*% x == b for
A is a Kronecker product of matrices.
A list that contains the matrices, preferably of
A conformable numeric vector.
The matrices in the list
A should be square matrices of
Matrix. This allows the user to take advantage of
their special structure (eg sparsity), also, their factors will be
A numeric vector
x which solves the system.
The algorithm (given in the reference) is orders of magnitude
more efficient (both in terms of CPU and memory usage) than computing
the Kronecker product and calling
Tamas K Papp <email@example.com>
Paul E. Buis and Wayne R. Dyksen. Efficient Vector and Parallel Manipulation of Tensor Products. ACM Transactions on Mathematical Software, Vol. 22, No. 1, March 1996, Pages 18–23.
1 2 3 4 5 6 7 8 9
Add the following code to your website.
For more information on customizing the embed code, read Embedding Snippets.