Sort in Vector Space  
Author Shin-Guang Chen




Abstract This paper proposes a novel method to sort vectors in vector space. A vector is an element in vector space or Euclidean vector space. A vector usually has columns (one or more) to hold quantities in the respective axes. Vectors in vector space have some kind of order between them namely monotonicity property, which can be used to sort vectors. There are many sort algorithms developed in the literature for quantities only, either by comparison or by non-comparison. However, none of them can be applied directly to vectors. In practice, many real-life problems need to search optimal solutions in vector space such as network reliability, linear programming, etc. A sorted list of vectors in the solution space may speed up such search in solving these problems. This paper presents a numerical example to explore the merits of proposed method.


Keywords sort, Euclidean vector space, network reliability, lower boundary vectors, upper boundary vectors
    Article #:  22244
Proceedings of the 22nd ISSAT International Conference on Reliability and Quality in Design
August 4-6, 2016 - Los Angeles, California, U.S.A.