Related papers: On the logarithmic energy of solutions to the poly…
We develop computational methods for approximating the solution of a linear multi-term matrix equation in low rank. We follow an alternating minimization framework, where the solution is represented as a product of two matrices, and…
We obtain an analytic solution for a three-parameter class of logarithmic potentials at zero energy. The potential terms are products of the inverse square and the inverse log to powers 2, 1 and 0. The configuration space is the…
The non-relativistic energy levels of ortho-positronium are calculated in the quadrupole and octupole approximations for the interaction potential. For this purpose, the RST eigenvalue problem of angular momentum is illustratively solved…
We introduce novel polynomial deformations of the Lie algebra $sl(2)$. We construct their finite-dimensional irreducible representations and the corresponding differential operator realizations. We apply our results to a class of spin…
The aim of power management policies is to reduce the amount of energy consumed by computer systems while maintaining satisfactory level of performance. One common method for saving energy is to simply suspend the system during the idle…
The affine inverse eigenvalue problem consists of identifying a real symmetric matrix with a prescribed set of eigenvalues in an affine space. Due to its ubiquity in applications, various instances of the problem have been widely studied in…
In the case of polynomial potentials all solutions to 1-D Schroedinger equation are entire functions totally determined by loci of their roots and their behaviour at infinity. In this paper a description of the first of the two properties…
We give a polynomial-time algorithm for computing upper bounds on some of the smaller energy eigenvalues in a spin-1/2 ferromagnetic Heisenberg model with any graph $G$ for the underlying interactions. An important ingredient is the…
We consider $m \times s$ matrices (with $m\geq s$) in a real affine subspace of dimension $n$. The problem of finding elements of low rank in such spaces finds many applications in information and systems theory, where low rank is…
Accurate computation of multiple eigenvalues of quantum Hamiltonians is essential in quantum chemistry, materials science, and molecular spectroscopy. Estimating excited-state energies is challenging for classical algorithms due to…
We study the approximation of the smallest eigenvalue of a Sturm-Liouville problem in the classical and quantum settings. We consider a univariate Sturm-Liouville eigenvalue problem with a nonnegative function $q$ from the class…
It is well known that a family of $n\times n$ commuting matrices can be simultaneously triangularized by a unitary similarity transformation. The diagonal entries of the triangular matrices define the $n$ joint eigenvalues of the family. In…
Motivated by a problem in learning theory, we are led to study the dominant eigenvalue of a class of random matrices. This turns out to be related to the roots of the derivative of random polynomials (generated by picking their roots…
We propose a general algorithm to enumerate all solutions of a zero-dimensional polynomial system with respect to a given cost function. The algorithm is developed and is used to study a polynomial system obtained by discretizing the steady…
The Bethe-Salpeter eigenvalue problem is a structured eigenvalue problem arising in many-body physics. In practice, a few of the smallest positive eigenvalues and the corresponding eigenvectors need to be computed. In principle, the LOBPCG…
A powerful method for calculating the eigenvalues of a Hamiltonian operator consists of converting the energy eigenvalue equation into a matrix equation by means of an appropriate basis set of functions. The convergence of the method can be…
We study skew-orthogonal polynomials with respect to the weight function $\exp[-2V(x)]$, with $V(x)=\sum_{K=1}^{2d}(u_{K}/{K})x^{K}$, $u_{2d} > 0$, $d > 0$. A finite subsequence of such skew-orthogonal polynomials arising in the study of…
We give a pattern-avoidance characterization of $w \in S_n$ such that the Schubert polynomial $\mathfrak{S}_w$ is a standard elementary monomial. This characterization tells us which quantum Schubert polynomials are easiest to compute. We…
The main purpose of this paper is to obtain an explicit expression of a family of matrix valued orthogonal polynomials {P_n}_n, with respect to a weight W, that are eigenfunctions of a second order differential operator D. The weight W and…
Let $\om $ be a bounded domain in an $n$-dimensional Euclidean space $\Bbb R^n$. We study eigenvalues of an eigenvalue problem of a system of elliptic equations: $$ \{\aligned &\Delta {\mathbf u}+ \alpha{\rm grad}(\text{div}{\mathbf…