How do you know that this is possible to do?
Some 4x4 matrices are not block diagonalizable into 2x2 blocks. For example a nilpotent matrix with a singe Jordan block. If you know for some reason that your symbolic matrix is diagonalizable into 2x2 blocks then probably there is a way to do this, but I don't think possible to write an algorithm that can decide if a symbolic matrix is block diagonalizable.
Can you give me an example of a symbolic matrix that is block diagonalizable? Unless the matrix is of a very special form it must depend heavily on assumptions about the domain of the symbolic entries.
The matrix I am trying to block diagonalise is [[Cos(theta),Sin(theta),0,mu],[-Sin(theta),Cos(theta),mu,0],[0,mu,Cos(theta),Sin(theta)],[mu,0,-Sin(theta),Cos(theta)]]. And I am trying to get rid of the mu in the off-diagonal block. I know it is possible because it is a Hamiltonian and I can always go to a basis in which the two systems decouple.
The inverse of a matrix isn't guaranteed to exists, but there is a function for it anyway.
You can use SciLab's bdiag (numeric). http://help.scilab.org/docs/5.3.2/en_...
@chicago is asking about symbolic methods, not numerical.
Asked: 2011-11-28 03:30:46 +0200
Seen: 2,736 times
Last updated: Dec 10 '11
Copyright Sage, 2010. Some rights reserved under creative commons license. Content on this site is licensed under a Creative Commons Attribution Share Alike 3.0 license.
