Related papers: The LU-decomposition of Lehmer's tridiagonal matri…
A certain determinant is evaluated by guessing and computing the LU-decomposition.
Three combinatorial matrices are considered and their LU-decompositions were found. This is typically done by (creative) guessing, and necessary proofs are more or less routine calculations.
Deterministic recursive algorithms for the computation of matrix triangular decompositions with permutations like LU and Bruhat decomposition are presented for the case of commutative domains. This decomposition can be considered as a…
Following Benjamin et al., a matrix with entries being sums of two neighbouring Catalan numbers is considered. Its LU-decomposition is given, by guessing the results and later prove it by computer algebra, with lots of human help.…
An identity is proven that evaluates the determinant of a block tridiagonal matrix with (or without) corners as the determinant of the associated transfer matrix (or a submatrix of it).
A uniqueness theorem for an LU decomposition of a totally nonnegative matrix is obtained.
In this paper we obtain the LU-decomposition of a noncommutative linear system of equations that, in the rank one case, characterizes the image of the Lepowsky homomorphism $U(\lieg)^{K}\to U(\liek)^{M}\otimes U(\liea)$. This…
We study the combinatorial description of the LDU decomposition of totally positive matrices. We give a description of the lower triangular L, the diagonal D, and the upper triangular U matrices of the LDU decomposition of totally positive…
The hyperdeterminant of a polynomial (interpreted as a symmetric tensor) factors into several irreducible factors with multiplicities. Using geometric techniques these factors are identified along with their degrees and their…
An arbitrary Mueller matrix can be decomposed into a sum of up to four deterministic Mueller-Jones matrices, with strengths given by the eigenvalues of an associated Hermitian matrix. A geometrical representation of the eigenvalues in terms…
Through a simple procedure based on the Lu-Chipman decomposition [S-Y. Lu and R. C. Chipman, J. Opt. Soc. Am A 13, 1106 (1996)] any depolarizing Mueller matrix can be transformed into a reduced form which accumulates the depolarization and…
A novel invariant decomposition of diagonalizable $n \times n$ matrices into $n$ commuting matrices is presented. This decomposition is subsequently used to split the fundamental representation of $\mathfrak{su}(3)$ Lie algebra elements…
The canonical decomposition of a Lorentz algebra element into a sum of orthogonal simple (decomposable) Lorentz bivectors is discussed, as well as the decomposition of a proper orthochronous Lorentz transformation into a product of…
With assumption that an optical element is described by a Mueller matrix of the Lorentzian type, a method to find a 3-dimensional complex vector parameter for a corresponding Mueller matrix from results of four specially chosen polarization…
Let $K$ denote a field and let $V$ denote a vector space over $K$ with finite positive dimension. We consider an ordered pair of linear transformations $A:V\to V$ and $A^*:V\to V$ that satisfy conditions (i), (ii) below. (i) There exists a…
This paper uses matrix transformations to provide the Autoone-Takagi decomposition of dual complex symmetric matrices and extends it to dual quaternion $\eta$-Hermitian matrices. The LU decomposition of dual matrices is given using the…
In this paper, a new triangular decomposition algorithm is proposed for ordinary differential polynomial systems, which has triple exponential computational complexity. The key idea is to eliminate one algebraic variable from a set of…
We prove several evaluations of determinants of matrices, the entries of which are given by the recurrence $a_{i,j}=a_{i-1,j}+a_{i,j-1}$, or variations thereof. These evaluations were either conjectured or extend conjectures by Roland…
The general decomposition theory of exponential operators is briefly reviewed. A general scheme to construct independent determining equations for the relevant decomposition parameters is proposed using Lyndon words. Explicit formulas of…
In this paper, the author present reliable symbolic algorithms for solving a general bordered tridiagonal linear system. The first algorithm is based on the LU decomposition of the coefficient matrix and the computational cost of it is…