2015
DOI: 10.1016/j.amc.2015.05.022
|View full text |Cite
|
Sign up to set email alerts
|

On computing of positive integer powers for r-circulant matrices

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
3
2

Citation Types

0
6
0

Year Published

2018
2018
2021
2021

Publication Types

Select...
5

Relationship

0
5

Authors

Journals

citations
Cited by 5 publications
(6 citation statements)
references
References 17 publications
0
6
0
Order By: Relevance
“…Throughout this section, α and β are the roots of the equation x 2 − x − 1 = 0. First, we shall determine the eigenvalues of (12). Before that, let us recall that ψ is any n th root of a nonzero complex number k and ω is any primitive n th root of unity.…”
Section: Resultsmentioning
confidence: 99%
See 2 more Smart Citations
“…Throughout this section, α and β are the roots of the equation x 2 − x − 1 = 0. First, we shall determine the eigenvalues of (12). Before that, let us recall that ψ is any n th root of a nonzero complex number k and ω is any primitive n th root of unity.…”
Section: Resultsmentioning
confidence: 99%
“…Theorem 2.2. Let L be the matrix as in (12). The eigenvalues of L are given by the following formulae:…”
Section: Resultsmentioning
confidence: 99%
See 1 more Smart Citation
“…The powers of matrices are thus of considerable importance. Computing the integer powers of circulant matrices depending on Chebyshev polynomials recently has been a very attractive problem [6]- [13]. For example, Rimas obtained a general expression for the entries of the r th power (r ∈ N) of the n × n real symmetric circulant circ n (0, 1, 0, .…”
Section: Introductionmentioning
confidence: 99%
“…Necessary and sufficient conditions for a complex square matrix to be a k-circulant matrix were presented by R. E. Cline, R. J. Plemmons and G. Worm in the paper [5] (see Lemmas 2 and 3 in [5]). In the paper [8], the authors showed how C q can be obtained, where C is a matrix of the form (1.1) and q is a positive integer greater than 1.…”
Section: Introductionmentioning
confidence: 99%