COMPUTER-GENERATION OF HADAMARD-MATRICES

被引:7
作者
BALASUBRAMANIAN, K
机构
[1] Department of Chemistry, Arizona State University, Tempe, Arizona
关键词
D O I
10.1002/jcc.540140513
中图分类号
O6 [化学];
学科分类号
0703 ;
摘要
We develop a computer code that uses elegant bit-manipulation techniques for matrix multiplication and thus facilitates exhaustive generation of Skew-Hadamard matrices. Hadamard matrices are useful in spectroscopic applications (Hadamard transform spectroscopy) and in balanced chemical designs. Application of our code yields several Skew-Hadamard matrices up to order 100 x 100, although the combinatorial complexity of exhaustive generation increases exponentially. Our bit-manipulation-based codes took 124 h of CPU time to perform 7.79344 x 10(11) matrix multiplications on an IBM RS 6000/560 system to generate all 100 x 100 matrices. This amounts to 5.7 x 10(-7) S of CpU time per matrix multiplication.
引用
收藏
页码:603 / 619
页数:17
相关论文
共 35 条
[1]  
AGAIAN SS, 1985, LECTURE NOTES MATH, V1168
[2]  
[Anonymous], 1963, CARUS MATH MONOGRAPH
[4]   SPECTRAL MOMENTS AND WALKS FOR LARGE CARBON CAGE CLUSTERS [J].
BALASUBRAMANIAN, K .
CHEMICAL PHYSICS LETTERS, 1990, 175 (03) :273-278
[5]   APPLICATIONS OF COMBINATORICS AND GRAPH-THEORY TO SPECTROSCOPY AND QUANTUM-CHEMISTRY [J].
BALASUBRAMANIAN, K .
CHEMICAL REVIEWS, 1985, 85 (06) :599-618
[6]   COMPUTER-GENERATION OF THE CHARACTERISTIC-POLYNOMIALS OF CHEMICAL GRAPHS [J].
BALASUBRAMANIAN, K .
JOURNAL OF COMPUTATIONAL CHEMISTRY, 1984, 5 (04) :387-394
[7]   THE USE OF FRAMES METHOD FOR THE CHARACTERISTIC-POLYNOMIALS OF CHEMICAL GRAPHS [J].
BALASUBRAMANIAN, K .
THEORETICA CHIMICA ACTA, 1984, 65 (01) :49-58
[8]  
BALASUBRAMANIAN K, IN PRESS MOL PHYS
[9]  
Balasubramanian K., 1986, MATH COMPUTATIONAL C, P20
[10]  
BALASUBRAMANIAN K, 1983, CHEM APPLICATIONS TO