Computes the product
A %*% x, where
A is a
Kronecker product of matrices.
A list that contains the matrices, preferably of class Matrix.
A conformable numeric vector.
The matrices in the list
A should be of the class
Matrix. This allows the user to take advantage of their
special structure (eg sparsity).
A vector which equals
(A[] %x% ... %x% A[[length(A)]])
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 doing the matrix multiplication.
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 10
Add the following code to your website.
For more information on customizing the embed code, read Embedding Snippets.