Related papers: Polynomial integration on regions defined by a tri…

In this paper, we study a class of fractional semi-infinite polynomial programming (FSIPP) problems, in which the objective is a fraction of a convex polynomial and a concave polynomial, and the constraints consist of infinitely many convex…

In this paper, we consider the problem of covering a plane region with unit discs. We present an improved upper bound and the first nontrivial lower bound on the number of discs needed for such a covering, depending on the area and…

Finite element methods usually construct basis functions and quadrature rules for multidimensional domains via tensor products of one-dimensional counterparts. While straightforward, this approach results in integration spaces larger than…

We present a novel method to perform numerical integration over curved polyhedra enclosed by high-order parametric surfaces. Such a polyhedron is first decomposed into a set of triangular and/or rectangular pyramids, whose certain faces…

Despite extensive research on symmetric polynomial quadrature rules for triangles, as well as approaches to their calculation, few studies have focused on non-polynomial functions, particularly on their integration using symmetric triangle…

In this note we shall introduce a simple, effective numerical method for solving partial differential equations for scalar and vector-valued data defined on surfaces. Even though we shall follow the traditional way to approximate the…

The ideas behind the concept of algebraic ("integration-by-parts") algorithms for multiloop calculations are reviewed. For any topology and mass pattern, a finite iterative algebraic procedure is proved to exist which transforms the…

We study the structure of the set of all possible affine hyperplane sections of a convex polytope. We present two different cell decompositions of this set, induced by hyperplane arrangements. Using our decomposition, we bound the number of…

Spherical $t$-designs are finite point sets on the unit sphere that enable exact integration of polynomials of degree at most $t$ via equal-weight quadrature. This concept has recently been extended to spherical $t$-design curves by the use…

We derive an analytic expression for the scalar one-loop pentagon and hexagon functions which is convenient for subsequent numerical integration. These functions are of relevance in the computation of next-to-leading order radiative…

We show that the integration-by-parts reductions of various two-loop integral topologies can be efficiently obtained by applying unitarity cuts to a specific set of subgraphs and solving associated polynomial (syzygy) equations.

We propose a randomized polynomial time algorithm for computing nontrivial zeros of quadratic forms in 4 or more variables over $\mathbb{F}_q(t)$, where $\mathbb{F}_q$ is a finite field of odd characteristic. The algorithm is based on a…

Let $f, f_1, \ldots, f_\nV$ be polynomials with rational coefficients in the indeterminates $\bfX=X_1, \ldots, X_n$ of maximum degree $D$ and $V$ be the set of common complex solutions of $\F=(f_1,\ldots, f_\nV)$. We give an algorithm…

Let $T$ be a square matrix with a real spectrum, and let $f$ be an analytic function. The problem of the approximate calculation of $f(T)$ is discussed. Applying the Schur triangular decomposition and the reordering, one can assume that $T$…

We present a number of new contributions to the topic of constructing efficient higher-order splitting methods for the numerical integration of evolution equations. Particular schemes are constructed via setup and solution of polynomial…

We present integral representations of solutions to division problems involving matrices of polynomials in several complex variables. We also find estimates of the polynomial degree of the solutions by means of careful degree estimates of…

In the present paper the optimal quadrature formulas in the sense of Sard are constructed for numerical integration of the integral $\int_a^b e^{2\pi i\omega x}\varphi(x)d x$ with $\omega\in \mathbb{R}$ in the Hilbert space…

In this note we provide an algorithm for computing the fractional integrals of orthogonal polynomials, which is more stable than that using the expression of the polynomials w.r.t. the canonical basis. This algorithm is aimed at solving…

We consider constrained optimization problems defined in the tropical algebra setting on a linearly ordered, algebraically complete (radicable) idempotent semifield (a semiring with idempotent addition and invertible multiplication). The…

We propose a technique called Rotate-and-Kill for solving the polygon inclusion and circumscribing problems. By applying this technique, we obtain $O(n)$ time algorithms for computing (1) the maximum area triangle in a given $n$-sided…