Skip to main content

Jordan Decomposition


Jordan Decomposition

The goal of a Jordan decomposition is to diagonalize a given square matrix. If there is an invertible n×n matrix C and a diagonal matrix D such that A=CDC-1, then an n×n matrix A is diagonalizable.

Procedure-

  1. Choose a square matrix (m X m) (e.g., 3 X 3, 4 X 4, 5 X 5, etc.,)

Otherwise-Pop up error – select number of rows and Columns should be same (or matrix dimension mismatched)

  1. For a given matrix,

A = $\begin{bmatrix} 2 & 1 & 0 \\ 1 & 2 & 1 \\ 0 & 1 & 2 \end{bmatrix}$

The aim of Jordan decomposition is to diagonalize a given square matrix A, if A=PDP-1 is possible, where P is an invertible matrix and D is diagonal matrix. We'll go into the specifics of how matrix P and matrix D are formed later. Matrix P and D are derived from matrix A.

  1. Firstly, we’ll find the eigen values of the matrix A

| A – 位*I | = 0 (I = identity matrix)

Or, $\begin{bmatrix} 2 & 1 & 0 \\ 1 & 2 & 1 \\ 0 & 1 & 2 \end{bmatrix} -$ $\lambda*\begin{bmatrix} 1 & 0 & 0 \\ 0 & 1 & 0 \\ 0 & 0 & 1 \end{bmatrix}$ = 0

Or, $\begin{bmatrix} \mathbf{(2 -}\lambda) & \mathbf{1} & \mathbf{0} \\ \mathbf{1} & \mathbf{(2 -}\lambda) & \mathbf{1} \\ \mathbf{0} & \mathbf{1} & \mathbf{(2 -}\lambda) \end{bmatrix}$ = 0

Or, (2-) ((2-) × (2-)-1×1)-1(1× (2-)-1×0) +0(1×1-(2-) ×0) = 0

Or,(2-)((4-4+2)-1)-1((2-)-0)+0(1-0)=0

Or,(2-)(3-4+2)-1(2-)+0(1)=0

Or,(6-11+62-3)-(2-)+0=0

Or,(-3+62-10+4)=0

Or,-(-2)(-0.5858)(-3.4142)=0

Or,(-2)=0or(-0.5858)=0or(-3.4142)=0

So, The eigenvalues of the matrix A are given by =0.5858,2,3.4142

You can apply Newton Raphson method to find a good approximation for the root of a real-valued function. You can use this method here to find the eigen values (or, 位’s)

Please read through the matrix's minor and co-factor in to understand the finding of the determinant value in step 3. I've already written an article regarding minors of a matrix.

  1. Now, calculate the eigen vectors from the corresponding eigen values.

In our case, eigen values are 0.5858, 2, 3.4142

For,  = 0.5858

A -  * I

= A - 0.5858 * I

= $\begin{bmatrix} 2 & 1 & 0 \\ 1 & 2 & 1 \\ 0 & 1 & 2 \end{bmatrix}$ – 0.5858*$\begin{bmatrix} 1 & 0 & 0 \\ 0 & 1 & 0 \\ 0 & 0 & 1 \end{bmatrix}$

=

= 1.4142 1 0
= 1 1.4142 1
0 1 1.4142

Now, do row operations to reduce the matrix

Now, reduce this matrix
R1←R1÷1.4142

 = 
1 0.7071 0
1 1.4142 1
0 1 1.4142

R2←R2-R1

 = 
1 0.7071 0
0 0.7071 1
0 1 1.4142

Interchanging rows R2↔︎R3

 = 
1 0.7071 0
0 1 1.4142
0 0.7071 1

R1←R1-0.7071×R2

 = 
1 0 -1
0 1 1.4142
0 0.7071 1

R3←R3 - 0.7071×R2

 = 
1 0 -1
0 1 1.4142
0 0 0

One can calculate row echelon form to reduce a matrix

Now, compute

A*x - I*x = 0

Or, (A - I)x = 0

Or, (A - 0.5858 * I)x = 0

Or, $\begin{bmatrix} 1 & 0 & - 1 \\ 0 & 1 & 1.4142 \\ 0 & 0 & 0 \end{bmatrix}*$ $\begin{bmatrix} x1 \\ x2 \\ x3 \end{bmatrix} = \begin{bmatrix} 0 \\ 0 \\ 0 \end{bmatrix}$

Or, x1-x3=0, x2+1.4142x3=0

Or, x1=x3, x2=-1.4142x3

Now, for eigen value,  = 0.5858, corresponding eigen vector is

v1= $\begin{bmatrix} x3 \\ - 1.4142x3 \\ x3 \end{bmatrix}$

let x3 = 1

v1= $\begin{bmatrix} 1 \\ - 1.4142 \\ 1 \end{bmatrix}$

We found the eigen vector for the eigen value, =0.5858, only in step 4 above. The same method may be used to calculate the eigen vectors for 位=2 and 3.4142.

Corresponding eigen vectors for eigen values 2 & 3.4142 are

v2= $\begin{bmatrix} - 1 \\ 0 \\ 1 \end{bmatrix}$

and

v3= $\begin{bmatrix} 1 \\ 1.4142 \\ 1 \end{bmatrix}$ respectively.

  1. To allow diagonalization, the number of eigenvectors must be equal the given square matrix’s dimension.

If the number of eigenvalues is less than the dimension of the given square matrix, a matrix cannot be diagonalized and show pop-up error.

Pop up error – ‘not diagonalizable!’

  1. Now, initialize the P matrix. P matrix columns are formed from the eigen vectors derived from the eigen values 0.5858, 2, and 3.4142 or they are

[v1 v2 v3]

or, P = $\left\lbrack - \begin{matrix} 1 & - 1 & 1 \\ 1.4142 & 0 & 1.4142 \\ 1 & 1 & 1 \end{matrix} \right\rbrack$

  1. The diagonal matrix (D) of the above matrix A contains the eigen values of matrix A as the following diagonal elements:

D = $\begin{bmatrix} 0.5858 & 0 & 0 \\ 0 & 2 & 0 \\ 0 & 0 & 3.4142 \end{bmatrix}$

8. Now the final step is to check whether the matrix P is invertible or not. If matrix P is not invertible then display the pop-up notification

Pop up error – ‘not diagonalizable!’

The values of matrices A, P, and P-1 will only be displayed if matrix P is invertible.



Contact Us

Name

Email *

Message *

Popular Posts

RMS Delay Spread, Excess Delay Spread and Multi-path ...(with MATLAB + Simulator)

馃摌 Overview of Delay Spread and Multi-path 馃М Excess Delay spread 馃М Power delay Profile 馃М RMS Delay Spread 馃摎 Further Reading 馃搨 Other Topics on RMS Delay Spread, Excess Delay ... 馃М Multipath Components or MPCs 馃М Online Simulator for Calculating RMS Delay Spread 馃М Why is there significant multipath in the case of very high frequencies? 馃М Why RMS Delay Spread is essential for wireless communication? 馃М Why the Power Delay Profile is essential? 馃М MATLAB Codes for Calculating Different Types of delay Spreads Delay Spread, Excess Delay Spread, and Multipath (MPCs) The fundamental distinction between wireless and wired connections is that in wireless connections signal reaches at receiver thru multipath signal propagation rather than directed transmission like co-axial cable. Wireless Communication has no set communication path between the transmitter and the receiver. The line...

Electromyography (EMG) Explained

  Electromyography (EMG) EMG stands for Electromyography . It is a medical test used to check how well your muscles and the nerves that control them are working. What it does EMG measures the electrical activity in your muscles. When nerves send signals to muscles, they create tiny electrical impulses—EMG records these. Why doctors use it Doctors may recommend EMG if you have symptoms like: Muscle weakness Numbness or tingling Muscle pain or cramping Suspected nerve disorders It helps diagnose conditions such as: Carpal Tunnel Syndrome Amyotrophic Lateral Sclerosis (ALS) Peripheral Neuropathy How it’s done Nerve conduction study (NCS) – small electrical pulses are applied to test nerve signals Needle EMG – a thin needle electrode is inserted into muscles to record activity Does it hurt? You might feel mild discomfort (like a quick pinch or muscle soreness) ...

Online Simulator for ASK, FSK, and PSK Signal Generation

Interactive Digital Signal Processing (DSP) Tutorial and Simulator for ASK, FSK, and BPSK modulation techniques. Try our new Digital Signal Processing Simulator!   •   Interactive ASK, FSK, and BPSK tools updated for 2025. Start Now Digital Modulation Visualizer: ASK, FSK, & BPSK Simulator Learn and visualize binary modulation techniques (ASK, FSK, BPSK) in real-time with adjustable carrier and sampling parameters. Perfect for DSP students and engineers. 馃摗 ASK Simulator 馃摱 FSK Simulator 馃帤️ BPSK Simulator 馃摎 More Topics ASK Modulator FSK Modulator BPSK Modulator More Topics 1. ASK (Amplitude Shift Keying) Simulat...

MIMO Channel Matrix | Rank and Condition Number

MIMO / Massive MIMO MIMO Channel Matrix | Rank and Condition...   The channel matrix in wireless communication is a matrix that describes the impact of the channel on the transmitted signal. The channel matrix can be used to model the effects of the atmospheric or underwater environment on the signal, such as the absorption, reflection or scattering of the signal by surrounding objects. When addressing multi-antenna communication, the term "channel matrix" is used. Let's assume that only one TX and one RX are in communication and there's no surrounding object. Here, in our case, we can apply the proper threshold condition to a received signal and get the original transmitted signal at the RX side. However, in real-world situations, we see signal path blockage, reflections, etc.,  (NLOS paths [↗]) more frequently. The obstruction is typically caused by building walls, etc. Multi-antenna communication was introduced to address this issue. It makes diversity app...

Constellation Diagrams of M-ary QAM | M-ary Modulation

馃摌 Overview of QAM 馃М MATLAB Code for m-ary QAM (4-QAM, 16-QAM, 32-QAM, ...) 馃М Online Simulator for M-ary QAM Constellations 馃摎 Further Reading 馃搨 Other Topics on Constellation Diagrams of QAM configurations ... 馃М MATLAB Code for 4-QAM 馃М MATLAB Code for 16-QAM 馃М MATLAB Code for m-ary QAM (4-QAM, 16-QAM, 32-QAM, ...) 馃М Simulator for constellation diagrams of m-ary PSK 馃М Simulator for constellation diagrams of m-ary QAM 馃М Overview of Energy per Bit (Eb / N0) 馃М Online Simulator for constellation diagrams of ASK, FSK, and PSK 馃М Theory behind Constellation Diagrams of ASK, FSK, and PSK 馃М MATLAB Codes for Constellation Diagrams of ASK, FSK, and PSK QAM Unlike M-ary PSK, where the signal is modulated with diffe...

Amplitude Shift Keying (ASK) Modulation & Demodulation (with Simulation)

Amplitude Shift Keying (ASK): Signal Analysis and Characterization Theoretical Overview: Amplitude Shift Keying (ASK) represents a primary digital modulation technique wherein information is encoded through discrete variations in the carrier signal's instantaneous amplitude. In a Binary ASK (BASK) framework, the modulation process maps binary data onto two distinct amplitude levels. Specifically, the binary '1' (mark) is conveyed by a sinusoidal carrier with amplitude A c and frequency f c over a bit interval T b , while the binary '0' (space) is represented by a null signal state. This particular signaling method is widely recognized as On-Off Keying (OOK) . It is technically realized by gating a carrier oscillator with a unipolar baseband sequence, effectively performing a product modulation that shifts the baseband spectrum to the carrier frequency. ASK Transmitter Architecture: ...

Constellation Diagrams of ASK, PSK, and FSK (with MATLAB Code + Simulator)

Constellation Diagrams: ASK, FSK, and PSK Comprehensive guide to signal space representation, including interactive simulators and MATLAB implementations. 馃摌 Overview 馃М Simulator ⚖️ Theory 馃搱 Q-function 馃摎 Resources BASK Modulation Transmits one of two signals: 0 or $\sqrt{E_b}$, representing binary 0 and 1. Simple but sensitive to noise. BFSK Modulation Transmits one of two signals: $\sqrt{E_b}$ on the Y-axis or $\sqrt{E_b}$ on the X-axis. These are orthogonal signals. BPSK Modulation Transmits $+\sqrt{E_b}$ or $-\sqrt{E_b}$ (antipodal signaling). Most efficient binary scheme. ...