Carlos Beltran

2papers

2 Papers

NANov 7, 2012
The complexity and geometry of numerically solving polynomial systems

Carlos Beltran, Michael Shub

These pages contain a short overview on the state of the art of efficient numerical analysis methods that solve systems of multivariate polynomial equations. We focus on the work of Steve Smale who initiated this research framework, and on the collaboration between Stephen Smale and Michael Shub, which set the foundations of this approach to polynomial system--solving, culminating in the more recent advances of Carlos Beltran, Luis Miguel Pardo, Peter Buergisser and Felipe Cucker.

NAFeb 21, 2018
The real polynomial eigenvalue problem is well conditioned on the average

Carlos Beltran, Khazhgali Kozhasov

We study the average condition number for polynomial eigenvalues of collections of matrices drawn from various random matrix ensembles. In particular, we prove that polynomial eigenvalue problems defined by matrices with Gaussian entries are very well-conditioned on the average.