Boming Chi
Abstract
With the progress of algebraic computations on polynomials and matrices, we are paying more attention to approximate algebraic algorithms. Among approximate algebraic algorithms, those for calculating approximate greatest common divisor (GCD) consider a pair of given polynomials f and g that are relatively prime in general, and find f and g which are close to f and g, respectively, in the sense of polynomial norm, and have the GCD of certain degree. The algorithms can be classified into two categories: 1) for a given tolerance (magnitude) of ||f - f|| and ||g - g||, make the degree of approximate GCD as large as possible, and 2) for a given degree d, minimize the magnitude of ||f - f|| and ||g - g||.
- E. W. Chionh, M. Zhang, and R. N. Goldman. Fast computation of the Bezout and Dixon resultant matrices. Journal of Symbolic Computation, 33(1):13--29, 2002.Google Scholar
Digital Library
- R. M. Corless, P. M. Gianni, B. M. Trager, and S. M. Watt. The singular value decomposition for polynomial systems. In Proc. ISSAC '95, pages 195--207. ACM, 1995.Google ScholarDigital Library
- R. M. Corless, S. M. Watt, and L. Zhi. QR factoring to compute the GCD of univariate approximate polynomials. IEEE Trans. Signal Process., 52(12):3394--3402, 2004.Google ScholarDigital Library
- G. M. Diaz-Toca and L. Gonzalez-Vega. Barnett's Theorems About the Greatest Common Divisor of Several Univariate Polynomials Through Bezout-like Matrices. Journal of Symbolic Computation, 34(1):59--81, 2002.Google ScholarDigital Library
- I. Z. Emiris, A. Galligo, and H. Lombardi. Certified approximate univariate GCDs. J. Pure Appl. Algebra, 117/118:229--251, 1997.Google ScholarCross Ref
- E. Kaltofen, Z. Yang, and L. Zhi. Approximate greatest common divisors of several polynomials with linearly constrained coefficients and singular polynomials. In Proc. ISSAC '06, pages 169--176, New York, NY, USA, 2006. ACM.Google ScholarDigital Library
- E. Kaltofen, Z. Yang, and L. Zhi. Structured low rank approximation of a Sylvester matrix. In D. Wang and L. Zhi, editors, Symbolic-Numeric Computation, Trends in Mathematics, pages 69--83. Birkhãuser, 2007.Google Scholar
- J. B. Rosen. The gradient projection method for nonlinear programming. II. Nonlinear constraints. J. Soc. Indust. Appl. Math., 9:514--532, 1961.Google ScholarCross Ref
- E. Schost and P.-J. Spaenlehauer. A quadratically convergent algorithm for structured low-rank approximation. Found. Comput. Math., 16(2):457--492, 2016.Google ScholarDigital Library
- D. Sun and L. Zhi. Structured low rank approximation of a bezout matrix. Mathematics in Computer Science, 1(2):427--437, Dec 2007.Google ScholarCross Ref
- K. Tanabe. A geometric method in nonlinear programming. Journal of Optimization Theory and Applications, 30(2):181--210, Feb 1980.Google ScholarCross Ref
- A. Terui. A dataset for the GPGCD algorithm. https://github.com/atelieraterui/tcs-snc2011-data.Google Scholar
- A. Terui. An iterative method for calculating approximate GCD of univariate polynomials. In Proc. ISSAC '09, pages 351--358, New York, New York, USA, 2009. ACM Press.Google ScholarDigital Library
- A. Terui. GPGCD: An iterative method for calculating approximate GCD of univariate polynomials. Theoretical Computer Science, 479:127--149, 2013.Google ScholarDigital Library
- C. J. Zarowski, X. Ma, and F. W. Fairman. QR-factorization method for computing the greatest common divisor of polynomials with inexact coefficients. IEEE Trans. Signal Process., 48(11):3042--3051, 2000.Google ScholarDigital Library
- L. Zhi. Displacement structure in computing approximate GCD of univariate polynomials. In Computer mathematics: Proc. Six Asian Symposium on Computer Mathematics (ASCM 2003), volume 10 of Lecture Notes Ser. Comput., pages 288--298. World Sci. Publ., River Edge, NJ, 2003.Google Scholar
Index Terms
- The GPGCD algorithm with the Bézout matrix
Recommendations
The GPGCD Algorithm with the Bézout Matrix
Computer Algebra in Scientific ComputingAbstractFor a given pair of univariate polynomials with real coefficients and a given degree, we propose a modification of the GPGCD algorithm, presented in our previous research, for calculating approximate greatest common divisor (GCD). In the proposed ...
Two Variants of Bézout Subresultants for Several Univariate Polynomials
Computer Algebra in Scientific ComputingAbstractIn this paper, we develop two variants of Bézout subresultant formulas for several polynomials, i.e., hybrid Bézout subresultant polynomial and non-homogeneous Bézout subresultant polynomial. Rather than simply extending the variants of Bézout ...
GPGCD: An iterative method for calculating approximate GCD of univariate polynomials
We present an iterative algorithm for calculating approximate greatest common divisor (GCD) of univariate polynomials with the real or the complex coefficients. For a given pair of polynomials and a degree, our algorithm finds a pair of polynomials ...
Comments