Computing the nearest singular univariate polynomials with given root multiplicities

Authors:
Zijia Li;Lihong Zhi
Affiliations:
Johann Radon Institute for Computational and Applied Mathematics, Austrian Academy of Sciences, Linz 4040, Austria and Key Lab of Mathematics Mechanization, AMSS, Beijing 100190, China;Key Lab of Mathematics Mechanization, AMSS, Beijing 100190, China
Venue:
Theoretical Computer Science
Year:
2013

Citing 9
Cited 0

Approximate polynomial greatest common divisors and nearest singular polynomials

ISSAC '96 Proceedings of the 1996 international symposium on Symbolic and algebraic computation
Efficient algorithms for computing the nearest polynomial with constrained roots

ISSAC '98 Proceedings of the 1998 international symposium on Symbolic and algebraic computation
Nearest singular polynomials

Journal of Symbolic Computation - Special issue on symbolic numeric algebra for polynomials
Efficient algorithms for computing the nearest polynomial with a real root and related problems

ISSAC '99 Proceedings of the 1999 international symposium on Symbolic and algebraic computation
The nearest polynomial with a given zero, and similar problems

ACM SIGSAM Bulletin
Numerical Polynomial Algebra

Numerical Polynomial Algebra
The nearest polynomial with a given zero, revisited

ACM SIGSAM Bulletin
The nearest polynomial of lower degree

Proceedings of the 2007 international workshop on Symbolic-numeric computation
Nearest multivariate system with given root multiplicities

Journal of Symbolic Computation

Quantified Score

Hi-index	5.23

Visualization

Abstract

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].