Abstract
Circulant partial Hadamard matrices are useful in many scientific applications, yet the existence of such matrices is not known in general. Some Hadamard matrices of given orders are found via complete enumeration in the literature, but the searches are too computationally intensive when the orders are large. This paper introduces a search method for circulant partial Hadamard matrices by using natural heuristic algorithm. Slightly deviated from the swarm intelligence based algorithm, this method successfully generates a class of circulant partial Hadamard matrices efficiently. A table of circulant partial Hadamard matrices results are given at the end of this paper.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
Chen, R.B., Hsieh, D.N., Hung, Y., Wang, W.: Optimizing Latin hypercube designs by particle swarm. Statistics and Computing 23, 663–676 (2013)
Clerc, M.: Particle Swarm Optimization. ISTE, London (2006)
Craigen, R., Faucher, G., Low, R., Wares, T.: Circulant partial Hadamard matrices. Linear Algebra and its Applications 439, 3307–3317 (2013)
Eberhart, R., Shi, Y.: Particle swarm optimization: developments, application and resources. In: IEEE Proceedings of the Congress on Evolutionary Computation, vol. 1, pp. 81–85 (2001)
Engelbrecht, A.P.: Fundamentals of Computational Swarm Intelligence. John Wiley and Sons, Chichester (2005)
Geramita, A., Seberry, J.: Quadratic forms, orthogonal designs, and Hadamard matrices. Lecture Notes in Pure and Applied Mathematics Series, vol. 45. Marcel Dekker Inc., New York (1979)
Horadam, K.J.: Hadamard matrices and their applications. Priceton University Press, Princeton (2007)
Kennedy, J., Eberhart, R.: Particle swarm optimization. In: Proceedings of IEEE International Conferenec on Neural Networks, vol. 4, pp. 1942–1948 (1995)
Low, R.M., Stamp, M., Craigen, R., Faucher, G.: Unpredictable binary strings. Congressus Numerantium 177, 65–75 (2005)
Phoa, F.K.H., Chen, R.B., Wang, W., Wong, W.K.: Optimizing two-level supersaturated designs by particle swarm techniques. Technometrics (under review)
Phoa, F.K.H., Wong, W.K., Xu, H.: The need of considering the interactions in the analysis of screening designs. Journal of Chemometrics 23, 545–553 (2009)
Phoa, F.K.H., Xu, H., Wong, W.K.: The use of nonregular fractional factorial designs in combination toxicity studies. Food and Chemical Toxicology 47, 2183–2188 (2009)
Shi, Y., Eberhart, R.: A modified particle swarm optimizer. In: Proceedings of IEEE International Conference on Evolutionary Computation, pp. 69–73 (1998)
Xu, H., Phoa, F.K.H., Wong, W.K.: Recent developments in nonregular fractional factorial designs. Statistics Survey 3, 18–46 (2009)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2014 Springer International Publishing Switzerland
About this paper
Cite this paper
Phoa, F.K.H., Lin, YL., Wang, TC. (2014). Using Swarm Intelligence to Search for Circulant Partial Hadamard Matrices. In: Tan, Y., Shi, Y., Coello, C.A.C. (eds) Advances in Swarm Intelligence. ICSI 2014. Lecture Notes in Computer Science, vol 8794. Springer, Cham. https://doi.org/10.1007/978-3-319-11857-4_18
Download citation
DOI: https://doi.org/10.1007/978-3-319-11857-4_18
Publisher Name: Springer, Cham
Print ISBN: 978-3-319-11856-7
Online ISBN: 978-3-319-11857-4
eBook Packages: Computer ScienceComputer Science (R0)