Real Stability Testing
Data Structures and Algorithms
2016-10-04 v1
Abstract
We give a strongly polynomial time algorithm which determines whether or not a bivariate polynomial is real stable. As a corollary, this implies an algorithm for testing whether a given linear transformation on univariate polynomials preserves real-rootedness. The proof exploits properties of hyperbolic polynomials to reduce real stability testing to testing nonnegativity of a finite number of polynomials on an interval.
Keywords
Cite
@article{arxiv.1610.00209,
title = {Real Stability Testing},
author = {Prasad Raghavendra and Nick Ryder and Nikhil Srivastava},
journal= {arXiv preprint arXiv:1610.00209},
year = {2016}
}