论文信息 - Computing the nearest singular univariate polynomials with given root multiplicities

Computing the nearest singular univariate polynomials with given root multiplicities

In this paper, we derive explicit expressions for the nearest singular polynomials with given root multiplicities and its distance to the given polynomial. These expressions can be computed recursively. These results extend previous results of Zhi et al. (2004) [10] and Zhi and Wu (1998) [11].

Lihong Zhi | Zijia Li

[1] Erich Kaltofen,et al. Efficient algorithms for computing the nearest polynomial with a real root and related problems , 1999, ISSAC '99.

[2] Hans J. Stetter,et al. The nearest polynomial with a given zero, and similar problems , 1999, SIGS.

[3] Erich Kaltofen,et al. Efficient algorithms for computing the nearest polynomial with constrained roots , 1998, ISSAC '98.

[4] Lihong Zhi,et al. Nearest Singular Polynomials , 1998, J. Symb. Comput..

[5] Ágnes Szántó,et al. Nearest multivariate system with given root multiplicities , 2009, J. Symb. Comput..

[6] Hans J. Stetter,et al. Numerical polynomial algebra , 2004 .

[7] Narendra Karmarkar,et al. Approximate polynomial greatest common divisors and nearest singular polynomials , 1996, ISSAC '96.

[8] Robert M. Corless,et al. The nearest polynomial of lower degree , 2007, SNC '07.

[9] Zhi Lihong,et al. Nearest Singular Polynomials , 1998 .

[10] L. Zhi,et al. Hybrid method for computing the nearest singular polynomials , 2004 .

[11] Robert M. Corless,et al. The nearest polynomial with a given zero, revisited , 2005, SIGS.

[12] Zhonggang Zeng. Computing multiple roots of inexact polynomials , 2005, Math. Comput..