An algorithm computing the general entry of the nth Kronecker power of a matrix

DOI10.1109/9.277255MaRDI QIDQ3140218zbMATH OpenOpenAlexFDO

Authors Chiu H. Choi

Publication date 6 December 1993

Published in IEEE Transactions on Automatic Control (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1109/9.277255

zbMATH Keywords

Kronecker power

Mathematics Subject Classification ID

Control/observation systems governed by ordinary differential equations (93C15)

Recommendations

• The \(n\)th power of a matrix and approximations for large \(n\)
• On the Entrywise Powers of Matrices
• An efficient algorithm for computing real powers of a matrix and a related matrix function
• A Schur-Padé algorithm for fractional powers of a matrix
• On the Computation of the Matrixk-th Root
• Algorithms for \(\{K, s + 1\}\)-potent matrix constructions
• On computing of positive integer powers for \(r\)-circulant matrices
• Generalised matrix inversion and rank computation by successive matrix powering
• An accurate and efficient algorithm for the computation of the characteristic polynomial of a general square matrix

Cited in

(2)

• Algorithm for computing Kronecker basis
• New Good's type Kronecker power expansions

This page was built for publication: An algorithm computing the general entry of the nth Kronecker power of a matrix

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