Fast Matrix Computation of Subresultant Polynomial Remainder Sequences

Alkiviadis G. Akritas and Gennadi I. Malaschonok
Additional contact information
Alkiviadis G. Akritas: University of Thessaly
Gennadi I. Malaschonok: Tambov University

A chapter in Computer Algebra in Scientific Computing, 2000, pp 1-11 from Springer

Abstract: Abstract We present an improved (faster) variant of the matrix-triangularization subresultant prs method for the computation of a greatest common divisor of two polynomials A and B (of degrees dA and dB, respectively) along with their polynomial remainder sequence [1]. The computing time of our fast method is 0(n2+ßlog ∥C∥2), for standard arithmetic and 0(((n1+ß+n 3 log ∥C∥)(log n+ log ∥C∥)2) for the Chinese remainder method, where n = d A + d B, ∥C∥ is the maximal coefficient of the two polynomials and the best known ß

Keywords: Integral Domain; Diagonal Form; Great Common Divisor; Recursive Method; Maximal Coefficient (search for similar items in EconPapers)
Date: 2000
References: Add references at CitEc
Citations:

There are no downloads for this item, see the EconPapers FAQ for hints about obtaining it.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:spr:sprchp:978-3-642-57201-2_1

Ordering information: This item can be ordered from
http://www.springer.com/9783642572012

DOI: 10.1007/978-3-642-57201-2_1

Access Statistics for this chapter

More chapters in Springer Books from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().