An algorithm to find values of minors of skew Hadamard and conference matrices
C Kravvaritis, E Lappas, M Mitrouli - International Conference on …, 2004 - Springer
C Kravvaritis, E Lappas, M Mitrouli
International Conference on Numerical Analysis and Its Applications, 2004•SpringerWe give an algorithm to obtain formulae and values for minors of skew Hadamard and
conference matrices. One step in our algorithm allows the (n–j)×(n–j) minors of skew
Hadamard and conference matrices to be given in terms of the minors of a 2 j− 1× 2 j− 1
matrix. In particular we illustrate our algorithm by finding explicitly all the (n-3)×(n-3) minors
of such matrices.
conference matrices. One step in our algorithm allows the (n–j)×(n–j) minors of skew
Hadamard and conference matrices to be given in terms of the minors of a 2 j− 1× 2 j− 1
matrix. In particular we illustrate our algorithm by finding explicitly all the (n-3)×(n-3) minors
of such matrices.
Abstract
We give an algorithm to obtain formulae and values for minors of skew Hadamard and conference matrices. One step in our algorithm allows the (n–j) × (n–j) minors of skew Hadamard and conference matrices to be given in terms of the minors of a 2j − 1 × 2j − 1 matrix. In particular we illustrate our algorithm by finding explicitly all the (n-3) × (n-3) minors of such matrices.
Springer
Showing the best result for this search. See all results
