A New Method for Computing Polynomial Greatest Common Divisors and Polynomial Remainder Sequences.

Alkiviadis G. Akritas

Numerische Mathematik (1987/88)

  • Volume: 52, Issue: 2, page 119-128
  • ISSN: 0029-599X; 0945-3245/e

How to cite

top

Akritas, Alkiviadis G.. "A New Method for Computing Polynomial Greatest Common Divisors and Polynomial Remainder Sequences.." Numerische Mathematik 52.2 (1987/88): 119-128. <http://eudml.org/doc/133228>.

@article{Akritas1987/88,
author = {Akritas, Alkiviadis G.},
journal = {Numerische Mathematik},
keywords = {polynomial remainder sequence; polynomial greatest common divisor; Bareiss's integer-preserving Gaussian elimination algorithm; bubble-pivot},
number = {2},
pages = {119-128},
title = {A New Method for Computing Polynomial Greatest Common Divisors and Polynomial Remainder Sequences.},
url = {http://eudml.org/doc/133228},
volume = {52},
year = {1987/88},
}

TY - JOUR
AU - Akritas, Alkiviadis G.
TI - A New Method for Computing Polynomial Greatest Common Divisors and Polynomial Remainder Sequences.
JO - Numerische Mathematik
PY - 1987/88
VL - 52
IS - 2
SP - 119
EP - 128
KW - polynomial remainder sequence; polynomial greatest common divisor; Bareiss's integer-preserving Gaussian elimination algorithm; bubble-pivot
UR - http://eudml.org/doc/133228
ER -

NotesEmbed ?

top

You must be logged in to post comments.

To embed these notes on your page include the following JavaScript code on your page where you want the notes to appear.

Only the controls for the widget will be shown in your chosen language. Notes will be shown in their authored language.

Tells the widget how many notes to show per page. You can cycle through additional notes using the next and previous controls.

    
                

                
Note: Best practice suggests putting the JavaScript code just before the closing </body> tag.