Choosing roots of polynomials smoothly

From MaRDI portal



Abstract: We clarify the question whether for a smooth curve of polynomials one can choose the roots smoothly and related questions. Applications to perturbation theory of operators are given.


The authors study the problem whether for a smooth curve of polynomials one can choose the roots in a smooth fashion. They suggest an algorithm which sometimes gives rise to a solution. Typical results are the following. Assume that all the roots are real. Then they can always be chosen differentiable, but not always \(C^1\) in degree \(\geq 3\). In degree 2 it is always possible to choose the roots being twice differentiable, but not \(C^2\) in general.




Cited in
(43)








This page was built for publication: Choosing roots of polynomials smoothly

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1264286)