Related papers: On the logarithmic energy of solutions to the poly…
The bound state energy eigenvalues and the corresponding eigenfunctions of the generalized Woods Saxon potential are obtained in terms of the Jacobi polynomials. Nikiforov Uvarov method is used in the calculations. It is shown that the…
We introduce a particular optimization problem that minimizes the sum of a non-convex quadratic function and logarithmic barrier-functions in a $\ell_\infty$-trust-region (i.e. cube). Our paper covers three topics. We explain the relevance…
The main purpose of this paper is to study the NP-complete subset-sum problem, not in the usual context of time-complexity-based classification of the algorithms (exponential/polynomial), but through a new kind of algorithmic classification…
A real square matrix is Perron-like if it has a real eigenvalue $s$, called the principal eigenvalue of the matrix, and $\mbox{Re}\,\mu<s$ for any other eigenvalue $\mu$. Nonnegative matrices and symmetric ones are typical examples of this…
In this article we present a unified treatment for obtaining bounds on the potential energy of codes in the general context of polynomial metric spaces (PM-spaces). The lower bounds we derive via the linear programming (LP) techniques of…
Influence diagrams provide a compact graphical representation of decision problems. Several algorithms for the quick computation of their associated expected utilities are available in the literature. However, often they rely on a full…
We study quantum algorithms for approximating Lasserre's hierarchy values for polynomial optimization. Let $f,g_1,\ldots,g_m$ be real polynomials in $n$ variables and $f^\star$ the infimum of $f$ over the semialgebraic set $S(g)=\{x:…
We have performed a detailed exploration of the energy landscape for configurations of points on the sphere, interacting via the logarithmic potential, and corresponding to local minima of the total energy, up to $N = 160$. The growth of…
The polynomial solution of the N-dimensional space Schrodinger equation for a special case of Mie potential is obtained for any arbitrary $% l-state. The exact bound-state energy eigenvalues and the corresponding eigenfunctions are…
The purpose of this paper is to determine the asymptotic of the average energy of a configuration of N zeros of system of random polynomials of degree N as N tends to infinity and more generally the zeros of random holomorphic sections of a…
The one-dimensional Schroedinger's equation is analysed with regard to the existence of exact solutions for decatic polynomial potentials. Under certain conditions on the potential's parameters, we show that the decatic polynomial potential…
The computation of eigenvalues of large-scale matrices arising from finite element discretizations has gained significant interest in the last decade. Here we present a new algorithm based on slicing the spectrum that takes advantage of the…
The authors present a unified method for calculating the zeros of the classical orthogonal polynomials based upon the electrostatic interpretation and its connection to the energy minimization problem. Examples are given with error…
We introduce a numerical method for generating the approximating polynomials used in fermionic calculations with smeared link actions. We investigate the stability of the algorithm and determine the optimal weight function and the optimal…
Quantum algorithm is an algorithm for solving mathematical problems using quantum systems encoded as information, which is found to outperform classical algorithms in some specific cases. The objective of this study is to develop a quantum…
Finding a low-weight multiple (LWPM) of a given polynomial is very useful in the cryptanalysis of stream ciphers and arithmetic in finite fields. There is no known deterministic polynomial time complexity algorithm for solving this problem,…
We present the results of systematic numerical computations relating to the extreme value statistics of the characteristic polynomials of random unitary matrices drawn from the Circular Unitary Ensemble (CUE) of Random Matrix Theory. In…
Polynomial ensembles are a sub-class of probability measures within determinantal point processes. Examples include products of independent random matrices, with applications to Lyapunov exponents, and random matrices with an external…
While previous work on energy-efficient algorithms focused on assumption that tasks can be assigned to any processor, we initially study the problem of task scheduling on restricted parallel processors. The objective is to minimize the…
We search for first- and second-order corrections to the energy levels of the Pauli-Dirac equation within the Rayleigh-Schr\"odinger theory. We use some identities satisfied by the associated Laguerre polynomials to reach this aim. We give…