Related papers: Computing approximate roots of monotone functions

A deep approximation is an approximating function defined by composing more than one layer of simple functions. We study deep approximations of functions of one variable using layers consisting of low-degree polynomials or simple conformal…

Let $K$ be a field, complete with respect to a discrete non-archimedian valuation and let $k$ be the residue field. Consider a system $F$ of $n$ polynomial equations in $K\vars$. Our first result is a reformulation of the classical Hensel's…

We show that if a real trigonometric polynomial has few real roots, then the trigonometric polynomial obtained by writing the coefficients in reverse order must have many real roots. This is used to show that a class of random trigonometric…

Suppose $p$ is a prime, $t$ is a positive integer, and $f\!\in\!\mathbb{Z}[x]$ is a univariate polynomial of degree $d$ with coefficients of absolute value $<\!p^t$. We show that for any fixed $t$, we can compute the number of roots in…

The paper proposes an approximate expression for calculating very complex one-dimensional integrals depending on the parameter $a$. These integrals often occur in computational problems theory of magnetic solitons. The resulting analytical…

We study the problem of reconstructing a function on a manifold satisfying some mild conditions, given data on the values and some derivatives of the function at arbitrary points on the manifold. While the problem of finding a polynomial of…

We present a theory of the $b$-function (or Bernstein-Sato polynomial) in positive characteristic. Let $f$ be a non-constant polynomial with coefficients in a perfect field $k$ of characteristic $p>0.$ Its $b$-function $b_f$ is defined to…

We prove the irreducibility of integer polynomials $f(X)$ whose roots lie inside an Apollonius circle associated to two points on the real axis with integer abscisae $a$ and $b$, with ratio of the distances to these points depending on the…

Let $\chi$ be an order $c$ multiplicative character of a finite field and $f(x)=x^d+\lambda x^e$ a binomial with $(d,e)=1$. We study the twisted classical and $T$-adic Newton polygons of $f$. When $p>(d-e)(2d-1)$, we give a lower bound of…

A real valued function $f$ defined on a real open interval $I$ is called $\Phi$-monotone if, for all $x,y\in I$ with $x\leq y$ it satisfies $$ f(x)\leq f(y)+\Phi(y-x), $$ where $\Phi:[0,\ell(I)[\,\to\mathbb{R}_+$ is a given nonnegative…

A rational approximation by a ratio of polynomial functions is a flexible alternative to polynomial approximation. In particular, rational functions exhibit accurate estimations to nonsmooth and non- Lipschitz functions, where polynomial…

In approximation theory, it is standard to approximate functions by polynomials expressed in the Chebyshev basis. Evaluating a polynomial $f$ of degree n given in the Chebyshev basis can be done in $O(n)$ arithmetic operations using the…

We obtain an estimate on the average cardinality of the value set of any family of monic polynomials of Fq[T] of degree d for which s consecutive coefficients a_{d-1},..., a_{d-s} are fixed. Our estimate holds without restrictions on the…

In this paper we use motivic integration and non-archimedean analytic geometry to study the singularities at infinity of the fibers of a polynomial map $f\colon \mathbb A^d_\mathbb C \to \mathbb A^1_\mathbb C$. We show that the motive…

We study the approximation capabilities of two families of univariate polynomials that arise in applications of quantum signal processing. Although approximation only in the domain $[0,1]$ is physically desired, these polynomial families…

We show that for the problem of minimizing (or maximizing) the ratio of two supermodular functions, no bounded approximation ratio can be achieved via polynomial number of queries, if the two supermodular functions are both monotone…

We introduce and study the minimum distance function of a graded ideal in a polynomial ring with coefficients in a field, and show that it generalizes the minimum distance of projective Reed-Muller-type codes over finite fields. This gives…

We study the problem of approximating an unknown function $f:\mathbb{R}\to\mathbb{R}$ by a degree-$d$ polynomial using as few function evaluations as possible, where error is measured with respect to a probability distribution $\mu$.…

We provide upper bounds on the total number of irreducible factors, and in particular irreducibility criteria for some classes of bivariate polynomials $f(x,y)$ over an arbitrary field $\mathbb{K}$. Our results rely on information on the…

We combine the known methods for univariate polynomial root-finding and for computations in the Frobenius matrix algebra with our novel techniques to advance numerical solution of a univariate polynomial equation, and in particular…