Algorithm 993: Efficient computation with Kronecker products

DOI10.1145/3291041MaRDI QIDQ5237435zbMATH OpenOpenAlexWikidataFDO

Authors Paul L. Fackler

Publication date 18 October 2019

Published in ACM Transactions on Mathematical Software (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1145/3291041

zbMATH Keywords

Kronecker productstensor products

Mathematics Subject Classification ID

Numerical linear algebra (65F99)

Recommendations

• On vector-Kronecker product multiplication with rectangular factors
• Computation of Matrix Chain Products. Part II
• A matrix extension of Winograd's inner product algorithm
• Complexity of Memory-Efficient Kronecker Operations with Applications to the Solution of Markov Models
• Simple algorithms about Kronecker products in the linear model

Cited in

(13)

• Simple algorithms about Kronecker products in the linear model
• Efficient implementation of some contextual classification methods
• An efficient method for performing discrete convolution using Kronecker products
• On vector-Kronecker product multiplication with rectangular factors
• Kronecker products and shuffle algebra
• Block Kronecker product of matrices
• Algorithm 993
• Algorithm 939
• Algorithm 942
• Constructive algorithm to vectorize (P P product for symmetric matrix P
• Paulicomposer: compute tensor products of Pauli matrices efficiently
• Design through analysis
• Efficient method for computing double matrix products

Describes a project that uses

Uses Software

• TENPACK
• kronm

This page was built for publication: Algorithm 993: Efficient computation with Kronecker products

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5237435)