Approximate greatest common divisors of several polynomials with linearly constrained coefficients and singular polynomials

Proceedings of the International Symposium on Symbolic and Algebraic Computation, ISSAC

Volumn 2006, Issue , 2006, Pages 169-176

  Kaltofen, Erich ^a,c   Yang, Zhengfeng ^b   Zhi, Lihong ^b  

^a MASSACHUSETTS INSTITUTE OF TECHNOLOGY   (United States)

^b CHINESE ACADEMY OF SCIENCES   (China)

^c NORTH CAROLINA STATE UNIVERSITY   (United States)

Author keywords

Approximate multiple root; Approximate polynomial gcd; Linear constraint; Multivariate polynomial gcd; Singular polynomial; Symbolic numeric hybrid method

Indexed keywords

ALGORITHMS; APPROXIMATION THEORY; CONSTRAINT THEORY; LINEAR ALGEBRA; OPTIMAL SYSTEMS; PROBLEM SOLVING;

APPROXIMATE MULTIPLE ROOTS; APPROXIMATE POLYNOMIAL GCD; GREATEST COMMON DIVISOR (GCD); LINEAR CONSTRAINTS; MULTIVARIATE POLYNOMIAL GCD; STRUCTURED TOTAL LEAST NORM (STLN); SYMBOLIC/NUMERIC HYBRID METHOD;

POLYNOMIALS;

EID: 33748955518     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1145768.1145799     Document Type: Conference Paper

References (37)

1. ANDA, A. A., AND PARK, H. Fast plane with dynamic scaling. SIAM J. Matrix Anal. Applic. 15 (1994), 162-174.
2. ANDA, A. A., AND PARK, H. Self-scaling fast rotations for stiff and equality-constrained linear least squares problems. Linear Algebra and Applications 234 (1996), 137-161.
3. BECKERMANN, B., AND LABAHN, G. A fast and numerically stable Euclidean-like algorithm for detecting relative prime numerical polynomials. J. Symbolic Comput. 26 (1998), 691-714.
4. BOTTING, B., GIESBRECHT, M., AND MAY, J. Using Riemannian SVD for problems in approximate algebra. In Wang and Zhi [33], pp. 209-219.
5. CHU, M. T., FUNDERLIC, R. E., AND PLEMMONS, R. J. Structured low rank approximation. Linear Algebra and Applications 366 (2003), 157-172.
6. CORLESS, R. M., GIANNI, P. M., TRAGER, B. M., AND WATT, S. M. The singular value decomposition for polynomial systems. In Proc. 1995 Internat. Symp. Symbolic Algebraic Comput. ISSAC'95 (New York, N. Y., 1995), A. H. M. Levelt, Ed., ACM Press, pp. 96-103.
7. CORLESS, R. M., WATT, S. M., AND ZHI, L. QR factoring to compute the GCD of univariate approximate polynomials. IEEE Transactions on Signal Processing 52 (Dec. 2004), 3394-3402.
8. DUNAWAY, D. K. Calculation of zeros of a real polynomial through factorization using Euclid's algorithm. SIAM J. Numer. Anal. 11, 6 (1974), 1087-1104.
9. ECKART, C., AND YOUNG, G. The approximation of one matrix by another of lower rank. Psychometrika 1, 3 (Sept. 1936), 211-218.
10. GAO, S., KALTOFEN, E., MAY, J. P., YANG, Z., AND ZHI, L. Approximate factorization of multivariate polynomials via differential equations. In Gutierrez [12], pp. 167-174.
11. VON ZUR GATHEN, J., AND GERHARD, J. Modern Computer Algebra. Cambridge University Press, Cambridge, New York, Melbourne, 1999. Second edition 2003.
12. GUTIERREZ, J., Ed. ISSAC 2004 Proc. 2004 Internat. Symp. Symbolic Algebraic Comput. (New York, N. Y., 2004), ACM Press.
13. HITZ, M. A., AND KALTOFEN, E. Efficient algorithms for computing the nearest polynomial with constrained roots. In Proc. 1998 Internat. Symp. Symbolic Algebraic Comput. (ISSAC'98) (New York, N. Y., .1998), O. Gloor, Ed., ACM Press, pp. 236-243.
14. KAHAN, W. Numerical linear algebra. Canadian Math. Bull. 9 (1966), 757-801.
15. KALTOFEN, E., AND MAY, J. On approximate irreducibility of polynomials in several variables. In ISSAC 2003 Proc. 2003 Internat. Symp. Symbolic Algebraic Comput. (New York, N. Y., 2003), J. R. Sendra, Ed., ACM Press, pp. 161-168.
16. KALTOFEN, E., MAY, J., YANG, Z., AND ZHI, L. Approximate factorization of multivariate polynomials using singular value decomposition. Manuscript, 22 pages. Submitted, Jan. 2006.
17. KALTOFEN, E., YANG, Z., AND ZHI, L. Structured low rank approximation of a Sylvester .matrix. Manuscript, 15 pages, Oct. 2005. Preliminary version in SNC 2005 Proceedings, Dongming Wang and Lihong Zhi eds., pp. 188-201, distributed at the International Workshop on Symbolic-Numeric Computation in Xi'an, China, July 19-21, 2005.
18. KALTOFEN, E., YANG, Z., AND ZHI, L. Structured low rank approximation of a generalized Sylvester matrix. In Proc. of the Seventh Asian Symposium, on Computer Mathematics (Seoul, South Korea, 2005), S. Pae and H. Park, Eds., Korea Institute for Advanced Study, pp. 219-222. Extended abstract.
19. KALTOFEN, E., YANG, Z., AND ZHI, L. Approximate greatest common divisors of several polynomials with linearly constrained coefficients and singular polynomials. Manuscript, 16 pages, Apr. 2006.
20. KARMARKAR, N. K., AND LAKSHMAN Y. N. On approximate GCDs of univariate polynomials. J. Symbolic Comput. 26, 6 (1998), 653-666.
21. LEMMERLING, P. Structured total least squares: analysis, algorithms and applications. Dissertation, Katholieke Universiteit Leuven, Belgium, 1999.
22. LEMMERLING, P., MASTRONARDI, N., AND VAN HUFFEL, S. Fast algorithm for solving the Hankel/Toeplitz Structured Total Least Squares problem. Numerical Algorithms 23 (2000), 371-392.
23. Li, B., LIU, Z., AND ZHI, L. Fast low rank approximation of a Sylvester matrix. In Wang and Zhi [33], pp. 202-208.
24. Li, B., YANG, Z., AND ZHI, L. Fast low rank approximation of a Sylvester matrix by structured total least norm. J. JSSAC (Japan Society for Symbolic and Algebraic Computation) 11, 3,4 (2005), 165-174.
25. MASTRONARDI, N., LEMMERLING, P., AND VAN HUFFEL, S. Fast structured total least squares algorithm for solving the basic deconvolution problem. SIAM J. Matrix Anal. Applic. 22, 2 (2000), 533-553.
26. MAY, J. P. Approximate factorization of polynomials in many variables and other problems in approximate algebra via singular value decomposition methods. PhD thesis, North Carolina State Univ., Raleigh, North Carolina, Aug. 2005.
27. PARK, H., ZHANG, L., AND ROSEN, J. B. Low rank approximation of a Hankel matrix by structured total least norm. BIT 39, 4 (1999), 757-779.
28. POPE, S., AND SZANTO, A. Nearest multivariate system with given root multiplicities. Manuscript available at http://www.math.ncsu.edu/~aszanto/ papers.html, 2005.
29. RUMP, S. M. Structured perturbations part I: Normwise distances. SIAM J. Matrix Anal. Applic. 25, 1 (2003), 1-30.
30. SASASAKI, T., AND NODA, M. T. Approximate square-free decomposition and root-finding of ill-conditioned algebraic equations. J. Inf. Process. 12 (1989), 159-168.
31. SCHÖNHAGE, A. Quasi-gcd computations. Journal of Complexity 1 (1985), 118-137.
32. STEWART, G. W. Introduction to Matrix Computations. Academic Press, Inc., New York, 1973.
33. WANG, D., AND ZHI, L., Eds. Proc. 2005 International Workshop on Symbolic-Numeric (July 2005). Distributed at the Workshop in Xi'an, China.
34. ZENG, Z., AND DAYTON, B. H. The approximate GCD of inexact polynomials part II: a multivariate algorithm. In Gutierrez [12], pp. 320-327.
35. ZHI, L. Displacement structure in computing approximate GCD of univariate polynomials. In Proc. Sixth Asian Symposium on Computer Mathematics (ASCM 2003) (Singapore, 2003), Z. Li and W. Sit, Eds., vol. 10 of Lecture Notes Series on Computing, World Scientific, pp. 288-298.
36. ZHI, L., NODA, M.-T., KAI, H., AND WU, W. Hybrid method for computing the nearest singular polynomials. Japan J. Industrial and Applied Math. 21, 2 (June 2004), 149-162.
37. ZHI, L., AND WU, W. Nearest singular polynomial. J. Symbolic Comput. 26, 6 (1998), 667-675.