Method to solve a coupled system of matrix equation

duc
Messages
9
Reaction score
0
Hello everyone,

I'm struggling with a coupled of matrix equations of the general form:

AX + CY = cX
BY + DX = cY

where A, B, C and D are hermitics square matrices. X, Y and c are the eigenvector and eigenvalue to be found. I'm looking for a method or an algorithm to solve this system by using Fortran. Could you suggest a reference or paper which treats this kind of equation ?

Thanks a lot!
duc
 
Physics news on Phys.org
Last edited by a moderator:
DEvens said:
Hello duc. Welcome to the forum.

Google is your friend.
https://www.google.ca/search?site=&source=hp&q=gaussian+elimination

https://en.wikipedia.org/wiki/Eigendecomposition_of_a_matrix
https://en.wikipedia.org/wiki/Gaussian_elimination

If you need something more specific you could check out one of the _Numerical Recipes_ books. I think this is the most recent edition.

http://www.amazon.com/dp/0521880688/?tag=pfamazon01-20

Hi DEvens,

Thanks for your reply.
Maybe i should be more specific. The system of matrix equations I've mentioned is not linear system of equations that can be solved by using matrix technique. A, B, C and D here are not number but square matrices of dimension N x N (where N is integer and typically of order 1000). And X, Y and c are respectively the column vectors of N elements and the unknown value which have to be found.

Physically, X and Y are two components of a spinor associated to a spin-1/2 particle. c is the energy associated with this spinor. When studying a physical system whose Hamiltonian contains an interaction which involves spin operators in an intricate manner, I've been led to the above kind of equations.

In other word, instead of the usual eigenvalue problem: A X = e X (A: matrix, X - a vector of given dimension, e - eigenvalue), the system of matrix equations above describes the eigenvalue problem for a spinor X of 2-components and A will become a matrix of 2x2 elements (and each one is an operator) in spin space. When using a discrete truncated basis in position space for example, each "element" of A will be represented by a matrix.

Hope that would make my question clearer. I'll consult the reference you've cited any way.

duc
 
Last edited by a moderator:
Oh, it's a different part of it you are having difficulty with. I sort of assumed this part was trivial.

AX + CY = cX
BY + DX = cY

Presuming X and Y are column vectors. Rearrange that as Z = {X,Y}. I'm too lazy to get into the TeX-like things here to make that line up properly. But that is a column vector with the first "n" components being the components of X, and the second "n" being the components of Y.

Then line up your matrices like so:

A C
D B

That is make a 2n x 2n matrix out of the four matrices A, C, D, and B. Call this new matrix M.

So you then have M Z = c Z. And you round up the usual suspects to solve the matrix equation.
 
  • Like
Likes duc
DEvens said:
Oh, it's a different part of it you are having difficulty with. I sort of assumed this part was trivial.

AX + CY = cX
BY + DX = cY

Presuming X and Y are column vectors. Rearrange that as Z = {X,Y}. I'm too lazy to get into the TeX-like things here to make that line up properly. But that is a column vector with the first "n" components being the components of X, and the second "n" being the components of Y.

Then line up your matrices like so:

A C
D B

That is make a 2n x 2n matrix out of the four matrices A, C, D, and B. Call this new matrix M.

So you then have M Z = c Z. And you round up the usual suspects to solve the matrix equation.

Thank you very much DEvens. I've thought of it but had some doubts and didn't go further :D. It is indeed "trivial" as you said :">. Thanks again. :)
 
##\textbf{Exercise 10}:## I came across the following solution online: Questions: 1. When the author states in "that ring (not sure if he is referring to ##R## or ##R/\mathfrak{p}##, but I am guessing the later) ##x_n x_{n+1}=0## for all odd $n$ and ##x_{n+1}## is invertible, so that ##x_n=0##" 2. How does ##x_nx_{n+1}=0## implies that ##x_{n+1}## is invertible and ##x_n=0##. I mean if the quotient ring ##R/\mathfrak{p}## is an integral domain, and ##x_{n+1}## is invertible then...
The following are taken from the two sources, 1) from this online page and the book An Introduction to Module Theory by: Ibrahim Assem, Flavio U. Coelho. In the Abelian Categories chapter in the module theory text on page 157, right after presenting IV.2.21 Definition, the authors states "Image and coimage may or may not exist, but if they do, then they are unique up to isomorphism (because so are kernels and cokernels). Also in the reference url page above, the authors present two...
When decomposing a representation ##\rho## of a finite group ##G## into irreducible representations, we can find the number of times the representation contains a particular irrep ##\rho_0## through the character inner product $$ \langle \chi, \chi_0\rangle = \frac{1}{|G|} \sum_{g\in G} \chi(g) \chi_0(g)^*$$ where ##\chi## and ##\chi_0## are the characters of ##\rho## and ##\rho_0##, respectively. Since all group elements in the same conjugacy class have the same characters, this may be...
Back
Top