English
 
Help Privacy Policy Disclaimer
  Advanced SearchBrowse

Item

ITEM ACTIONSEXPORT
  Division-free Computation of Subresultants Using Bezout Matrices

Kerber, M. (2009). Division-free Computation of Subresultants Using Bezout Matrices. International Journal of Computer Mathematics, 86(12), 2186-2200.

Item is

Files

show Files

Locators

show

Creators

show
hide
 Creators:
Kerber, Michael1, Author           
Affiliations:
1Algorithms and Complexity, MPI for Informatics, Max Planck Society, ou_24019              

Content

show
hide
Free keywords: -
 Abstract: We present an algorithm to compute the subresultant sequence of two polynomials that completely avoids division in the ground domain, generalizing an algorithm \revised{given by} Abdeljaoued et al.\ (see Abdeljaoed et al.: Minors of Bezout Matrices\ldots, Int.\ J.\ of Comp.\ Math.\ 81, 2004). We evaluate determinants of slightly manipulated Bezout matrices using the algorithm of Berkowitz. Although the algorithm gives worse complexity bounds than pseudo-division approaches, our experiments show that our approach is superior for input polynomials with moderate degrees if the ground domain contains indeterminates.

Details

show
hide
Language(s): eng - English
 Dates: 2010-01-052009
 Publication Status: Issued
 Pages: -
 Publishing info: -
 Table of Contents: -
 Rev. Type: Peer
 Identifiers: eDoc: 518281
Other: Local-ID: C1256428004B93B8-69A41BAA4FC3517DC12576A20033513A-kerber-ijcm-2009
 Degree: -

Event

show

Legal Case

show

Project information

show

Source 1

show
hide
Title: International Journal of Computer Mathematics
  Other : Int. J. Comput. Math.
Source Genre: Journal
 Creator(s):
Affiliations:
Publ. Info: London : Gordon and Breach Science Publishers
Pages: - Volume / Issue: 86 (12) Sequence Number: - Start / End Page: 2186 - 2200 Identifier: ISSN: 0020-7160
CoNE: https://pure.mpg.de/cone/journals/resource/954925407731