×
Seroussi, Gadiel; Ma, Fai

On the arithmetic complexity of matrix Kronecker powers. (English) Zbl 0526.68043

Inf. Process. Lett. 17, 145-148 (1983).
Page: −5 −4 −3 −2 −1 ±0 +1 +2 +3 +4 +5 Show Scanned Page
scan of Zbl 0526.68043

Cited in 1 Document

MSC:

68Q25 Analysis of algorithms and problem complexity
65F30 Other matrix algorithms (MSC2010)

Keywords:

arithmetic complexity; Kronecker power; matrix multiplication; algebraic computational complexity
Cite Review PDF
Full Text: DOI

References:

[1] Bellman, R., Introduction to Matrix Analysis (1960), McGraw-Hill: McGraw-Hill New York · Zbl 0124.01001
[2] Bellman, R.; Soong, T. T.; Vasudevan, R., On moment behavior of a class of stochastic difference equations, J. Math. Anal. Appl., 40, 286-299 (1972) · Zbl 0244.60051
[3] Paraskevpoulos, P. N.; King, R. E., A. Kronecker product approach to pole assignment by output feedback, Internat. J. Control, 24, 3, 325-334 (1976)
[4] Ma, F.; Caughey, T. K., On the stability of linear and nonlinear stochastic transformations, Internat. J. Control, 34, 3, 501-511 (1981) · Zbl 0473.93073
[5] Bellman, R., Limit theorems for non-commutative operations. Part I, Duke Math. J., 21, 491-500 (1954) · Zbl 0057.11202
[6] Brockett, R. W.; Dobkin, D., On the number of multiplications required for matrix multiplication, SIAM J. Comput., 5, 624-628 (1976) · Zbl 0345.65011
[7] Coppersmith, D., Rapid multiplication of rectangular matrices, SIAM J. Comput., 11, 467-471 (1982) · Zbl 0486.68031
[8] D. Coppersmith, Personal communication.; D. Coppersmith, Personal communication.
[9] Winograd, S., Arithmetic complexity of computations, (CBMS-NSF Regional Conf. Series Appl. Math., 33 (1980), SIAM: SIAM Philadelphia, PA) · Zbl 0528.68026
This reference list is based on information provided by the publisher or from digital mathematics libraries. Its items are heuristically matched to zbMATH identifiers and may contain data conversion errors. In some cases that data have been complemented/enhanced by data from zbMATH Open. This attempts to reflect the references listed in the original paper as accurately as possible without claiming completeness or a perfect matching.