A new algorithm for special Vandermonde systems

In this paper a new algorithm for solving special Vandermonde systems is presented, useful when then points defining the matrix are thek th roots ofm complex numbers (n=km); if they are real and positive andn=2m, the usual case of real points symmetrically ranged around zero is obtained. The algorithm is based on an inverse matrix formulation by means of the Kronecker product and is particularly suitable for parallel implementation. Its computational complexity is analysed and compared both in the sequential and parallel formulation.