Results 31 to 40 of about 538 (78)
On the Yang-Baxter-like matrix equation for rank-two matrices
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
A Comprehensive Review of Matrix Equations in Dynamical Systems and Control Theory
Matrix equations are of foundational importance in the modeling, investigation, and control of dynamical systems. This review discusses various classes of matrix equations, their solutions, and their relevance in control theory and dynamical systems.
Chacha Stephen Chacha, Arpan Hazra
wiley +1 more source
Stable matrices, the Cayley transform, and convergent matrices
The main result is that a square matrix D is convergent () if and only if it is the Cayley transform CA = (I − A) −1(I + A) of a stable matrix A, where a stable matrix is one whose characteristic values all have negative real parts. In passing, the concept of Cayley transform is generalized, and the generalized version is shown closely related to the ...
Tyler Haynes
wiley +1 more source
A preconditioned AOR iterative scheme for systems of linear equations with L-matrics
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
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
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 relationships between two linear subspaces and two orthogonal projectors
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
Permutation matrices and matrix equivalence over a finite field
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 the matrix equation $XA+AX^T =0$, II: Type 0-I interactions
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
Equivalence classes of matrices over a finite field
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

