Results 11 to 20 of about 419,229 (311)

Algebraic Characterizations of Relationships between Different Linear Matrix Functions

open access: yesMathematics, 2023
Let f(X1,X2,…,Xk) be a matrix function over the field of complex numbers, where X1,X2,…,Xk are a family of matrices with variable entries. The purpose of this paper is to propose and investigate the relationships between certain linear matrix functions ...
Yongge Tian, Ruixia Yuan
doaj   +1 more source

On Linear Matrix Equations [PDF]

open access: yesCanadian Mathematical Bulletin, 1980
AbstractSome results from the theory of minimization of vector quadratic forms (subjected to linear restrictions) are used to obtain particular solutions to the usual types of linear matrix equations. An answer to a question raised by Greville [1] is supplied.
Scobey, P., Kabe, D. G.
openaire   +1 more source

Constrained Matrix Sylvester Equations [PDF]

open access: yesSIAM Journal on Matrix Analysis and Applications, 1992
Etant données les matrices \(A(n\times n)\), \(B(n\times p)\), \(C(m\times n)\), \(F((n-m)\times (n-u))\), le problème est de déterminer les matrices \(L((n-m)\times m)\) et \(T((u-m)\times n)\) telles que \(TA-FT=LC\) et \(TB=0\). Les A. établissent des conditions d'existence des solutions ainsi qu'un algorithme de calcul.
Jewel B. Barlow   +2 more
openaire   +1 more source

Equivalent resistance of irregular 3 × n Hammock resistor network

open access: yesNantong Daxue xuebao. Ziran kexue ban, 2022
The equivalent resistance of a kind of irregular 3 × n Hammock resistor network is studied by the RT-I theory, in which the third order matrix equation and the third order boundary condition equation are established by Kirchhoff′s law and the branch ...
TAN Zhizhong
doaj   +1 more source

A new approximate inverse preconditioner based on the Vaidya’s maximum spanning tree for matrix equation AXB = C [PDF]

open access: yesIranian Journal of Numerical Analysis and Optimization, 2019
We propose a new preconditioned global conjugate gradient (PGL-CG) method for the solution of matrix equation AXB = C, where A and B are sparse Stieltjes matrices. The preconditioner is based on the support graph preconditioners.
K. Rezaei, F. Rahbarnia, F. Toutounian
doaj   +1 more source

Minimal Rank Properties of Outer Inverses with Prescribed Range and Null Space

open access: yesMathematics, 2023
The purpose of this paper is to investigate solvability of systems of constrained matrix equations in the form of constrained minimization problems.
Dijana Mosić   +2 more
doaj   +1 more source

A Binomial-like Matrix Equation [PDF]

open access: yesThe American Mathematical Monthly, 2012
We show that a pair of matrices satisfying a certain algebraic identity, reminiscent of the binomial theorem, must have the same characteristic polynomial. This is a generalization of Problem 4 (11th grade) from the Romanian National Mathematical Olympiad 2011.
Bostan, Alin, Combot, Thierry
openaire   +2 more sources

On the Convergence of the Randomized Block Kaczmarz Algorithm for Solving a Matrix Equation

open access: yesMathematics, 2023
A randomized block Kaczmarz method and a randomized extended block Kaczmarz method are proposed for solving the matrix equation AXB=C, where the matrices A and B may be full-rank or rank-deficient.
Lili Xing, Wendi Bao, Weiguo Li
doaj   +1 more source

Solvability of Matrix-Exponential Equations [PDF]

open access: yesProceedings of the 31st Annual ACM/IEEE Symposium on Logic in Computer Science, 2016
Accepted to LICS ...
Joël Ouaknine   +3 more
openaire   +4 more sources

On Relationships between a Linear Matrix Equation and Its Four Reduced Equations

open access: yesAxioms, 2022
Given the linear matrix equation AXB=C, we partition it into the form A1X11B1+A1X12B2+A2X21B1+A2X22B2=C, and then pre- and post-multiply both sides of the equation by the four orthogonal projectors generated from the coefficient matrices A1, A1, B1, and ...
Bo Jiang, Yongge Tian, Ruixia Yuan
doaj   +1 more source

Home - About - Disclaimer - Privacy