Related papers: A Generalized Closed Form For Triangular Matrix Po…
This note presents a simple, universal closed form for the powers of any square matrix. A diligent search of the internet gave no indication that the form is known.
We derive a closed-form expression for the kth power of semicirculant matrices by using the determinant of certain matrices. As an application, a closed-form expression for the kth power of r-circulant matrices is also povided.
This contribution is motivated by old and recent works on matrix powers and their applications on combinatorial sequences. We give in this paper the $s$-th powers and the inverses for special upper triangular matrices and the $s$-th powers…
In this work, new closed-form formulas for the matrix exponential are provided. Our method is direct and elementary, it gives tractable and manageable formulas not current in the extensive literature on this essential subject. Moreover,…
In this paper, we obtain a general expression for the entries of the r. (r is integer) power of a certain n-square complex tridiagonal matrix. In addition, we get the complex factorizations of Fibonacci polynomials, Fibonacci and Pell…
Triangular numbers that are multiple of other triangular numbers are investigated. It is known that for any positive non-square integer multiplier, there is an infinity of multiples of triangular numbers which are triangular numbers. If the…
In this paper, we derive the general expression of the r-th power for some n-square complex tridiagonal matrices. Additionally, we obtain the complex factorizations of Fibonacci polynomials.
Our goal in this work is to found a closed form for rational generat- ing functions, these generate a various families of polynomials and generalized polynomials, in order to get the general recursive formula satisfied by these polynomials.
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…
Permutations can be represented as linear combinations of natural numbers with different powers. In this paper, its coefficient matrix and inverse matrix is derived, and the results show the coefficient matrix is a lower triangular matrix…
In this paper, we provide a general framework for obtaining the formula for nested summation of powers of natural numbers. We define a special triangular array of numbers from which we can obtain the formula for nested summation of natural…
In this paper, we give quadratic approximation of generalized Tribonacci sequence $\{V_{n}\}_{n\geq0}$ defined by Eq. (\ref{eq:7}) and use this result to give the matrix form of the $n$-th power of a companion matrix of…
The hierarchical quark masses and small mixing angles are shown to lead to a simple triangular form for the U- and D-type quark mass matrices. In the basis where one of the matrices is diagonal, each matrix element of the other is, to a…
We present a closed-form solution for n-th term of a general three-term recurrence relation with arbitrary given n-dependent coefficients. The derivation and corresponding proof are based on two approaches, which we develop and describe in…
A generating function for the Wigner's $D$-matrix elements of $SU(3)$ is derived. From this an explicit expression for the individual matrix elements is obtained in a closed form.
This paper presents a method to analyze the powers of a given trilinear form (a special kind of algebraic constructions also called a tensor) and obtain upper bounds on the asymptotic complexity of matrix multiplication. Compared with…
In this paper, closed formulas for the eigenvectors of a particular class of matrices generated by generalized permutation matrices, named generalized circulant matrices, are presented.
A new class of structured matrices is presented and a closed form formula for their determinant is established. This formula has strong connections with the one for Vandermonde matrices.
We have generalised the properties with the tensor product, of one 4x4 matrix which is a permutation matrix, and we call a tensor commutation matrix. Tensor commutation matrices can be constructed with or without calculus. A formula allows…
Consider a rectangular matrix describing some type of communication or transportation between a set of origins and a set of destinations, or a classification of objects by two attributes. The problem is to infer the entries of the matrix…