A polyalgorithm for polynomial GCD computation involving matrices

As GCD computation surfaces as a subproblem in a variety of applications, the need for some way to discriminate between algorithms according to performance becomes apparent. In this study, a polyalgorithm for polynomial GCD computation was developed. Algorithms involving Sylvester, Bezout, and Hanke...

Full description

Saved in:
Bibliographic Details
Main Author: Parrilla, Nonna J.
Format: text
Language:English
Published: Animo Repository 2014
Subjects:
Online Access:https://animorepository.dlsu.edu.ph/etd_masteral/4615
Tags: Add Tag
No Tags, Be the first to tag this record!
Institution: De La Salle University
Language: English

Similar Items