The project consists of three main parts. It's worth noting that each best second-kind rational approximation is also the best first-kind rational approximation. Build and compile the project using ...

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: Generalized Chebyshev functions of an arbitrary order with up to three real-frequency zero pairs are derived in an explicit rational polynomial expression. Given in-band ripple level and ...

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

This is a preview. Log in through your library . Abstract We present a polynomial time algorithm to compute any fixed number of the highest coefficients of the Ehrhart quasi-polynomial of a rational ...