Related papers: Polynomial integration on regions defined by a tri…
We develop a collection of numerical algorithms which connect ideas from polyhedral geometry and algebraic geometry. The first algorithm we develop functions as a numerical oracle for the Newton polytope of a hypersurface and is based on…
We present a methodology for numerically integrating ordinary differential equations containing rapidly oscillatory terms. This challenge is distinct from that for differential equations which have rapidly oscillatory solutions: here the…
This paper presents a nonconforming finite element scheme for the planar biharmonic equation which applis piecewise cubic polynomials ($P_3$) and possesses $\mathcal{O}(h^2)$ convergence rate in energy norm on general shape-regular…
We give an overview of recently implemented polymake features for computations in tropical geometry. The main focus is on explicit examples rather than technical explanations. Our computations employ tropical hypersurfaces, moduli of…
Feynman integral reduction by means of integration-by-parts identities is a major power gadget in a theorist toolbox indispensable for calculation of multiloop quantum effects relevant for particle phenomenology and formal theory alike. An…
We consider the numerical computation of finite-range singular integrals $$I[f]=\intBar^b_a f(x)\,dx,\quad f(x)=\frac{g(x)}{(x-t)^m},\quad m=1,2,\ldots,\quad a<t<b,$$ that are defined in the sense of Hadamard Finite Part, assuming that…
We present a new method for numerically computing generic multi-loop Feynman integrals. The method relies on an iterative application of Feynman's trick for combining two propagators. Each application of Feynman's trick introduces a…
We show factorization of polynomials in one variable over the tropical semiring is in general NP-complete, either if all coefficients are finite, or if all are either 0 or infinity (Boolean case). We give algorithms for the factorization…
We present a new hybrid numerical method for multiscale partial differential equations, which simultaneously captures the global macroscopic information and resolves the local microscopic events over regions of relatively small size. The…
In this paper, we study square functions for extension operators over finite-type, planar curves endowed with the Euclidean arclength measure. We prove new results for curves of the form $(T,\phi(T))$ where $\phi(T)$ is a polynomial of…
The method of regions, which provides a systematic approach for computing Feynman integrals involving multiple kinematic scales, proposes that a Feynman integral can be approximated and even reproduced by summing over integrals expanded in…
In this paper we discuss two different existing algorithms for computing topological entropy and we perform one of them in order to compute the isentropes for cubic polynomials.
This paper presents a Kharitonov-type algorithm for complex interval Hurwitz polynomials that determines whether all roots of a given interval polynomial lie within a prescribed angular sector of the complex plane. The method requires…
This paper presents a novel approach for numerical solution of a class of fourth order time fractional partial differential equations (PDE's). The finite difference formulation has been used for temporal discretization, whereas, the space…
The implementation of discontinuous functions occurs in many of today's state-of-the-art partial differential equation solvers. However, in finite element methods, this poses an inherent difficulty: efficient quadrature rules available when…
We present a spectral method for one-sided linear fractional integral equations on a closed interval that achieves exponentially fast convergence for a variety of equations, including ones with irrational order, multiple fractional orders,…
We study the proportion of conics given by $(\mathcal{C}_{\mathbf{F}, \mathbf{y}}) : F_0(\mathbf{y})x_0^2 + F_1(\mathbf{y})x_1^2 = F_2( \mathbf{y})x_2^2 $ which have a rational point $\mathbf{x} = (x_0 :x_1:x_2) \in…
The numerical integration of an analytical function $f(x)$ using a finite set of equidistant points can be performed by quadrature formulas like the Newton-Cotes. Unlike Gaussian quadrature formulas however, higher-order Newton-Cotes…
Consider the polynomial optimization problem whose objective and constraints are all described by multivariate polynomials. Under some genericity assumptions, %% on these polynomials, we prove that the optimality conditions always hold on…
The polynomial partitioning method of Guth and Katz [arXiv:1011.4105] has numerous applications in discrete and computational geometry. It partitions a given $n$-point set $P\subset\mathbb{R}^d$ using the zero set $Z(f)$ of a suitable…