Results 31 to 40 of about 524 (74)
A note of equivalence classes of matrices over a finite field
International Journal of Mathematics and Mathematical Sciences, Volume 4, Issue 2, Page 279-287, 1981., 1981 Let Fqm×m denote the algebra of m × m matrices over the finite field Fq of q elements, and let Ω denote a group of permutations of Fq. It is well known that each ϕϵΩ can be represented uniquely by a polynomial ϕ(x)ϵFq[x] of degree less than q; thus, the group Ω naturally determines a relation ∼ on Fqm×m as follows: if A,BϵFqm×m then A ~ B if ϕ(A) = B ...
J. V. Brawley, Gary L. Mullen
wiley +1 more source
On the Yang-Baxter-like matrix equation for rank-two matrices
Open Mathematics, 2017 Let A = PQT, where P and Q are two n × 2 complex matrices of full column rank such that QTP is singular. We solve the quadratic matrix equation AXA = XAX.
Zhou Duanmei, Chen Guoliang, Ding Jiu
doaj +1 more source
On the matrix equation $XA+AX^T =0$, II: Type 0-I interactions
, 2013 The matrix equation $XA + AX^T = 0$ was recently introduced by De Ter\'an and Dopico to study the dimension of congruence orbits. They reduced the study of this equation to a number of special cases, several of which have not been explicitly solved.
Chan, Alice Zhuo-Yu +3 more
core +1 more source
Permutation matrices and matrix equivalence over a finite field
International Journal of Mathematics and Mathematical Sciences, Volume 4, Issue 3, Page 503-512, 1981., 1980 Let F = GF(q) denote the finite field of order q and Fm×n the ring of m × n matrices over F. Let 𝒫n be the set of all permutation matrices of order n over F so that 𝒫n is ismorphic to Sn. If Ω is a subgroup of 𝒫n and A, BϵFm×n then A is equivalent to B relative to Ω if there exists Pϵ𝒫n such that AP = B.
Gary L. Mullen
wiley +1 more source
A preconditioned AOR iterative scheme for systems of linear equations with L-matrics
Open Mathematics, 2019 In this paper we investigate theoretically and numerically the new preconditioned method to accelerate over-relaxation (AOR) and succesive over-relaxation (SOR) schemes, which are used to the large sparse linear systems.
Wang Hongjuan
doaj +1 more source
Equivalence classes of matrices over a finite field
International Journal of Mathematics and Mathematical Sciences, Volume 2, Issue 3, Page 487-491, 1979., 1979 Let Fq = GF(q) denote the finite field of order q and F(m, q) the ring of m × m matrices over Fq. Let Ω be a group of permutations of Fq. If A, BϵF(m, q) then A is equivalent to B relative to Ω if there exists ϕϵΩ such that ϕ(A) = B where ϕ(A) is computed by substitution. Formulas are given for the number of equivalence classes of a given order and for
Gary L. Mullen
wiley +1 more source
On relationships between two linear subspaces and two orthogonal projectors
Special Matrices, 2019 Sum and intersection of linear subspaces in a vector space over a field are fundamental operations in linear algebra. The purpose of this survey paper is to give a comprehensive approach to the sums and intersections of two linear subspaces and their ...
Tian Yongge
doaj +1 more source
, 2008 Results on matrix canonical forms are used to give a complete description of the higher rank numerical range of matrices arising from the study of quantum error correction.
Li, Chi-Kwong, Sze, Nung-Sing
core +1 more source
Twisted immanant and matrices with anticommuting entries
, 2015 This article gives a new matrix function named "twisted immanant," which can be regarded as an analogue of the immanant. This is defined for each self-conjugate partition through a "twisted" analogue of the irreducible character of the symmetric group ...
Itoh, Minoru
core +1 more source
, 1993 International Journal of Mathematics and Mathematical Sciences, Volume 16, Issue 2, Page 301-309, 1993.
Fortunata Liguori +2 more
wiley +1 more source