The basic facts about separable extensions of discrete fields and factoring polynomials are developed in the constructive spirit of Errett Bishop. The ability to factor polynomials is shown to be ...

Uncertainty quantification (UQ) is increasingly critical for modelling complex systems in which input parameters or environmental conditions vary unpredictably. Polynomial chaos methods offer a ...

We present a general framework whereby analysis of interior-point algorithms for semidefinite programming can be extended verbatim to optimization problems over all classes of symmetric cones ...