EFFICIENTLY RAISING MATRICES TO AN INTEGER POWER

被引：0

作者：

DUVANENKO, VJ ^{[1
]}

机构：

[1] TRUE VISION,INDIANAPOLIS,IN 46256

来源：

DR DOBBS JOURNAL | 1991年 / 16卷 / 06期

关键词：

D O I：

暂无

中图分类号：

TP31 [计算机软件];

学科分类号：

081202 ; 0835 ;

摘要：

引用

页码：86 / &

共 50 条

[31] Quantum power iteration to efficiently obtain the dominant eigenvector from diagonalizable nonnegative matrices
Brian C. Britt
Quantum Information Processing, 23
[32] Quantum power iteration to efficiently obtain the dominant eigenvector from diagonalizable nonnegative matrices
Britt, Brian C.
QUANTUM INFORMATION PROCESSING, 2024, 23 (02)
[33] EFFICIENTLY COMPUTING WITH DESIGN STRUCTURE MATRICES
Hossain, Shahadat
MANAGING COMPLEXITY BY MODELLING DEPENDENCIES, 2010, : 345 - 350
[34] Integer weighted finite automata, matrices, and formal power series over Laurent polynomials
Halava, Vesa
Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 2004, 3113 : 81 - 88
[35] Divisibility among determinants of power matrices associated with integer-valued arithmetic functions
Chen, Long
Hong, Shaofang
AIMS MATHEMATICS, 2020, 5 (03): : 1946 - 1959
[36] Combinatorial properties of integer matrices and integer matrices mod k (vol 66, pg 1380, 2017)
Brualdi, Richard A.
Meyer, Seth A.
LINEAR & MULTILINEAR ALGEBRA, 2019, 67 (03): : 647 - 648
[37] On generator matrices and parity check matrices of generalized integer codes
Matsui, Hajime
DESIGNS CODES AND CRYPTOGRAPHY, 2015, 74 (03) : 681 - 701
[38] On generator matrices and parity check matrices of generalized integer codes
Hajime Matsui
Designs, Codes and Cryptography, 2015, 74 : 681 - 701
[39] Computing rational forms of integer matrices
Giesbrecht, M
Storjohann, A
JOURNAL OF SYMBOLIC COMPUTATION, 2002, 34 (03) : 157 - 172
[40] Fillmore's theorem for integer matrices
Borobia, Alberto
LINEAR ALGEBRA AND ITS APPLICATIONS, 2017, 531 : 281 - 284

← 1 2 3 4 5 →