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.

People are good at skipping over material they already know!

View Related Topics to







Contact Us

Name

Email *

Message *

Popular Posts

How to use MATLAB Simulink

Introduction to MATLAB Simulink MATLAB Simulink is a popular add-on of MATLAB. Here, you can use different blocks like modulator, demodulator, AWGN channel, etc. And you can do experiments on your own. Steps to Get Started 1. Go to the 'Simulink' tab at the top navbar of MATLAB. If not found, click on the add-on tab, search 'Simulink,' and then click on it to add. 2. Once you installed the simulation, click the 'new' tap at the top left corner. 3. Then, search the required blocks in the 'Simulink library.' Then, drag it to the editor space. 4. You can double-click on the blocks to see the input parameters. 5. Then, connect the blocks by dragging a line from one block's output terminal to another block's input. 6. If the connection is complete, click the 'run' tab in the middle of the top navbar. 7. After clicking on the run ...

OFDM Waveform with MATLAB Code (with Simulator)

  In OFDM (Orthogonal Frequency Division Multiplexing) , we transmit multiple orthogonal subcarriers simultaneously. Since the subcarriers are orthogonal , they do not interfere with each other, which is one of the main advantages of OFDM. Practically, OFDM converts a wideband signal into multiple narrowband orthogonal subcarriers. For typical wireless communication, if the signal bandwidth (or symbol duration) exceeds the coherence bandwidth of the channel, the signal experiences frequency-selective fading . Fading distorts the signal, making it difficult to recover the original information. By using OFDM, we transmit the same wideband signal across multiple orthogonal narrowband subcarriers, reducing the effect of fading. For example, if we want to transmit a signal of bandwidth 1024 kHz , we can divide it into N = 8 subcarriers . Each subcarrier is then spaced by: Δf = Total Bandwidth N = 1024 8 kHz...

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

📘 Overview & Theory 🧮 MATLAB Codes 📚 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) erfc / Q-func...

BER vs SNR for M-ary QAM, M-ary PSK, QPSK, BPSK, ...(MATLAB Code + Simulator)

Bit Error Rate (BER) & SNR Guide Analyze communication system performance with our interactive simulators and MATLAB tools. 📘 Theory 🧮 Simulators 💻 MATLAB Code 📚 Resources BER Definition SNR Formula BER Calculator MATLAB Comparison 📂 Explore M-ary QAM, PSK, and QPSK Topics ▼ 🧮 Constellation Simulator: M-ary QAM 🧮 Constellation Simulator: M-ary PSK 🧮 BER calculation for ASK, FSK, and PSK 🧮 Approaches to BER vs SNR What is Bit Error Rate (BER)? The BER indicates how many corrupted bits are received compared to the total number of bits sent. It is the primary figure of merit for a...

MATLAB Code for Constellation Diagram of QAM configurations such as 4, 8, 16, 32, 64, 128, and 256-QAM

📘 Overview of QAM 🧮 4-QAM MATLAB 🧮 16-QAM MATLAB 🚀 Online Simulator 📂 Other Topics on Constellation Diagrams... ▼ 🧮 MATLAB Code for 4-QAM 🧮 MATLAB Code for 16-QAM 🧮 MATLAB Code for m-ary QAM 🧮 Simulator for m-ary PSK 🧮 Simulator for m-ary QAM 🧮 Overview of Energy per Bit (Eb / N0) 🧮 Simulator for ASK, FSK, and PSK Overview of QAM One of the best-performing modulation techniques is QAM [↗] . Here, we modulate the symbols by varying the carrier signal's amplitude and phase in response to the variation in the message signal (or voltage variation). So, we may say that QAM is a combination of phase and amplitude modulation. Additionally, it performs better than ASK or PSK [↗] . In fact, any constellation for any type of modulatio...

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

📘 Overview 🧮 Simulator 💻 Theoretical Code 📊 Simulated Code 📚 Resources Overview BER vs. SNR denotes how many bits in error are received for a given signal-to-noise ratio, typically measured in dB. Common noise types in wireless systems: 🚀 1. Additive White Gaussian Noise (AWGN) 🌊 2. Rayleigh Fading AWGN adds random noise; Rayleigh fading attenuates the signal variably. A good SNR helps reduce these effects. Bit Error Rate (BER) Equations 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) erfc / Q-function (Click here) Live BER S...

FastAPI Static Files – Overview

FastAPI Static Files Often, a web application needs to include resources that do not change, even when dynamic data is rendered. These resources are called static assets . Examples of static files include: Images ( .png , .jpg ) JavaScript files ( .js ) Stylesheets ( .css ) Installing Required Library To handle static files in FastAPI, you need the aiofiles library. pip install aiofiles Mounting Static Files FastAPI uses the StaticFiles class to serve static content. You mount a folder (usually named static ) so that all files inside it can be accessed via a URL. from fastapi import FastAPI from fastapi.staticfiles import StaticFiles app = FastAPI() app.mount("/static", StaticFiles(directory="static"), name="static") Example 1: Using an Image Place an image file (for example, fa-logo.png ) inside the static folder. main.py from fastapi import FastAPI, Request from fastapi.responses import HTMLRespon...

Online Simulator for ASK, FSK, and PSK

Try our new Digital Signal Processing Simulator!   •   Interactive ASK, FSK, and BPSK tools updated for 2025. Start Now Interactive Modulation Simulators Visualize binary modulation techniques (ASK, FSK, BPSK) in real-time with adjustable carrier and sampling parameters. 📡 ASK Simulator 📶 FSK Simulator 🎚️ BPSK Simulator 📚 More Topics ASK Modulator FSK Modulator BPSK Modulator More Topics Simulator for Binary ASK Modulation Digital Message Bits Carrier Freq (Hz) Sampl...