Related papers: Some results about the Equiangular Algorithm
We describe a general approach for computing generators for elimination ideals associated with matrix and hypermatrix spectral decomposition constraints. We derive from these generators iterative procedures for approximating the spectral…
This paper introduces an efficient algorithm for computing the general oscillatory matrix functions. These computations are crucial for solving second-order semi-linear initial value problems. The method is exploited using the scaling and…
The paper provides a coherent presentation of an operator scheme, which is used in an approach to inverse problems of mathematical physics (the boundary control method). The scheme is based on the triangular factorization of operators. It…
Low-rank matrix approximations are often used to help scale standard machine learning algorithms to large-scale problems. Recently, matrix coherence has been used to characterize the ability to extract global information from a subset of…
We study existence and computability of finite bases for ideals of polynomials over infinitely many variables. In our setting, variables come from a countable logical structure A, and embeddings from A to A act on polynomials by renaming…
Random matrices now play a role in many parts of computational mathematics. To advance these applications, it is desirable to have tools that are flexible, easy to use, and powerful. Over the last 25 years, researchers have developed a…
We present a matrix version of a known method of constructing common eigenvectors of two diagonalizable commuting matrices, thus enabling their simultaneous diagonalization. The matrices may have simple eigenvalues of multiplicity greater…
When applying eigenvalue decomposition on the quadratic term matrix in a type of linear equally constrained quadratic programming (EQP), there exists a linear mapping to project optimal solutions between the new EQP formulation where $Q$ is…
Moments of secular and inverse secular coefficients, averaged over random matrices from classical groups, are related to the enumeration of non-negative matrices with prescribed row and column sums. Similar random matrix averages are…
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…
Given a quadratic two-parameter matrix polynomial Q, we develop a systematic approach to generating a vector space of linear two-parameter matrix polynomials. We identify a set of linearizations of Q that lie in the vector space. Finally,…
Let $\Delta$ be a finite set of nonzero linear forms in several variables with coefficients in a field $\mathbf K$ of characteristic zero. Consider the $\mathbf K$-algebra $R(\Delta)$ of rational functions on V which are regular outside…
The inverse of the Vandermonde and confluent Vandermonde matrices are presented. In the case of the Vandermonde matrix, we present a decomposition in three factors, one of them a diagonal matrix. The evaluation of such inverse matrices is a…
In this study, we introduce a method for learning group (known or unknown) equivariant functions by learning the associated quadratic form $x^T A x$ corresponding to the group from the data. Certain groups, known as orthogonal groups,…
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…
Higher order data is modeled using matrices whose entries are numerical arrays of a fixed size. These arrays, called t-scalars, form a commutative ring under the convolution product. Matrices with elements in the ring of t-scalars are…
This paper consists of a few results, discovered and proved during the 2012-2013 research group at Eastern Oregon University. Inertia tables are a visual representation of the possible inertias of a given graph. The inertia of a graph…
Matrix pencils, or pairs of matrices, may be used in a variety of applications. In particular, a pair of matrices (E,A) may be interpreted as the differential equation E x' + A x = 0. Such an equation is invariant by changes of variables,…
This paper first reviews how anti-symmetric matrices in two dimensions yield imaginary eigenvalues and complex eigenvectors. It is shown how this carries on to rotations by means of the Cayley transformation. Then a real geometric…
Eigenfunctions of total angular momentum for a charged vector field interacting with a magnetic monopole are constructed and their properties studied. In general, these eigenfunctions can be obtained by applying vector operators to the…