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

An Efficient and Fast Algorithm for Solving Generalized Vandermonde Systems

作　　者：赵良东[1] 徐仲[1] 陆全[1] 

机构地区：[1]西北工业大学应用数学系,西安710072

出　　处：《工程数学学报》2010年第1期99-104,共6页Chinese Journal of Engineering Mathematics

基　　金：国家自然科学基金(10802068);陕西省自然科学基金(2006A05)~~

摘　　要：基于求解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.

关 键 词：VANDERMONDE矩阵 广义VANDERMONDE矩阵 线性方程组 快速算法 

分 类 号：O241.6[理学—计算数学]