FAST SOLUTION OF LINEAR-SYSTEMS WITH POLYNOMIAL COEFFICIENTS OVER THE RING OF INTEGERS

被引：1

作者：

LOTTI, G

机构：

[1] Dipartimento di Matematica, Universitá di Trento

来源：

JOURNAL OF ALGORITHMS | 1992年 / 13卷 / 04期

关键词：

D O I：

10.1016/0196-6774(92)90056-I

中图分类号：

TP301 [理论、方法];

学科分类号：

081202 ;

摘要：

An algorithm is shown for computing both the solution, in unreduced rational form, of a linear system with polynomial entries whose coefficients are from the ring of integers, and the leading terms of its Taylor-Laurent series expansion at z = 0. This algorithm outperforms, in some cases, the previously known algorithms in terms of number of Boolean operations and it is based on the scalar polynomial division algorithm proposed by Bini and Pan. © 1992.

引用

页码：564 / 576

页数：13

共 7 条

[1]

Aho A. V., 1975, SIAM Journal on Computing, V4, P533, DOI 10.1137/0204045

[2]

Bini D., 1986, Journal of Complexity, V2, P179, DOI 10.1016/0885-064X(86)90001-4

[3] SYSTEMS OF LINEAR-EQUATIONS WITH DENSE UNIVARIATE POLYNOMIAL COEFFICIENTS [J].

CABAY, S ;

DOMZY, B .

JOURNAL OF THE ACM, 1987, 34 (03) :646-660

[4]

Csanky L., 1976, SIAM Journal on Computing, V5, P618, DOI 10.1137/0205040

[5]

Knuth D.E., 1981, ART COMPUTER PROGRAM, V2

[6] EXACT SOLUTION OF SYSTEMS OF LINEAR EQUATIONS WITH POLYNOMIAL COEFFICIENTS [J].

MCCLELLAN, MT .

JOURNAL OF THE ACM, 1973, 20 (04) :563-588

[7]

Moenck R. T., 1979, Symbolic and algebraic computation, P65

← 1 →