Related papers: Solving parametric systems of polynomial equations…
We present an intuitive and scalable algorithm for the diagonalization of complex symmetric matrices, which arise from the projection of pseudo--Hermitian and complex scaled Hamiltonians onto a suitable basis set of "trial" states. The…
In this paper, we give an algorithm for finding general rational solutions of a given first-order ODE with parametric coefficients that occur rationally. We present an analysis, complete modulo Hilbert's irreducibility problem, of the…
Solving nonlinear SMT problems over real numbers has wide applications in robotics and AI. While significant progress is made in solving quantifier-free SMT formulas in the domain, quantified formulas have been much less investigated. We…
In this paper, we study a generalized finite element method for solving second-order elliptic partial differential equations with rough coefficients. The method uses local approximation spaces computed by solving eigenvalue problems on…
This paper presents a novel approach to automatically solving arithmetic word problems. This is the first algorithmic approach that can handle arithmetic problems with multiple steps and operations, without depending on additional…
We present a general class of machine learning algorithms called parametric matrix models. In contrast with most existing machine learning models that imitate the biology of neurons, parametric matrix models use matrix equations that…
We describe a method for solving linear systems over the localization of a commutative ring $R$ at a multiplicatively closed subset $S$ that works under the following hypotheses: the ring $R$ is coherent, i.e., we can compute finite…
We introduce a new family of quasi-exactly solvable generalized isotonic oscillators which are based on the pseudo-Hermite exceptional orthogonal polynomials. We obtain exact closed-form expressions for the energies and wavefunctions as…
We give a new complexity bound for calculating the complex dimension of an algebraic set. Our algorithm is completely deterministic and approaches the best recent randomized complexity bounds. We also present some new, significantly sharper…
Let $A(x)=A\_0+x\_1A\_1+...+x\_nA\_n$ be a linear matrix, or pencil, generated by given symmetric matrices $A\_0,A\_1,...,A\_n$ of size $m$ with rational entries. The set of real vectors x such that the pencil is positive semidefinite is a…
This paper is a survey on universal algorithms for solving the matrix Bellman equations over semirings and especially tropical and idempotent semirings. However, original algorithms are also presented. Some applications and software…
The field of numerical algebraic geometry consists of algorithms for numerically solving systems of polynomial equations. When the system is exact, such as having rational coefficients, the solution set is well-defined. However, for a…
This paper presents a program analysis method that generates program summaries involving polynomial arithmetic. Our approach builds on prior techniques that use solvable polynomial maps for summarizing loops. These techniques are able to…
We propose a Hermite spectral method for the inelastic Boltzmann equation, which makes two-dimensional periodic problem computation affordable by the hardware nowadays. The new algorithm is based on a Hermite expansion, where the expansion…
Sparse polynomial approximation has become indispensable for approximating smooth, high- or infinite-dimensional functions from limited samples. This is a key task in computational science and engineering, e.g., surrogate modelling in…
Multivariable generalizations of the classical Hermite, Laguerre and Jacobi polynomials occur as the polynomial part of the eigenfunctions of certain Schr\"odinger operators for Calogero-Sutherland-type quantum systems. For the generalized…
We review our recent results on pseudo-hermitian random matrix theory which were hitherto presented in various conferences and talks. (Detailed accounts of our work will appear soon in separate publications.) Following an introduction of…
We here specialize the standard matrix-valued polynomial interpolation to the case where on the imaginary axis the interpolating polynomials admit various symmetries: Positive semidefinite, Skew-Hermitian, $J$-Hermitian, Hamiltonian and…
We consider the uniform approximation of the smallest eigenvalue of a large parameter-dependent Hermitian matrix by that of a smaller counterpart obtained through projections. The projection subspaces are constructed iteratively by means of…
The authors proposed a general way to find particular solutions for overdetermined systems of PDEs previously, where the number of equations is greater than the number of unknown functions. In this paper, we propose an algorithm for finding…