Algorithms for confluent Vandermonde systems

Two compact algorithms are developed for solving systems of linear equationsV x=b andV ^T a=f, whereV=V( ₀, ₁, ..., _n ) is a confluent Vandermonde matrix of Hermite type. The solution is obtained by one forward and one backward vector recursion, starting with the right hand side. The total amount of storage is only 2n. The number of arithmetic operations needed isO(n ²) and compares favourably with other proposed methods.