Related papers: Algorithms for Recursive Block Matrices
A new generalized matrix inverse is derived which is consistent with respect to arbitrary nonsingular diagonal transformations, e.g., it preserves units associated with variables under state space transformations, thus providing a general…
In this paper, we introduce an algebra structure denoted by InvDer algebra whose which we twist an algebra thanks to an invertible derivation, where its inverse is also a derivation. We define InvDer Lie algebras, InvDer associated…
The reciprocal Pascal matrix has entries $\binom{i+j}{j}^{-1}$. Explicit formullae for its LU-decomposition, the LU-decomposition of its inverse, and some related matrices are obtained. For all results, $q$-analogues are also presented.
A novel factorization for the sum of two single-pair matrices is established as product of lower-triangular, tridiagonal, and upper-triangular matrices, leading to semi-closed-form formulas for tridiagonal matrix inversion. Subsequent…
In this note we develop a coalgebraic approach to the study of solutions of linear difference equations over modules and rings. Some known results about linearly recursive sequences over base fields are generalized to linearly (bi)recursive…
We take matrix decompositions that are usually applied to matrices over the real numbers or complex numbers, and extend them to matrices over an algebra called the double numbers. In doing so, we unify some matrix decompositions: For…
We present the first deterministic, finite-step algorithm for exact tensor ring (TR) decomposition, addressing an open question about the existence of such procedures. Our method leverages blockwise simultaneous diagonalization to recover…
The present text surveys some relevant situations and results where basic Module Theory interacts with computational aspects of operator algebras. We tried to keep a balance between constructive and algebraic aspects.
A method is presented in which matrix elements for some processes are calculated recursively. This recursive calculational technique is based on the method of basis spinors.
A novel algebra underlying integrable systems is shown to generate and unify a large class of quantum integrable models with given $R$-matrix, through reductions of an ancestor Lax operator and its different realizations. Along with known…
Using three different approaches, we analyze the complexity of various birational maps constructed from simple operations (inversions) on square matrices of arbitrary size. The first approach consists in the study of the images of lines,…
We study totally acyclic complexes of projective modules over triangular matrix rings and then use it to classify Gorenstein projective modules over such rings. We also use this classification to obtain some information concerning…
A generalized inversion of block T+H matrix is obtained for the first time. In a particular case when T+H matrix is invertible, the method allows to obtain its inverse matrix without an additional condition of invertibility of the…
To study orthogonal arrays and signed orthogonal arrays, Ray-Chaudhuri and Singhi (1988 and 1994) considered some module spaces. Here, using a linear algebraic approach we define an inclusion matrix and find its rank. In the special case of…
In this paper, we first present an explicit expression for the inverse\emph{} of a type of matrices. As special applications, the inverse of some matrices arising from implicit time integration techniques, such as the well-known implicit…
We provide a simple way to add, multiply, invert, and take traces and norms of algebraic integers of a number field using integral matrices. With formulas for the integral bases of the ring of integers of at least a significant proportion…
We generalize several important results from the perturbation theory of linear operators to the setting of semisimple orthogonal symmetric Lie algebras. These Lie algebras provide a unifying framework for various notions of matrix…
We describe a recursive algorithm that decomposes an algebraic set into locally closed equidimensional sets, i.e. sets which each have irreducible components of the same dimension. At the core of this algorithm, we combine ideas from the…
Integer data sets frequently appear in many applications in sciences and technology. To analyze these, integer low rank approximation has received much attention due to its capacity of representing the results in integers preserving the…
We present an efficient algorithm for the application of sequences of planar rotations to a matrix. Applying such sequences efficiently is important in many numerical linear algebra algorithms for eigenvalues. Our algorithm is novel in…