Computing the Numerical Nullity of Sylvester Matrix of Univariate Polynomials
碩士 === 國立中山大學 === 應用數學系研究所 === 103 === Computing the greatest common divisor (GCD) of univariate polynomials is one of the fundamental algebraic problems with a long history. The classical Euclidean algorithm is not suitable for practical numerical computation because computing GCD is an ill-posed p...
| Main Authors: | , |
|---|---|
| Other Authors: | |
| Format: | Others |
| Language: | en_US |
| Published: |
2014
|
| Online Access: | http://ndltd.ncl.edu.tw/handle/28922594897287071233 |