Related papers: Fast Symbolic Integer-Linear Spectra
The paper develops a symbolic calculus for Fourier integral operators associated with canonical transformations.
Analytical expressions for the eigenvalues of certain inhomogeneous XY spin chains are computed. These models are rewritten in terms of free-fermion models using a well-known Jordan-Wigner transformation. Finding the spectrum of such models…
In this note we propose an approach for a fast analytic determination of all possible eigenstates of rational GL(N|M) integrable spin chains of given not too large length, in terms of Baxter Q-functions. We observe that all exceptional…
A simple and efficient variational method is introduced to accelerate the convergence of the eigenenergy computations for a Hamiltonian H with singular potentials. Closed-form analytic expressions in N dimensions are obtained for the matrix…
In this paper we present an elementary theory about the existence of eigenvalues for fully nonlinear radially symmetric 1-homogeneous operators. A general theory for first eigenvalues and eigenfunctions of 1-homogeneous fully nonlinear…
Symbolic has been long considered as a language of human intelligence while neural networks have advantages of robust computation and dealing with noisy data. The integration of neural-symbolic can offer better learning and reasoning while…
In this paper we explore how machine learning techniques can be applied to the discovery of efficient mathematical identities. We introduce an attribute grammar framework for representing symbolic expressions. Given a set of grammar rules…
The sum of Wishart matrices has an important role in multiuser communication employing multiantenna elements, such as multiple-input multiple-output (MIMO) multiple access channel (MAC), MIMO Relay channel, and other multiuser channels…
The numerical solution of singular eigenvalue problems is complicated by the fact that small perturbations of the coefficients may have an arbitrarily bad effect on eigenvalue accuracy. However, it has been known for a long time that such…
Accelerating the solution of linear systems of equations is critical due to their central role in numerous applications, such as numerical simulations, data analytics, and machine learning. This paper presents an analog solver circuit…
Eigensolvers involving complex moments can determine all the eigenvalues in a given region in the complex plane and the corresponding eigenvectors of a regular linear matrix pencil. The complex moment acts as a filter for extracting…
The exact parameter values of mathematical models are often uncertain or even unknown. Nevertheless, we may have access to crude information about the parameters, e.g., that some of them are nonzero. Such information can be captured by…
Matrices are the most common representations of graphs. They are also used for the representation of algebras and cluster algebras. This paper shows some properties of matrices in order to facilitate the understanding and locating…
In the present note we consider a type of matrices stemming in the context of the numerical approximation of distributed order fractional differential equations (FDEs): from one side they could look standard, since they are, real, symmetric…
Suppose we want to find the eigenvalues and eigenvectors for the linear operator L, and suppose that we have solved this problem for some other "nearby" operator K. In this paper we show how to represent the eigenvalues and eigenvectors of…
Often in mathematics it is useful to summarize a multivariate phenomenon with a single number and in fact, the determinant -- which is represented by det -- is one of the simplest cases. In fact, this number it is defined only for square…
We outline a new algorithm to solve coupled systems of differential equations in one continuous variable $x$ (resp. coupled difference equations in one discrete variable $N$) depending on a small parameter $\epsilon$: given such a system…
We consider the eigenvalue problem for the case where the input matrix is symmetric and its entries perturb in some given intervals. We present a characterization of some of the exact boundary points, which allows us to introduce an inner…
An efficient algorithm for computing eigenvectors of a matrix of integers by exact computation is proposed. The components of calculated eigenvectors are expressed as polynomials in the eigenvalue to which the eigenvector is associated, as…
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…