Related papers: Polynomial potential minimization on the unit circ…
We study the extension problem on the Sierpinski Gasket ($SG$). In the first part we consider minimizing the functional $\mathcal{E}_{\lambda}(f) = \mathcal{E}(f,f) + \lambda \int f^2 d \mu$ with prescribed values at a finite set of points…
Marginalization -- summing a function over all assignments to a subset of its inputs -- is a fundamental computational problem with applications from probabilistic inference to formal verification. Despite its computational hardness in…
We present an optimization of the reduction algorithm of one-loop amplitudes in terms of master integrals. It is based on the exploitation of the polynomial structure of the integrand when evaluated at values of the loop-momentum fulfilling…
We generalize a previous inequality related to a sharp version of the Littlewood conjecture on the minimal $L_1$-norm of $N$-term exponential sums $f$ on the unit circle. The new result concerns replacing the expression $\log(1+t|f|^2)$…
In this paper we combine an infeasible Interior Point Method (IPM) with the Proximal Method of Multipliers (PMM). The resulting algorithm (IP-PMM) is interpreted as a primal-dual regularized IPM, suitable for solving linearly constrained…
Approximate bound state solutions of the Dirac equation with the Hulth\'en plus a new generalized ring-shaped (RS) potential are obtained for any arbitrary -state. The energy eigenvalue equation and the corresponding two-component wave…
Let $S=(s_1,s_2,...,s_m,...)$ be a linear recurring sequence with terms in $GF(q^n)$ and $T$ be a linear transformation of $GF(q^n)$ over $GF(q)$. Denote $T(S)=(T(s_1),T(s_2),...,T(s_m),...)$. In this paper, we first present counter…
There is proposed a method for improving the convergence of Fourier series by function systems, orthogonal at the segment, the application of which allows for smooth functions to receive uniformly convergent series. There is also proposed…
We briefly review general concepts of renormalization in quantum field theory and discuss their application to solutions of integral equations with singular potentials in the few-nucleon sector of the low-energy effective field theory of…
In this thesis, a new class of algorithms based on Sums of Squares Programming is developed. These allow to reduce a degree-$d$ homogeneous polynomial $T = \sum_{i = 1}^m \langle a_i, X \rangle^d $ to a quadratic form being close to a…
First we consider the following problem which dates back to Chebyshev, Zolotarev and Achieser: among all trigonometric polynomials with given leading coefficients $a_0,...,a_l,$ $b_0,...,b_l \in \mathbb R$ find that one with least maximum…
A formulation of variational principles in terms of functional integrals is proposed for any type of local plastic potentials. The minimization problem is reduced to the computation of a path integral. This integral can be used as a…
This article is concerned with an extension of univariate Chebyshev polynomials of the first kind to the multivariate setting, where one chases best approximants to specific monomials by polynomials of lower degree relative to the uniform…
We classify, according to their computational complexity, integer optimization problems whose constraints and objective functions are polynomials with integer coefficients and the number of variables is fixed. For the optimization of an…
The demagnetization field in micromagnetism is given as the gradient of a potential which solves a partial differential equation (PDE) posed in R^d. In its most general form, this PDE is supplied with continuity condition on the boundary of…
A fundamental problem in numerical analysis and approximation theory is approximating smooth functions by polynomials. A much harder version under recent consideration is to enforce bounds constraints on the approximating polynomial. In…
Let $p$ be a prime. We prove bounds on short Dirichlet character sums evaluated at a class of homogeneous polynomials in arbitrary dimensions. In every dimension, this bound is nontrivial for sums over boxes with side lengths as short as…
In polynomial optimization problems, nonnegativity constraints are typically handled using the sum of squares condition. This can be efficiently enforced using semidefinite programming formulations, or as more recently proposed by Papp and…
Chebyshev interpolation polynomials exhibit the exponential approximation property to analytic functions on a cube. Based on the Chebyshev interpolation polynomial approximation, we propose iterative polynomial approximation algorithms to…
We show that the reduced point variety of a quantum polynomial algebra is the union of specific linear subspaces in $\mathbb{P}^n$, we describe its irreducible components and give a combinatorial description of the possible configurations…