Displaying similar documents to “The k-Fibonacci matrix and the Pascal matrix”

Explicit formulas for the constituent matrices. Application to the matrix functions

R. Ben Taher, M. Rachidi (2015)

Special Matrices

Similarity:

We present a constructive procedure for establishing explicit formulas of the constituents matrices. Our approach is based on the tools and techniques from the theory of generalized Fibonacci sequences. Some connections with other results are supplied. Furthermore,we manage to provide tractable expressions for the matrix functions, and for illustration purposes we establish compact formulas for both the matrix logarithm and the matrix pth root. Some examples are also provided. ...

Determinants and inverses of circulant matrices with complex Fibonacci numbers

Ercan Altınışık, N. Feyza Yalçın, Şerife Büyükköse (2015)

Special Matrices

Similarity:

Let ℱn = circ (︀F*1 , F*2, . . . , F*n︀ be the n×n circulant matrix associated with complex Fibonacci numbers F*1, F*2, . . . , F*n. In the present paper we calculate the determinant of ℱn in terms of complex Fibonacci numbers. Furthermore, we show that ℱn is invertible and obtain the entries of the inverse of ℱn in terms of complex Fibonacci numbers.

On a nonnegative irreducible matrix that is similar to a positive matrix

Raphael Loewy (2012)

Open Mathematics

Similarity:

Let A be an n×n irreducible nonnegative (elementwise) matrix. Borobia and Moro raised the following question: Suppose that every diagonal of A contains a positive entry. Is A similar to a positive matrix? We give an affirmative answer in the case n = 4.