On the arithmetic operational complexity for solving Vandermonde linear equations

被引：10
|
作者：
Li, L [1 ]
机构：
[1] Yamaguchi Univ, Fac Sci, Yamaguchi 7538512, Japan
来源：
JAPAN JOURNAL OF INDUSTRIAL AND APPLIED MATHEMATICS | 2000年 / 17卷 / 01期
关键词：
complexity; Vandermonde; linear systems;
D O I：
10.1007/BF03167332
中图分类号：
O29 [应用数学];
学科分类号：
070104 ;
摘要：
In [1], A. Bjorck and V. Pereyra have showed an O(n(2)) fast algorithm for solving an n-order Vandermonde linear system of equations. In this paper, we will present a new fast algorithm. The arithmetic operational complexity of this algorithm will be not more than O(n log(2)(2) n).
引用
收藏
页码：15 / 18
页数：4
相关论文
共 50 条
12345