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

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

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

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

New research details an intriguing new way to solve "unsolvable" algebra problems that go beyond the fourth degree – something that has generally been deemed impossible using traditional methods for ...

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