Related papers: Constraint polynomial approach -- an alternative t…
Polynomial chaos expansions (PCE) are widely used for uncertainty quantification (UQ) tasks, particularly in the applied mathematics community. However, PCE has received comparatively less attention in the statistics literature, and fully…
This paper deals with the partial solution of the energy eigenvalue problem for generalized symmetric quartic oscillators. Algebraization of the problem is achieved by expressing the Schroedinger operator in terms of the generators of a…
Two new approaches to solving first-order quasilinear elliptic systems of PDEs in many dimensions are proposed. The first method is based on an analysis of multimode solutions expressible in terms of Riemann invariants, based on links…
Constrained orthogonal polynomials have been recently introduced in the study of the Hohenberg-Kohn functional to provide basis functions satisfying particle number conservation for an expansion of the particle density. More generally, we…
In this work, a polygonal Reissner-Mindlin plate element is presented. The formulation is based on a scaled boundary finite element method, where in contrast to the original semi-analytical approach, linear shape functions are introduced…
This paper is devoted to the study of general (Laurent) polynomial modifications of moment functionals on the unit circle, i.e., associated with hermitian Toeplitz matrices. We present a new approach which allows us to study polynomial…
The convergence of the so-called quadratic method for computing eigenvalue enclosures of general self-adjoint operators is examined. Explicit asymptotic bounds for convergence to isolated eigenvalues are found. These bounds turn out to…
We propose a general method for constructing quasi-exactly solvable potentials with three analytic eigenstates. These potentials can be real or complex functions but the spectrum is real. A comparison with other methods is also performed.
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…
The reduction of constraints to obtain minimal representations of sets is a very common problem in many engineering applications. While well-established methodologies exist for the case of linear constraints, the problem of how to detect…
The method of refined algebraic quantization of constrained systems which is based on modification of the inner product of the theory rather than on imposing constraints on the physical states is generalized to the case of constrained…
We consider the quark--anti-quark potential on the three sphere or the generalized cusp anomalous dimension in planar N=4 SYM. We concentrate on the vacuum potential in the near BPS limit with $L$ units of R-charge. Equivalently, we study…
Quantum systems on a one-dimensional lattice are ubiquitous in the study of models exactly-solved by Bethe Ansatz techniques. Here it is shown that including global-range interaction opens scope for Bethe Ansatz solutions that are not…
The method reducing the solution of the Schroedinger equation for several types of power potentials to the solution of the eigenvalue problem for the infinite system of algebraic equations is developed. The finite truncation of this system…
We present a method for solving the general mixed constrained convex quadratic programming problem using an active set method on the dual problem. The approach is similar to existing active set methods, but we present a new way of solving…
We propose a generalization of Grunberg's method of effective charges in which, starting with the effective charge for some dimensionless QCD observable dependent on the single energy scale $Q, R(Q)$, we introduce an infinite set of…
Polynomial convergence bounds are considered for left, right, and split preconditioned GMRES. They include the cases of Weighted and Deflated GMRES for a linear system Ax = b. In particular, the case of positive definite A is considered.…
It is shown that the Confluent Heun Equation (CHEq) reduces for certain conditions of the parameters to a particular class of Quasi-Exactly Solvable models, associated with the Lie algebra $sl (2,{\mathbb R})$. As a consequence it is…
Polynomial optimization encompasses a broad class of problems in which both the objective function and constraints are polynomial functions of the decision variables. In recent years, a substantial body of research has focused on…
A surprising 'converse to the polynomial method' of Aaronson et al. (CCC'16) shows that any bounded quadratic polynomial can be computed exactly in expectation by a 1-query algorithm up to a universal multiplicative factor related to the…