On the arithmetic complexity of matrix Kronecker powers

DOI10.1016/0020-0190(83)90054-6MaRDI QIDQ594594zbMATH OpenOpenAlexFDO

Authors Gadiel Seroussi, F. Ma

Publication date 1983

Published in Information Processing Letters (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/0020-0190(83)90054-6

zbMATH Keywords

algebraic computational complexityarithmetic complexityKronecker powermatrix multiplication

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25)

Cites work

• scientific article; zbMATH DE number 3839315 (Why is no real title available?)
• scientific article; zbMATH DE number 3200675 (Why is no real title available?)
• Limit theorems for non-commutative operators. I
• On moment behavior of a class of stochastic difference equations
• On the Number of Multiplications Required for Matrix Multiplication
• On the stability of linear and non-linear stochastic transformations
• Rapid Multiplication of Rectangular Matrices

Cited in

(1)

• Stability, performance and sensitivity analysis of I.I.D. jump linear systems

This page was built for publication: On the arithmetic complexity of matrix Kronecker powers

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