Results 31 to 40 of about 95 (94)

On the Yang-Baxter-like matrix equation for rank-two matrices

open access: yesOpen 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

Infants of mothers with early remitted clinical depression and mothers with no postpartum depression: Adaptive functioning in the second year of life

open access: yesInfant Mental Health Journal: Infancy and Early Childhood, Volume 45, Issue 4, Page 397-410, July 2024.
Abstract Whether and how remitted clinical depression in postpartum motherhood contributes to poor infant adaptive functioning is inconclusive. The present longitudinal study examines adaptive functioning in infants of mothers diagnosed as clinically depressed at 5 months but remitted at 15 and 24 months. Fifty‐five U. S.
Marc H. Bornstein   +2 more
wiley   +1 more source

A note of equivalence classes of matrices over a finite field

open access: yesInternational 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

A preconditioned AOR iterative scheme for systems of linear equations with L-matrics

open access: yesOpen 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

Self-similarity on 4d cubic lattice [PDF]

open access: yesOpen Communications in Nonlinear Mathematical Physics
A phenomenon of "algebraic self-similarity" on 3d cubic lattice, providing what can be called an algebraic analogue of Kadanoff--Wilson theory, is shown to possess a 4d version as well. Namely, if there is a $4\times 4$ matrix $A$ whose entries
Igor G. Korepanov
doaj   +1 more source

Permutation matrices and matrix equivalence over a finite field

open access: yesInternational 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

On relationships between two linear subspaces and two orthogonal projectors

open access: yesSpecial 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

Equivalence classes of matrices over a finite field

open access: yesInternational 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

Cayley-Hamilton theorem for matrices over an arbitrary ring [PDF]

open access: yes, 2006
2000 Mathematics Subject Classification: 15A15, 15A24, 15A33, 16S50.For an n×n matrix A over an arbitrary unitary ring R, we obtain the following Cayley-Hamilton identity with right matrix coefficients: (λ0I+C0)+A(λ1I+C1)+… +An-1(λn-1I+Cn-1)+An (n!I+Cn) =
Szigeti, Jenő
core  

and [PDF]

open access: yes, 2008
A sign pattern matrix is a matrix whose entries are from the set {+, −, 0}. The minimum rank of a sign pattern matrix A is the minimum of the ranks of the real matrices whose entries have signs equal to the corresponding entries of A.
Marina Arav   +4 more
core  

Home - About - Disclaimer - Privacy