Skip to main content
Article thumbnail
Location of Repository

Computing approximate GCD of univariate polynomials by structured total least norm

By Lihong Zhi and Zhengfeng Yang

Abstract

Abstract. The problem of approximating the greatest common divisor(GCD) for polynomials with inexact coefficients can be formulated as a low rank approximation problem with Sylvester matrix. This paper presents a method based on Structured Total Least Norm(STLN) for constructing the nearest Sylvester matrix of given lower rank. We present algorithms for computing the nearest GCD and a certified ɛ-GCD for a given tolerance ɛ. The running time of our algorithm is polynomial in the degrees of polynomials. We also show the performance of the algorithms on a set of univariate polynomials

Year: 2004
OAI identifier: oai:CiteSeerX.psu:10.1.1.135.2296
Provided by: CiteSeerX
Download PDF:
Sorry, we are unable to provide the full text but you may find it at the following location(s):
  • http://citeseerx.ist.psu.edu/v... (external link)
  • http://www.mmrc.iss.ac.cn/pub/... (external link)
  • Suggested articles


    To submit an update or takedown request for this paper, please submit an Update/Correction/Removal Request.