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

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

A C implementation of Niederreiter's algorithm for factoring polynomials over F 2 is described. The most time-consuming part of this algorithm, which consists of setting up and solving a certain ...

We discuss the application of orthogonal polynomials to the estimation of probability density functions, particularly with regard to accessing features of a portfolio's profit/loss distribution. Such ...

Abstract. We present a nonparametric approach based on local polynomial regression for ensemble forecast of time series. The state space is first reconstructed by embedding the univariate time series ...

A UNSW Sydney mathematician has discovered a new method to tackle algebra's oldest challenge—solving higher polynomial equations. Polynomials are equations involving a variable raised to powers, such ...