相关论文: Volume computation for polytopes and partition fun…
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…
We propose a simple estimator that allows to calculate the absolute value of a system's partition function from a finite sampling of its canonical ensemble. The estimator utilizes a volume correction term to compensate the effect that the…
By establishing an interesting connection between ordinary Bell polynomials and rational convolution powers, some composition and inverse relations of Bell polynomials as well as explicit expressions for convolution roots of sequences are…
We present a FFT-based algorithm for the computation of a polynomial's coefficients from its roots, and apply it to obtain the coefficients of interpolation polynomials, to invert Vandermondians and to evaluate the symmetric functions of a…
We consider the interpolation problem with the inverse multiquadric radial basis function. The problem usually produces a large dense linear system that has to be solved by iterative methods. The efficiency of such methods is strictly…
We construct a quasi-polynomial time deterministic approximation algorithm for computing the volume of an independent set polytope with restrictions. Randomized polynomial time approximation algorithms for computing the volume of a convex…
This article handles in a short manner a few Laplace transform pairs and some extensions to the basic equations are developed. They can be applied to a wide variety of functions in order to find the Laplace transform or its inverse when…
In this paper, we consider the volume of a special kind of flow polytope. We show that its volume satisfies a certain system of differential equations, and conversely, the solution of the system of differential equations is unique up to a…
New numerical algorithms based on rational functions are introduced that can solve certain Laplace and Helmholtz problems on two-dimensional domains with corners faster and more accurately than the standard methods of finite elements and…
An important class of fractional differential and integral operators is given by the theory of fractional calculus with respect to functions, sometimes called $\Psi$-fractional calculus. The operational calculus approach has proved useful…
We apply some recent developments of Baldoni-Beck-Cochet-Vergne on vector partition function, to Kostant's and Steinberg's formulae, for classical Lie algebras $A\_r$, $B\_r$, $C\_r$, $D\_r$. We therefore get efficient {\tt Maple} programs…
Given a finite set of vectors spanning a lattice and lying in a halfspace of a real vector space, to each vector $a$ in this vector space one can associate a polytope consisting of nonnegative linear combinations of the vectors in the set…
The main purpose and motivation of this article is to create a linear transformation on the polynomial ring of rational numbers. A matrix representation of this linear transformation based on standard fundamentals will be given. For some…
Weighted cone-volume functionals are introduced for the convex polytopes in $\mathbb{R}^n$. For these functionals, geometric inequalities are proved and the equality conditions are characterized. A variety of corollaries are derived,…
Computing volumetric correspondences between 3D shapes is a prominent tool for medical and industrial applications. In this work, we pave the way for spectral volume mapping, extending for the first time the surface-based functional maps…
We apply an algorithm for measuring the volume of polytopes described by Jim Lawrence to polytropes. By using a tropical form of Cramer's rule, we found an efficient way to find all pseudovertices which are necessary for computing the…
We are interested in the fast computation of the exact value of integrals of polynomial functions over convex polyhedra. We present speed ups and extensions of the algorithms presented in previous work. We present the new software…
In this article, we deal with the efficient computation of the Wright function in the cases of interest for the expression of solutions of some fractional differential equations. The proposed algorithm is based on the inversion of the…
The classical Talbot method for the computation of the inverse Laplace transform is improved for the case where the transform is analytic in the complex plane except for the negative real axis. First, by using a truncated Talbot contour…
This paper deals with the computation of polytopic invariant sets for polynomial dynamical systems. An invariant set of a dynamical system is a subset of the state space such that if the state of the system belongs to the set at a given…