Add to ORKGA matrix S is said to be an nth root of a matrix A if Sn = A, where n is a positive integer greater than or equal to 2. If there is no such matrix for any integer n > 2, A is called a rootless matrix. After investigating the properties of these matrices, we conclude that we always find an nth root of a non-singular matrix and a diagonalizable matrix for any positive integer n. On the other hand, we find some matrix having an nth root for some positive integer n. We call it p-nilpotent matrix
We give a coherent theory of root polynomials, an algebraic tool useful for the analysis of matrix p...
AbstractA new lower bound for the Perron root for irreducible, non-negative matrices is obtained whi...
AbstractNonnegative mth roots of nonnegative 0-symmetric idempotent matrices have been characterized...
durch das w. M. Ludwig Reich) YOOD in [5] considered the problem of finding ‘‘rootless’ ’ matrices, ...
A new necessary and sufficient condition for the existence of an m-th root of a nilpotent matrix in ...
AbstractLet K be a subfield of C. We give a criterion for a nonsingular matrix A in MmK to have an n...
Thesis (Ph.D.), Department of Mathematics, Washington State UniversityEventually nonnegative matrice...
AbstractThis paper is concerned with the determination of algebraic formulae giving all the solution...
[[abstract]]By a square root of a (square) matrix A we mean a matrix B that satisfies B2 = A. The st...
In many basic linear algebra texts it is shown that various classes of square matrices (normal, posi...
The problem of finding matrix roots for a wide class of non-singular complex matrices has been solve...
In this representation, the greener the square, the larger the entry relative to the others. A power...
This article is devoted to an introduction and a new, computer-algebra-system motivated, very elemen...
AbstractAn algorithm for computing the roots of a matrix with real elements and the real part of the...
International audienceLet p be a positive integer and A be a nilpotent complex matrix. We prove that...
We give a coherent theory of root polynomials, an algebraic tool useful for the analysis of matrix p...
AbstractA new lower bound for the Perron root for irreducible, non-negative matrices is obtained whi...
AbstractNonnegative mth roots of nonnegative 0-symmetric idempotent matrices have been characterized...
durch das w. M. Ludwig Reich) YOOD in [5] considered the problem of finding ‘‘rootless’ ’ matrices, ...
A new necessary and sufficient condition for the existence of an m-th root of a nilpotent matrix in ...
AbstractLet K be a subfield of C. We give a criterion for a nonsingular matrix A in MmK to have an n...
Thesis (Ph.D.), Department of Mathematics, Washington State UniversityEventually nonnegative matrice...
AbstractThis paper is concerned with the determination of algebraic formulae giving all the solution...
[[abstract]]By a square root of a (square) matrix A we mean a matrix B that satisfies B2 = A. The st...
In many basic linear algebra texts it is shown that various classes of square matrices (normal, posi...
The problem of finding matrix roots for a wide class of non-singular complex matrices has been solve...
In this representation, the greener the square, the larger the entry relative to the others. A power...
This article is devoted to an introduction and a new, computer-algebra-system motivated, very elemen...
AbstractAn algorithm for computing the roots of a matrix with real elements and the real part of the...
International audienceLet p be a positive integer and A be a nilpotent complex matrix. We prove that...
We give a coherent theory of root polynomials, an algebraic tool useful for the analysis of matrix p...
AbstractA new lower bound for the Perron root for irreducible, non-negative matrices is obtained whi...
AbstractNonnegative mth roots of nonnegative 0-symmetric idempotent matrices have been characterized...