Polynomial and Matrix Computations Volume 1: Fundamental Algorithms (Dario Bini and Victor Pan)
Polynomial and Matrix Computations Volume 1: Fundamental Algorithms (Dario Bini and Victor Pan)
复制标题
多项式和矩阵计算第 1 卷：基本算法（Dario Bini 和 Victor Pan）
DOI：
10.1137/1038020
复制
发表时间：
1996
期刊：
影响因子：
--
通讯作者：
W. Eberly
中科院分区：
文献类型：
--
作者：
W. Eberly
这是第一次在一个计划的一系列卷渐近有效的符号算法多项式和矩阵计算。”基本”问题的算法在第一卷的四章中提出。前两章关注的是顺序符号计算（在一个基环或域上使用精确算术，并返回问题的精确解）。第一章考虑多项式计算，包括多项式求值、乘法和除法;多项式和有理插值以及Padb逼近;中国余数计算;线性递归的最小跨度计算;以及最大公约数的计算
This is the first in a planned series of volumes on asymptotically efficient symbolic algorithms for polynomial and matrix computations. Algo-rithms for" fundamental" problems are presented in the four chapters comprising Volume 1. The first two chapters are concerned with sequential symbolic computations (using exact arithmetic over a ground ring or fieldand returning exact solutions for problems). Chapter considers poly-nomial computations, including polynomial evaluation, multiplication, and division; polynomial and rational interpolation and Padb approximation; Chinese remainder computations; compu-tation of minimum spans of linear recurrences; and the computation of greatest common divisors