This is a black-box polynomial root finder written in modern C++ (header only, no dependencies except the standard library). It is based on the 1975 paper: K. Madsen and J. Reid, "Fortran Subroutines ...

Abstract: Recently, Polynomial Chaos (PC) has been proposed as efficient approach for performing uncertainty quantification in the the context of electronic design automation. A related approach, ...

I needed this recently and thought adding it to SymPy should be an easy win. A more efficient algorithm is to see the polynomial as a formal power series, use Newton's method to find the square root ...

Hilbert’s 12th problem asked for novel analogues of the roots of unity, the building blocks for certain number systems. Now, over 100 years later, two mathematicians have produced them. Problems in ...

In this paper D-optimal designs for the weighted polynomial regression model of degree p with efficiency function (1 + x 2)-n are presented. Interest in these designs stems from the fact that they are ...

ABSTRACT: In this paper, the traditional proof of “square root of 2 is not a rational number” has been reviewed, and then the theory has been generalized to “if n is not a square, square root of n is ...