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.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Geramita, A.V., Seberry, J.: Orthogonal Designs: Quadratic Forms and Hadamard Matrices. Marcel Dekker, New York (1979)
Koukouvinos, C., Lappas, E., Mitrouli, M., Seberry, J.: An algorithm to find formulae and values of minors for Hadamard matrices: II. Linear Algebra and its Applications 371, 111–124 (2003)
Koukouvinos, C., Mitrouli, M., Seberry, J.: Growth in Gaussian elimination for weighing matrices, W(n,n − 1). Linear Algebra and its Appl. 306, 189–202 (2000)
Seberry Wallis, J.: Hadamard matrices. In: Wallis, W.D., Street, A.P., Wallis, J.S. (eds.) Part IV, Combinatorics: Room Squares, Sum-Free Sets and Hadamard Matrices. Lecture Notes in Mathematics, vol. 292. Springer, Heidelberg (1972)
Sharpe, F.R.: The maximum value of a determinant. Bull. Amer. Math. Soc. 14, 121–123 (1907)
Wilkinson, J.H.: Error analysis of direct methods of matrix inversion. J. Assoc. Comput. Mach. 8, 281–330 (1961)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2005 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Kravvaritis, C., Lappas, E., Mitrouli, M. (2005). An Algorithm to Find Values of Minors of Skew Hadamard and Conference Matrices. In: Li, Z., Vulkov, L., Waśniewski, J. (eds) Numerical Analysis and Its Applications. NAA 2004. Lecture Notes in Computer Science, vol 3401. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-31852-1_45
Download citation
DOI: https://doi.org/10.1007/978-3-540-31852-1_45
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-24937-5
Online ISBN: 978-3-540-31852-1
eBook Packages: Computer ScienceComputer Science (R0)