Journal of Algorithms and Optimizationhttp://www.academicpub.org/jao/RSS.aspxen-USAccurate Positions of Branch Points of Minimum Magnitudes and Their Associated Spheroidal Eigenvalues2016-12-31<p class="abstract">Accurate Positions of Branch Points of Minimum Magnitudes and Their Associated Spheroidal Eigenvalues</p><ul><li>Pages 1-13</li><li>Author Tam Do-Nhat</li><li>Abstract The Newton- Raphson method with two complex variable is utilized to compute the branch points with minimum magnitudes and their associated eigenvalues in the first quadrant of the complex plane with the parameter c =kF, where k is a complex wave number, and F is the semifocal length of the spheroidal system. The efficient numerical method which is applied to the spheroidal eigenvalue equation and the equation of its partial derivative with respect to the eigenvalue, is used to simultaneously solve the two complex variables, the branch point and its associated eigenvalue with a high precision, from which they can be tabulated for references.</li></ul>http://www.academicpub.org/PaperInfo.aspx?PaperID=17036Journal of Algorithms and Optimizationhttp://www.academicpub.org/PaperInfo.aspx?PaperID=17036Development and Application of the DIRECT Algorithm for Leak Detection in Water Distribution Systems2016-12-31<p class="abstract">Development and Application of the DIRECT Algorithm for Leak Detection in Water Distribution Systems</p><ul><li>Pages 14-31</li><li>Author M. N. Jasper,E. D. Brill,R. Ranjithan,G. Mahinthakumar</li><li>Abstract The Dividing Rectangles (DIRECT) search is a deterministic, derivative-free, global search algorithm. The algorithm searches for the global minimum by recursive space partitioning, essentially grouping similar regions within the decision space and selecting a sample from each group. The DIRECT algorithm was initially designed for continuous problems, but has since been modified to allow for integer variable types. Though DIRECT has been previously used for discrete numbers, the algorithm has not been extended to other discrete variable types, such as graph nodes or multi-dimensional points. This research further extends the DIRECT algorithm to use a mix of continuous and discrete variables, including connected graph nodes. In this paper, the algorithm is applied to leak detection problems in water distribution systems (WDSs), which involve both discrete network nodes and continuous leak magnitudes. In addition, the DIRECT algorithm is parallelized using a master-worker paradigm and tested using cluster resources for a moderate number of processors. The generalization and abstraction of the DIRECT algorithm presented in this research will enable the application of DIRECT to a wider class of problems than previously possible.</li></ul>http://www.academicpub.org/PaperInfo.aspx?PaperID=17321Journal of Algorithms and Optimizationhttp://www.academicpub.org/PaperInfo.aspx?PaperID=17321