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...
Saved in:
| 主要作者: | |
|---|---|
| 格式: | text |
| 語言: | English |
| 出版: |
Animo Repository
2014
|
| 主題: | |
| 在線閱讀: | https://animorepository.dlsu.edu.ph/etd_masteral/4615 |
| 標簽: |
添加標簽
沒有標簽, 成為第一個標記此記錄!
|