Related papers: Constraint polynomial approach -- an alternative t…
This paper begins with a class of convex quadratic programs (QPs) with bounded variables solvable by the parametric principal pivoting algorithm with $\mathcal{O}(n^3)$ strongly polynomial complexity, where $n$ is the number of variables of…
We study solutions of the Bethe Ansatz equation related to the trigonometric Gaudin model associated to a simple Lie algebra g and a tensor product of irreducible finite-dimensional representations. Having one solution, we describe a…
Quasi-exactly solvable Rabi model is investigated within the framework of the Bargmann Hilbert space of analytic functions ${\cal B}$. On applying the theory of orthogonal polynomials, the eigenvalue equation and eigenfunctions are shown to…
This paper studies convex Generalized Nash Equilibrium Problems (GNEPs) that are given by polynomials. We use rational and parametric expressions for Lagrange multipliers to formulate efficient polynomial optimization for computing…
Polynomial quantified entailments with existentially and universally quantified variables arise in many problems of verification and program analysis. We present PolyQEnt which is a tool for solving polynomial quantified entailments in…
This paper shows that there is a correspondence between quasi-exactly solvable models in quantum mechanics and sets of orthogonal polynomials $\{ P_n\}$. The quantum-mechanical wave function is the generating function for the $P_n (E)$,…
The finite element method (FEM) is a cornerstone numerical technique for solving partial differential equations (PDEs). Here, we present $\textbf{Qu-FEM}$, a fault-tolerant era quantum algorithm for the finite element method. In contrast to…
Solutions to many important partial differential equations satisfy bounds constraints, but approximations computed by finite element or finite difference methods typically fail to respect the same conditions. Chang and Nakshatrala enforce…
Quantified constraints and Quantified Boolean Formulae are typically much more difficult to reason with than classical constraints, because quantifier alternation makes the usual notion of solution inappropriate. As a consequence, basic…
Uncertainty quantification seeks to provide a quantitative means to understand complex systems that are impacted by parametric uncertainty. The polynomial chaos method is a computational approach to solve stochastic partial differential…
We use the polynomial partitioning method of Guth to prove weighted Fourier restriction estimates in $\Bbb R^3$ with exponents $p$ that range between $3$ and $3.25$, depending on the weight. As a corollary to our main theorem, we obtain new…
This paper explores in some detail a recent proposal (the Rieffel induction/refined algebraic quantization scheme) for the quantization of constrained gauge systems. Below, the focus is on systems with a single constraint and, in this…
We study the treatment of the constraints in stochastic quantization method. We improve the treatment of the stochastic consistency condition proposed by Namiki et al. by suitably taking account of the Ito calculus. Then we obtain an…
We realize an extended version of the trigonometric Cherednik algebra as affine Dunkl operators involving Heaviside functions. We use the quadratic Casimir element of the extended trigonometric Cherednik algebra to define an explicit…
Efficient characteristic set methods for computing solutions of polynomial equation systems in a finite field are proposed. The concept of proper triangular sets is introduced and an explicit formula for the number of solutions of a proper…
In the article we discuss the notion of the generalized invariant manifold introduced in our previous study. In the literature the method of the differential constraints is well known as a tool for constructing particular solutions for the…
We present a quantum algorithmic routine that extends the realm of Grover-based heuristics for tackling combinatorial optimization problems with arbitrary efficiently computable objective and constraint functions. Building on previously…
By introducing the generalized master function of order up to four together with corresponding weight function, we have obtained all quasi-exactly solvable second order differential equations. It is shown that these differntial equations…
In an innovative inverse-problem construction the measured, experimental energies $E_1$, $E_2$, ...$E_N$ of a quantum bound-state system are assumed fitted by an N-plet of zeros of a classical orthogonal polynomial $f_N(E)$. We reconstruct…
We present a general procedure for determining possible (nonuniform) magnetic fields such that the Pauli equation becomes quasi-exactly solvable (QES) with an underlying $sl(2)$ symmetry. This procedure makes full use of the close…