Abstract
The problem considered here is an integral part of computations for algebraic control problems. The paper introduces the notion of normal factorization of polynomials and then presents a new hybrid algorithm for the computation of this factorization. The advantage of such a factorization is that it handles the determination of multiplicities and produces factors of lower degree and with distinct roots. The presented algorithm has the ability to specify the roots of the polynomials without computing them explicitly. Also it may be used for investigating the clustering of the roots of the polynomials. The developed procedure is based on the use of algorithms determining the greatest common divisor of polynomials. The algorithm can be implemented symbolically for the specification of well separated roots and numerically for the specification of roots belonging in approximate clusters.
Chapter PDF
Similar content being viewed by others
References
Karcanias, N., Giannakopoulos, C., Hubbard, M.: Almost zeros of a set of polynomials of R[s]. Int. J. Control 38, 1213–1238 (1983)
Karcanias, N., Mitrouli, M.: A Matrix Pencil Based Numerical Method for the Computation of the GCD of Polynomials. IEEE Trans. Autom. Cont. 39, 977–981 (1994)
Karcanias, N., Mitrouli, M.: Normal Factorization of Polynomials and Computational Issues. Computers and Mathematics with Applications 45, 229–245 (2003)
Karcanias, N., Mitrouli, M., Fatouros, S., Halikias, G.: Approximate Greatest Common Divisor of many polynomials and generalised resultants. Computers and Mathematics with Applications (2006) (to appear)
Karcanias, N., Mitrouli, M., Fatouros, S.: A resultant based computation of the Greatest Common Divisor of two polynomials. In: Proc. of 11th IEEE Med. Conf on Control and Automation, Rodos Palace Hotel, Rhodes, Greece (2003b)
Mitrouli, M., Karcanias, N.: Computation of the GCD of polynomials using Gaussian transformation and shifting. Int. Journ. Control 58, 211–228 (1993)
Noda, M., Sasaki, T.: Approximate GCD and its applications to ill-conditioned algebraic equations. Jour. of Comp. and Appl. Math. 38, 335–351 (1991)
Pace, I., Barnett, S.: Comparison of algorithms for calculation of GCD of polynomials. Int. Journ. System Scien. 4, 211–226 (1973)
Triantafyllou, D., Mitrouli, M.: Two resultant based methods computing the greatest common divisor of two polynomials. In: Li, Z., Vulkov, L.G., Waśniewski, J. (eds.) NAA 2004. LNCS, vol. 3401, pp. 519–526. Springer, Heidelberg (2005)
Turnbull, H.W., Aitken, A.C.: An Introduction to the Theory of Canonical Matrices. Dover Publ., New York (1961)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2006 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Karcanias, N., Mitrouli, M., Triantafyllou, D. (2006). A Hybrid Approach for Normal Factorization of Polynomials. In: Alexandrov, V.N., van Albada, G.D., Sloot, P.M.A., Dongarra, J. (eds) Computational Science – ICCS 2006. ICCS 2006. Lecture Notes in Computer Science, vol 3992. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11758525_54
Download citation
DOI: https://doi.org/10.1007/11758525_54
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-34381-3
Online ISBN: 978-3-540-34382-0
eBook Packages: Computer ScienceComputer Science (R0)