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位+6位2-位3)-(2-位)+0=0

Or,(-位3+6位2-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

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 Demodulation More Topics 1. ASK (Ampli...

UGC NET Electronic Science Previous Year Question Papers with Solutions

Download Papers and Solutions Exam Pattern Preparation Tips FAQs More Home / Engineering & Other Exams / UGC NET 2026 PYQ 馃搳 Exam Highlights: Electronic Science (88) Feature Details Junior Research Fellowship (JRF) ₹37,000 + HRA per month Eligibility M.Sc/M.Tech in Electronics (55%) Validity of Certificate JRF (3 Years) | Lectureship (Lifetime) 馃摜 Download UGC NET Electronics PDFs Complete collection of previous year question papers, answer keys and explanations for Subject Code 88. Start Downloading 馃搨 View All Question Papers June 2026 - Question Paper Download PDF June 202...

Flat vs Frequency Selective Online Simulator

Flat vs Frequency Selective Online Simulator Channel Type Without Fading Flat Fading Multipaths Nakagami m SNR(dB) Run Simulation Input Signal Signal After Fading Constellation Diagram BER vs SNR Explore Advanced Flat vs Frequency-Selective Fading Simulator Want to see these equations in action? Visualize it. Launch Simulator Tool Interactive Rayleigh Fading Simulator Want to see Rayleigh fading in action? Visualize it. Launch Simulator Tool Return to DSP Simulations Main Page →

OFDM Symbols and Subcarriers Explained

This article explains how OFDM (Orthogonal Frequency Division Multiplexing) symbols and subcarriers work. It covers modulation, mapping symbols to subcarriers, subcarrier frequency spacing, IFFT synthesis, cyclic prefix, and transmission. Step 1: Modulation First, modulate the input bitstream. For example, with 16-QAM , each group of 4 bits maps to one QAM symbol. Suppose we generate a sequence of QAM symbols: s0, s1, s2, s3, s4, s5, …, s63 Step 2: Mapping Symbols to Subcarriers Assume N sub = 8 subcarriers. Each OFDM symbol in the frequency domain contains 8 QAM symbols (one per subcarrier): Mapping (example) OFDM symbol 1 → s0, s1, s2, s3, s4, s5, s6, s7 OFDM symbol 2 → s8, s9, s10, s11, s12, s13, s14, s15 … OFDM sym...

Theoretical BER vs SNR for binary ASK, FSK, and PSK (with MATLAB Code + Simulator)

馃摌 Overview & Theory 馃М MATLAB Codes 馃М Q-function 馃摎 Further Reading Bit Error Rate (BER) Equations In ASK, noise directly affects the signal amplitude, making it the most vulnerable since the data is carried in amplitude changes. In FSK, data is represented by frequency variations, and because noise typically impacts amplitude more than frequency, FSK is more robust than ASK. In PSK, data is encoded in the signal phase, and BPSK specifically uses 180-degree phase shifts, creating the greatest separation between signal points and therefore achieving the lowest bit error rate (BER) for the same power level. BER formulas for ASK, FSK, and PSK modulation schemes. ASK BER = 0.5 × erfc(0.5 × √SNR) FSK BER = 0.5 × erfc(√(SNR / 2)) PSK BER = 0.5 × erfc(√SNR) ...

AM Modulation Online Simulator

Amplitude Modulation Simulator s AM (t) = A c [1 + k a m(t)] cos(蠅 c t) where, 蠅 = 2蟺f & k a = Amplitude Sensitivity Modulation index, 渭 = k a A m Message Frequency (fm): Carrier Frequency (fc): Carrier Amplitude (Ac): Modulation Index (m = Am / Ac): Interactive AM Demodulation Online Simulator Want to see these equations in action? Visualize it. Launch Simulator Tool Interactive AM Power Simulator Visualize it. Launch Simulator Tool Return to DSP Simulations Main Page →

Chirp Signal Simulator

Chirp Signal Simulator Starting Frequency (Hz) Ending Frequency (Hz) Amplitude phase Up-Chirp (unchecked = Down-Chirp) Generate Chirp Demodulate Return to DSP Simulations Main Page →