Related papers: Approximate GCD in a Bernstein basis

We investigate a way to approximate the maximum of a polynomial over a polytopal region by using Handelman's polynomial decomposition and continuous multivariate generating functions. The maximization problem is NP-hard, but our…

In the present paper we study approximation of discs by octagons on the pixel plane. To decide which octagon approximates better the given disc we use Jaccard's distance. The table of Jaccard's distances (calculated by a software created…

Asymptotic approximations to the zeros of Jacobi polynomials are given, with methods to obtain the coefficients in the expansions. These approximations can be used as standalone methods for the non-iterative computation of the nodes of…

In this work we study qualitative properties of real analytic bounded maps. The main tool is approximation of real valued functions analytic in rectangular domains of the complex plane by continued g-fractions of Wall. As an application,…

Some known results for locating the roots of polynomials are extended to the case of matrix polynomials. In particular, a theorem by A.E. Pellet [Bulletin des Sciences Math\'ematiques, (2), vol 5 (1881), pp.393-395], some results of D.A.…

We prove conditional near-quadratic running time lower bounds for approximate Bichromatic Closest Pair with Euclidean, Manhattan, Hamming, or edit distance. Specifically, unless the Strong Exponential Time Hypothesis (SETH) is false, for…

We present a weighted approach to compute a maximum cardinality matching in an arbitrary bipartite graph. Our main result is a new algorithm that takes as input a weighted bipartite graph $G(A\cup B,E)$ with edge weights of $0$ or $1$. Let…

We present an approach (the biroot method) for nth root approximation that yields closed-form rational functions with coefficients derived from binomial structures, Gaussian functions, or qualifying DAG structures. The method emerges from…

Iterated Bernstein polynomial approximations of degree n for continuous function which also use the values of the function at i/n, i=0,1,...,n, are proposed. The rate of convergence of the classic Bernstein polynomial approximations is…

In this paper we propose a novel efficient algorithm for calculating winding numbers, aiming at counting the number of roots of a given polynomial in a convex region on the complex plane. This algorithm can be used for counting and…

Univariate polynomial root-finding is a classical subject, still important for modern computing. Frequently one seeks just the real roots of a polynomial with real coefficients. They can be approximated at a low computational cost if the…

In this paper we show a new way of constructing deterministic polynomial-time approximation algorithms for computing complex-valued evaluations of a large class of graph polynomials on bounded degree graphs. In particular, our approach…

In this paper, we develop a fully discrete Galerkin method for solving initial value fractional integro-differential equations(FIDEs). We consider Generalized Jacobi polynomials(GJPs) with indexes corresponding to the number of homogeneous…

Generalized polynomial chaos expansions are a powerful tool to study differential equations with random coefficients, allowing in particular to efficiently approximate random invariant sets associated to such equations. In this work, we use…

We consider the numerical approximation of the spectrum of a second-order elliptic eigenvalue problem by the hybridizable discontinuous Galerkin (HDG) method. We show for problems with smooth eigenfunctions that the approximate eigenvalues…

This paper studies numerical methods for the approximation of elliptic PDEs with lognormal coefficients of the form $-{\rm div}(a\nabla u)=f$ where $a=\exp(b)$ and $b$ is a Gaussian random field. The approximant of the solution $u$ is an…

We study strong (pathwise) approximation of Cox-Ingersoll-Ross processes. We propose a Milstein-type scheme that is suitably truncated close to zero, where the diffusion coefficient fails to be locally Lipschitz continuous. For this scheme…

This brief note corrects some errors in the paper quoted in the title, highlights a combinatorial result which may have been overlooked, and points to further improvements in recent literature.

This paper is the widely extended version of the publication, appeared in Proceedings of ISSAC'2009 conference \citep*{ALM09}. We discuss more details on proofs, present new algorithms and examples. We present a general algorithm for…

We study Bredon homology approximations for spaces with an action of a compact Lie group G. We show that if M is a coMackey functor satisfying mild p-locality conditions, then Bredon homology of a G-space X with coefficients in M is…