SIAM Journal on Numerical Analysis, Vol. 11, No. 6 (Dec., 1974), pp. 1087-1104 (18 pages) A composite algorithm has been designed for finding zeros of real polynomials. The algorithm has proved 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 show that the binary expansions of algebraic numbers do not form secure pseudorandom sequences; given sufficiently many initial bits of an algebraic number, its minimal polynomial can 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 ...

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