Abstract
We present an extension of our GPGCD method, an iterative method for calculating approximate greatest common divisor (GCD) of univariate polynomials, to multiple polynomial inputs. For a given pair of polynomials and a degree, our algorithm finds a pair of polynomials which has a GCD of the given degree and whose coefficients are perturbed from those in the original inputs, making the perturbations as small as possible, along with the GCD. In our GPGCD method, the problem of approximate GCD is transferred to a constrained minimization problem, then solved with the so-called modified Newton method, which is a generalization of the gradient-projection method, by searching the solution iteratively. In this paper, we extend our method to accept more than two polynomials with the real coefficients as an input.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Beckermann, B., Labahn, G.: A fast and numerically stable Euclidean-like algorithm for detecting relatively prime numerical polynomials. J. Symbolic Comput. 26(6), 691–714 (1998), Symbolic numeric algebra for polynomials
Sasaki, T., Noda, M.T.: Approximate square-free decomposition and root-finding of ill-conditioned algebraic equations. J. Inform. Process. 12(2), 159–168 (1989)
Schönhage, A.: Quasi-gcd computations. J. Complexity 1(1), 118–137 (1985)
Corless, R.M., Gianni, P.M., Trager, B.M., Watt, S.M.: The singular value decomposition for polynomial systems. In: Proceedings of the 1995 International Symposium on Symbolic and Algebraic Computation, pp. 195–207. ACM, New York (1995)
Emiris, I.Z., Galligo, A., Lombardi, H.: Certified approximate univariate GCDs. J. Pure Appl. Algebra 117/118, 229–251 (1997), Algorithms for algebra (Eindhoven, 1996)
Corless, R.M., Watt, S.M., Zhi, L.: QR factoring to compute the GCD of univariate approximate polynomials. IEEE Trans. Signal Process. 52(12), 3394–3402 (2004)
Zarowski, C.J., Ma, X., Fairman, F.W.: QR-factorization method for computing the greatest common divisor of polynomials with inexact coefficients. IEEE Trans. Signal Process. 48(11), 3042–3051 (2000)
Zhi, L.: Displacement structure in computing approximate GCD of univariate polynomials. In: Computer mathematics: Proc. Six Asian Symposium on Computer Mathematics (ASCM 2003), River Edge, NJ. Lecture Notes Ser. Comput., vol. 10, pp. 288–298. World Sci. Publ. (2003)
Pan, V.Y.: Computation of approximate polynomial GCDs and an extension. Inform. and Comput. 167(2), 71–85 (2001)
Chin, P., Corless, R.M., Corliss, G.F.: Optimization strategies for the approximate GCD problem. In: Proceedings of the 1998 International Symposium on Symbolic and Algebraic Computation, pp. 228–235. ACM, New York (1998) (electronic)
Kaltofen, E., Yang, Z., Zhi, L.: Approximate greatest common divisors of several polynomials with linearly constrained coefficients and singular polynomials. In: Proceedings of the 2006 International Symposium on Symbolic and Algebraic Computation, pp. 169–176. ACM, New York (2006)
Kaltofen, E., Yang, Z., Zhi, L.: Structured low rank approximation of a Sylvester matrix. In: Wang, D., Zhi, L. (eds.) Symbolic-Numeric Computation. Trends in Mathematics, pp. 69–83. Birkhäuser, Basel (2007)
Karmarkar, N.K., Lakshman, Y.N.: On approximate GCDs of univariate polynomials. J. Symbolic Comput. 26(6), 653–666 (1998), Symbolic numeric algebra for polynomials
Zeng, Z.: The approximate GCD of inexact polynomials, Part I: a univariate algorithm (extended abstract), 8 p. (2004) (preprint)
Ohsako, N., Sugiura, H., Torii, T.: A stable extended algorithm for generating polynomial remainder sequence. Trans. Japan Soc. Indus. Appl. Math. 7(3), 227–255 (1997) (in Japanese)
Sanuki, M., Sasaki, T.: Computing approximate GCDs in ill-conditioned cases. In: SNC 2007: Proceedings of the 2007 International Workshop on Symbolic-Numeric Computation, pp. 170–179. ACM, New York (2007)
Terui, A.: An iterative method for calculating approximate GCD of univariate polynomials. In: Proceedings of the 2009 International Symposium on Symbolic and Algebraic Computation, pp. 351–358. ACM Press, New York (2009)
Tanabe, K.: A geometric method in nonlinear programming. J. Optim. Theory Appl. 30(2), 181–210 (1980)
Rosen, J.B.: The gradient projection method for nonlinear programming. II. Nonlinear constraints. J. Soc. Indust. Appl. Math. 9, 514–532 (1961)
Rupprecht, D.: An algorithm for computing certified approximate GCD of n univariate polynomials. J. Pure Appl. Algebra 139, 255–284 (1999)
Terui, A.: GPGCD, an iterative method for calculating approximate GCD of univariate polynomials, with the complex coefficients. In: Proceedings of the Joint Conference of ASCM 2009 and MACIS 2009. COE Lecture Note., Faculty of Mathematics, vol. 22, pp. 212–221. Kyushu University (December 2009)
Demmel, J.W.: Applied numerical linear algebra. Society for Industrial and Applied Mathematics (SIAM), Philadelphia (1997)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2010 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Terui, A. (2010). GPGCD, an Iterative Method for Calculating Approximate GCD, for Multiple Univariate Polynomials. In: Gerdt, V.P., Koepf, W., Mayr, E.W., Vorozhtsov, E.V. (eds) Computer Algebra in Scientific Computing. CASC 2010. Lecture Notes in Computer Science, vol 6244. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-15274-0_22
Download citation
DOI: https://doi.org/10.1007/978-3-642-15274-0_22
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-15273-3
Online ISBN: 978-3-642-15274-0
eBook Packages: Computer ScienceComputer Science (R0)