LINEAR RECURRING SEQUENCES FOR COMPUTING THE RESULTANT OF MULTIVARIATE POLYNOMIALS

被引：2

作者：

LLOVET, J

MARTINEZ, R

JAEN, JA

机构：

[1] UNIV ALCALA DE HENARES, DEPT MATH, MADRID, SPAIN

[2] UNIV POLITECN MADRID, DEPT CONTROL ELECTR & COMP ENGN, MADRID, SPAIN

来源：

JOURNAL OF COMPUTATIONAL AND APPLIED MATHEMATICS | 1993年 / 49卷 / 1-3期

关键词：

COMPUTER ALGEBRA; LINEAR RECURRING SEQUENCES; POLYNOMIAL RESULTANT ALGORITHM; MAPLE;

D O I：

10.1016/0377-0427(93)90145-2

中图分类号：

O29 [应用数学];

学科分类号：

070104 ;

摘要：

The effective computation of resultants of multivariate polynomials plays a major role in symbolic computation. Modular methods provide efficient approaches, of which Collins' algorithm is one of the best known. This paper presents an implementation of an algorithm based on linear recurring sequences for computing the resultant of two polynomials over a unique factorization domain. This method computes the resultant by means of a recursive function over a finite sequence with 2n - 1 elements, where n is the maximum degree of the given polynomials. Computing-time analysis shows that the modular version of this approach and Collins' algorithm for computing resultants have the same complexity. The implementation of this algorithm is given in Maple.

引用

页码：145 / 152

页数：8