Further numerical aspects of the ERES algorithm for the computation of the greatest common divisor of polynomials and comparison with other existing methodologies

 
see the original item page
in the repository's web site and access all digital files if the item*
share




1996 (EN)
Further numerical aspects of the ERES algorithm for the computation of the greatest common divisor of polynomials and comparison with other existing methodologies (EN)

Mitrouli, M (EN)
Karcanias, N (EN)
Koukouvinos, C (EN)

N/A (EN)

This paper presents the implementation of the ERES numerical method for the computation of the greatest common divisor (GCD) of several polynomials. The ERES algorithm performs row transformations and shifting on a matrix, formed directly from the coefficients of the given polynomials and determines a vector containing the coefficients of the required GCD. A detailed description of the implementation of the algorithm is presented and analytical proofs of its stability are also developed. A comparison of ERES with other iterative matrix-based methods is performed and various numerical results are described. (EN)

journalArticle

Εθνικό Μετσόβιο Πολυτεχνείο (EL)
National Technical University of Athens (EN)

Utilitas Mathematica (EN)

English

1996


UTIL MATH PUBL INC (EN)



*Institutions are responsible for keeping their URLs functional (digital file, item page in repository site)