The solution of the matrix equations AXB−CXD=E AND (YA−DZ,YC−BZ)=(E,F)
✍ Scribed by King-wah Eric Chu
- Publisher
- Elsevier Science
- Year
- 1987
- Tongue
- English
- Weight
- 661 KB
- Volume
- 93
- Category
- Article
- ISSN
- 0024-3795
No coin nor oath required. For personal study only.
✦ Synopsis
The conditions for the existence of a unique solution of the matrix equation AXB -CXD = E are proved to be that (i) the pencils A -XC and D -XB are regular, and (ii) the spectra of the pencils have an empty intersection. A numerical algorithm for solving the equation is proposed. The possibility of a least-squares-type solution is briefly discussed. The set of equations (YA -DZ, YC -BZ) = (E, F) is proved to be equivalent to the aforementioned equation, and its solution is also investigated. A numerical algorithm is proposed.
📜 SIMILAR VOLUMES
## Communicated by Y. Xu An n×n real matrix P is said to be a symmetric orthogonal matrix if P = P -1 = P T . An n×n real matrix Y is called a generalized centro-symmetric with respect to P, if Y = PYP. It is obvious that every matrix is also a generalized centrosymmetric matrix with respect to I.
The solution of Maxwell's equations in a non-convex polyhedral domain is less regular than in a smooth or convex polyhedral domain. In this paper we show that this solution can be decomposed into the orthogonal sum of a singular part and a regular part, and we give a characterization of the singular
## Abstract This work compares a numerical and analytical adjoint equation method with respect to boundary condition treatments applied to the quasi‐1D Euler equations. The effect of strong and weak boundary conditions and the effect of flux evaluators on the numerical adjoint solution near the bou