Related papers: Approximate GCD in a Bernstein basis
In geostatistical problems with massive sample size, Gaussian processes can be approximated using sparse directed acyclic graphs to achieve scalable $O(n)$ computational complexity. In these models, data at each location are typically…
An effective exact method is proposed for computing generalized eigenspaces of a matrix of integers or rational numbers. Keys of our approach are the use of minimal annihilating polynomials and the concept of the Jourdan-Krylov basis. A new…
We propose a \textit{purely combinatorial algorithm} for \mkvc{} in bipartite graphs, achieving approximation ratio~0.7. The only combinatorial algorithms currently known until now for this problem are the natural greedy algorithm, that…
We seek to approximate a composite function h(x) = g(f(x)) with a global polynomial. The standard approach chooses points x in the domain of f and computes h(x) at each point, which requires an evaluation of f and an evaluation of g. We…
We propose an improved algorithm for finding roots of polynomials over finite fields. This makes possible significant speedup of the decoding process of Bose-Chaudhuri-Hocquenghem, Reed-Solomon, and some other error-correcting codes.
We construct explicit easily implementable polynomial approximations of sufficiently high accuracy for locally constant functions on the union of disjoint segments. This problem has important applications in several areas of numerical…
Given a weighted graph $G$ with $n$ vertices and $m$ edges, and a positive integer $p$, the Hamiltonian $p$-median problem consists in finding $p$ cycles of minimum total weight such that each vertex of $G$ is in exactly one cycle. We…
Based on the Bezout approach we propose a simple algorithm to determine the {\tt gcd} of two polynomials which doesn't need division, like the Euclidean algorithm, or determinant calculations, like the Sylvester matrix algorithm. The…
Bernstein-Sato polynomial of a hypersurface is an important object with numerous applications. It is known, that it is complicated to obtain it computationally, as a number of open questions and challenges indicate. In this paper we propose…
Solutions of stationary Fokker-Planck equations in the narrow beam regime are commonly approximated by either ballistic linear transport or by a Fermi pencil-beam equation. We present a rigorous approximation analysis of these three models…
In this paper we show the existence of approximate completely positive semidefinite (cpsd) factorizations with a cpsd-rank bounded above (almost) independently from the cpsd-rank of the initial matrix. This is particularly relevant since…
This note presents a fixed-point formula designed to approximate the roots of Askey-Wilson poynomials for small parameter values.
This paper introduces a novel error estimator for the Proper Generalized Decomposition (PGD) approximation of parametrized equations. The estimator is intrinsically random: It builds on concentration inequalities of Gaussian maps and an…
In this paper, Bernstein piecewise polynomials are used to solve the integral equations numerically. A matrix formulation is given for a non-singular linear Fredholm Integral Equation by the technique of Galerkin method. In the Galerkin…
Given two polynomials, we find a convergence property of the GCD of the rising factorial and the falling factorial. Based on this property, we present a unified approach to computing the universal denominators as given by Gosper's algorithm…
In quantum computation with continous-variable systems, quantum advantage can only be achieved if some non-Gaussian resource is available. Yet, non-Gaussian unitary evolutions and measurements suited for computation are challenging to…
In this paper we introduce a new family of Bernstein-type exponential polynomials on the hypercube $[0, 1]^d$ and study their approximation properties. Such operators fix a multidimensional version of the exponential function and its…
In this paper, we provide an efficient method for computing the Taylor coefficients of $1-p_n f$, where $p_n$ denotes the optimal polynomial approximant of degree $n$ to $1/f$ in a Hilbert space $H^2_\omega$ of analytic functions over the…
In this paper, we introduce a polynomial-time 2-approximation algorithm for the Unrooted Prize-Collecting Forest with $K$ Components (URPCF$_K$) problem. URPCF$_K$ aims to find a forest with exactly $K$ connected components while minimizing…
We present a $p$-adic algorithm to recover the lexicographic Gr\"obner basis $\mathcal G$ of an ideal in $\mathbb Q[x,y]$ with a generating set in $\mathbb Z[x,y]$, with a complexity that is less than cubic in terms of the dimension of…