Related papers: Forming a symmetric, unreduced, tridiagonal matrix…
Gradient descent optimizations and backpropagation are the most common methods for training neural networks, but they are computationally expensive for real time applications, need high memory resources, and are difficult to converge for…
The partly symmetric real Ginibre ensemble consists of matrices formed as linear combinations of real symmetric and real anti-symmetric Gaussian random matrices. Such matrices typically have both real and complex eigenvalues. For a fixed…
We show that if a closed, oriented 3-manifold M is promised to be homeomorphic to a lens space L(n,k) with n and k unknown, then we can compute both n and k in polynomial time in the size of the triangulation of M. The tricky part is the…
Conditionally on the Riemann hypothesis for certain Dedekind zeta functions, we show that the characteristic polynomial of a class of random tridiagonal matrices of large dimension is irreducible, with probability exponentially close to…
The principal minors of a tridiagonal matrix satisfy two-term and three-term recurrences [1, 2]. Based on these facts, the current article presents a new efficient and reliable hybrid numerical algorithm for evaluating general n-th order…
Trigonometric polynomials are usually defined on the lattice of integers.We consider the larger class of weight and root lattices with crystallographic symmetry.This article gives a new approach to minimize trigonometric polynomials, which…
Finding the inverse of a matrix is an open problem especially when it comes to engineering problems due to their complexity and running time (cost) of matrix inversion algorithms. An optimum strategy to invert a matrix is, first, to reduce…
In this paper, we describe a new algorithm that approximates the extreme eigenvalue/eigenvector pairs of a symmetric matrix. The proposed algorithm can be viewed as an extension of the Jacobi eigenvalue method for symmetric matrices…
3-manifolds are commonly represented as triangulations, consisting of abstract tetrahedra whose triangular faces are identified in pairs. The combinatorial sparsity of a triangulation, as measured by the treewidth of its dual graph, plays a…
We describe an algorithm to compute the extremal eigenvalues and corresponding eigenvectors of a symmetric matrix by solving a sequence of Quadratic Binary Optimization problems. This algorithm is robust across many different classes of…
We develop an algebraic approach to studying the spectral properties of the stationary Schr\"odinger equation in one dimension based on its high order conditional symmetries. This approach makes it possible to obtain in explicit form…
In this paper we characterize the nonnegative irreducible tridiagonal matrices and their permutations, using certain entries in their primitive idempotents. Our main result is summarized as follows. Let $d$ denote a nonnegative integer. Let…
An algorithm is presented for generating successive approximations to trigonometric functions of sums of non-commuting matrices. The resulting expressions involve nested commutators of the respective matrices. The procedure is shown to…
In this research paper, structured bi-matrix variate, matrix quadratic equations are considered. Some lemmas related to determining the eigenvalues of unknown matrices are proved. Also, a method of determining the diagonalizabe unknown…
In light of recently proposed quantum algorithms that incorporate symmetries in the hope of quantum advantage, we show that with symmetries that are restrictive enough, classical algorithms can efficiently emulate their quantum counterparts…
We propose a simple technique that, if combined with algorithms for computing functions of triangular matrices, can make them more efficient. Basically, such a technique consists in a specific scaling similarity transformation that reduces…
An algorithm is discussed for converting a class of recursive processes to a parallel system. It is argued that this algorithm can be superior to certain methods currently found in the literature for an important subset of problems. The…
A class of three-dimensional models which satisfy supersymmetric intertwining relations with the simplest - oscillator-like - variant of shape invariance is constructed. It is proved that the models are not amenable to conventional…
Jacobi matrices are parametrized by their eigenvalues and norming constants (first coordinates of normalized eigenvectors): this coordinate system breaks down at reducible tridiagonal matrices. The set of real symmetric tridiagonal matrices…
Given a nonsingular $n \times n$ matrix of univariate polynomials over a field $\mathbb{K}$, we give fast and deterministic algorithms to compute its determinant and its Hermite normal form. Our algorithms use…