An Alternative to Euclid’s AlgorithmSource: Journal of Mechanical Design:;1979:;volume( 101 ):;issue: 004::page 582Author:G. K. Matthew
DOI: 10.1115/1.3454104Publisher: The American Society of Mechanical Engineers (ASME)
Abstract: A general method for finding factors common to two polynomials is developed. The process is shown to have immediate application to the removal of multiplicities when attempting to root polynomials. Computational procedures and likely difficulties are discussed.
keyword(s): Algorithms , Polynomials AND Project tasks ,
|
Collections
Show full item record
| contributor author | G. K. Matthew | |
| date accessioned | 2017-05-08T23:07:15Z | |
| date available | 2017-05-08T23:07:15Z | |
| date copyright | October, 1979 | |
| date issued | 1979 | |
| identifier issn | 1050-0472 | |
| identifier other | JMDEDB-27975#582_1.pdf | |
| identifier uri | http://yetl.yabesh.ir/yetl/handle/yetl/92443 | |
| description abstract | A general method for finding factors common to two polynomials is developed. The process is shown to have immediate application to the removal of multiplicities when attempting to root polynomials. Computational procedures and likely difficulties are discussed. | |
| publisher | The American Society of Mechanical Engineers (ASME) | |
| title | An Alternative to Euclid’s Algorithm | |
| type | Journal Paper | |
| journal volume | 101 | |
| journal issue | 4 | |
| journal title | Journal of Mechanical Design | |
| identifier doi | 10.1115/1.3454104 | |
| journal fristpage | 582 | |
| journal lastpage | 585 | |
| identifier eissn | 1528-9001 | |
| keywords | Algorithms | |
| keywords | Polynomials AND Project tasks | |
| tree | Journal of Mechanical Design:;1979:;volume( 101 ):;issue: 004 | |
| contenttype | Fulltext |