广义Vandermonde方程组的有效快速算法

An Efficient and Fast Algorithm for Solving Generalized Vandermonde Systems

基于求解Vandermonde方程组的Bjorck-Pereyra算法,本文给出了求解广义Vandermonde方程组的有效快速算法,所需的计算量为O(n2)。数值算例表明,与求解Vandermonde方程组的Gohberg-Kailath-Koltracht算法和Gauss消元法相比,本文的算法具有更高的计算精度。

In this paper, an efficient and fast algorithm for solving generalized Vandermonde systems is obtained on basis of the Bjorck-Pereyra algorithm for solving Vandermonde systems. The algorithm costs O（n^2） arithmetic operations. Numerical results show that the algorithm is higher in precision than the Gauss elimination and Gohberg-Kailath-Koltracht algorithm when solving Vandermonde-type systems.