A genetic algorithm for circulant Euclidean distance matrices

被引：2
|
作者：
Rivera-Gallego, W [1 ]
机构：
[1] Mississippi State Univ, NSF, Engn Res Ctr Computat Field Simulat, Mississippi State, MS 39762 USA
来源：
APPLIED MATHEMATICS AND COMPUTATION | 1998年 / 97卷 / 2-3期
关键词：
D O I：
10.1016/S0096-3003(97)10143-6
中图分类号：
O29 [应用数学];
学科分类号：
070104 ;
摘要：
This paper presents a fast genetic algorithm to determine three-dimensional configurations of points that generate circulant Euclidean Distance Matrices (EDMs). A parallel implementation is possible by using the message passing interface (MPI) standard. In addition, theoretical results about the polyhedral structure of both the cone of circulant symmetric positive semidefinite matrices and the cone of circulant EDMs are introduced. (C) 1998 Elsevier Science Inc. All rights reserved.
引用
收藏
页码：197 / 208
页数：12
相关论文
共 50 条
  • [41] An efficient algorithm for the Euclidean distance transformation
    Kato, T
    Hirata, T
    Saito, T
    Kise, K
    SYSTEMS AND COMPUTERS IN JAPAN, 1996, 27 (07) : 18 - 24
  • [42] A Fast Algorithm for Image Euclidean Distance
    Sun, Bing
    Feng, Jufu
    PROCEEDINGS OF THE 2008 CHINESE CONFERENCE ON PATTERN RECOGNITION (CCPR 2008), 2008, : 122 - 126
  • [43] A systolic algorithm for Euclidean distance transform
    Miyazawa, M
    Zeng, PF
    Iso, N
    Hirata, T
    IEEE TRANSACTIONS ON PATTERN ANALYSIS AND MACHINE INTELLIGENCE, 2006, 28 (07) : 1127 - 1134
  • [44] Parallel Euclidean distance transformation algorithm
    Katholieke Universiteit Leuven, Heverlee, Belgium
    CVIU Comput Vision Image Undersanding, 1 (15-26):
  • [45] A fast algorithm for computing the determinants of banded circulant matrices
    Chen, Xie-Bin
    APPLIED MATHEMATICS AND COMPUTATION, 2014, 229 : 201 - 207
  • [46] Euclidean Distance Between Haar Orthogonal and Gaussian Matrices
    Gonzalez-Guillen, C. E.
    Palazuelos, C.
    Villanueva, I.
    JOURNAL OF THEORETICAL PROBABILITY, 2018, 31 (01) : 93 - 118
  • [47] Characterization of multispherical and block structures of Euclidean distance matrices
    Kurata, Hiroshi
    Matsuura, Shun
    LINEAR ALGEBRA AND ITS APPLICATIONS, 2013, 439 (10) : 3177 - 3183
  • [48] Two theorems on Euclidean distance matrices and Gale transform
    Alfakih, AY
    Wolkowicz, H
    LINEAR ALGEBRA AND ITS APPLICATIONS, 2002, 340 (1-3) : 149 - 154
  • [49] On the nullspace, the rangespace and the characteristic polynomial of Euclidean distance matrices
    Alfakih, A. Y.
    LINEAR ALGEBRA AND ITS APPLICATIONS, 2006, 416 (2-3) : 348 - 354
  • [50] A Fast Algorithm for the production of Permutation Factor Circulant Matrices
    Liu, Xuetting
    Wei, Peiyu
    2009 ASIA-PACIFIC CONFERENCE ON INFORMATION PROCESSING (APCIP 2009), VOL 2, PROCEEDINGS, 2009, : 367 - +
12345