Abstract
We address the practical issue that popular computation platforms like Matlab^{copyright } are unable to perform the Jordan normal (canonical) form J and the associated transform matrix P on a high-dimension matrix. Given the knowledge of the eigenvalues and eigenvectors of n-square matrix A obtained on these platforms, we present an efficient algorithm of Jordan transform with detailed computation steps. The efficiency is demonstrated by comparing the simulation results of 11 examples with varying orders of n to that computed by the symbolic-based and capacity-limited routine [P, J] = {textsf {jordan}}(A) in Matlab^{copyright }. Applications in stochastic dynamics are addressed.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have