In this paper, we give the comments on the article ‘Inversion of a Generalized Vandermonde Matrix’ by M.E.A. El Mikkawy, Int. J. Computer Math. 80 (2003), pp. 759–765. The article gives an algorithm for the elementary symmetric function's calculation which contains a severe error. In these comments, we have proposed necessary corrections of that algorithm. [ABSTRACT FROM PUBLISHER]
Detection of copositivity plays an important role in combinatorial and quadratic optimization. Recently, an algorithm for copositivity detection by simplicial partition has been proposed. In this paper, we develop an improved depth-first simplicial partition algorithm which reduces memory requirements significantly and therefore enables copositivity checks of much larger matrices - of size up to a few thousands instead of a few hundreds. The algorithm has been investigated experimentally on a number of MaxClique problems as well as on generated random problems. We present numerical results showing that the algorithm is much faster than a recently published linear algebraic algorithm for copositivity detection based on traditional ideas - checking properties of principal sub-matrices. We also show that the algorithm works very well for solving MaxClique problems through copositivity checks. [ABSTRACT FROM AUTHOR]
This paper introduces the concept of a Quasi-Birth-and-Death process (QBD) with Rational Arrival Process (RAP) components. We use the physical interpretation of the prediction process of the RAP, developed by Asmussen and Bladt, and develop an analysis that parallels the analysis of a traditional QBD. Further, we present an algorithm for the numerical evaluation of the matrix G. As an example, we consider two queues where the arrival process and the sequence of service times are taken from two dependent RAPs, that are not Markovian Arrival Processes. [ABSTRACT FROM AUTHOR]