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

Q-function in BER vs SNR Calculation (with Simulation)

Q-function in BER vs. SNR Calculation In digital communications and signal processing, the Q-function plays a significant role in predicting system reliability. It allows engineers to quantify the probability that Gaussian noise will exceed a specific threshold, causing a bit error. What is the Q-function? The Q-function is a mathematical function representing the tail probability of the standard normal (Gaussian) distribution. It is the complementary cumulative distribution function (CCDF) of a standard Gaussian distribution. Q(x) = (1 / √(2π)) ∫ₓ∞ e^(-t² / 2) dt Q-Function Interactive Simulator Move the slider to see how the "Tail Probability" (the area in red) changes. This area represents the Probability of Error (BER) . Threshold Distance ( x ) — (Simulates Increasing SNR) x = 1.0 Q(x) = 0.1587 ...

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 f...

Frequency Shift Keying (FSK) Modulation & Demodulation (with Simulation)

Frequency Shift Keying (FSK) Theoretical Foundations: Frequency Shift Keying (FSK) is a discrete frequency modulation scheme wherein the digital information is encoded via instantaneous shifts in the carrier signal's frequency. The fundamental implementation is Binary FSK (BFSK), which maps binary data onto two distinct, discrete spectral states. A binary '1' (the "mark" state) is represented by a carrier frequency \( f_1 \), while a binary '0' (the "space" state) corresponds to frequency \( f_2 \). Each symbol is sustained for a bit interval denoted by \( T_b \). FSK Transmitter Characterization: The mathematical model for the modulated BFSK output \( s(t) \) is defined as: \[ s(t) = \begin{cases} A_c \cos(2\pi f_1 t), & \text{for } m = 1 \\ A_c \cos(2\pi f_2 t), & \text{for } m = 0 \end{cases} \] ...

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...

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...

Orthogonal Time Frequency Space (OTFS) (with MATLAB)

In OTFS (Orthogonal Time Frequency Space) modulation — a scheme designed for high-Doppler and time-varying wireless channels — the terms ISFFT and SFFT are key mathematical transformations used to move between different representation domains. Figure: OTFS block diagram 1. ISFFT — Inverse Symplectic Finite Fourier Transform Purpose: Transforms data symbols from the delay-Doppler domain to the time-frequency domain . \[ X[n, m] = \frac{1}{\sqrt{NM}} \sum_{k=0}^{N-1} \sum_{l=0}^{M-1} x[k, l] \, e^{j2\pi \left( \frac{nk}{N} - \frac{ml}{M} \right)} \] Here, \( N \) is the number of Doppler bins (time slots), and \( M \) is the number of delay bins (subcarriers). The ISFFT maps each data symbol from the delay-Doppler grid (where the channel is sparse and easier to equalize) to the time-frequency grid (where standard multicarrier modulation like OFDM can be applied). 2. SFFT — Symplectic Finite Fourier Transform Purpose: Performs the reverse operation ...

Choke Input Filter Explained

  Choke Input Filter Choke Input Filter A well-designed choke input filter is a type of power supply filter used to smooth the output of a rectifier (like in DC power supplies). It uses an inductor (choke) as the first component right after the rectifier, followed by a capacitor. Basic Structure Rectifier → Choke (L) → Capacitor (C) → Load What Makes It Well-Designed? Critical Inductance is satisfied: The choke must have enough inductance to keep current flowing continuously. This minimum value is called critical inductance. Low ripple output: A good design significantly reduces AC ripple in the DC output. The choke resists sudden changes in current. Proper load current: Works best when the load current is above a certain minimum level. Too light a load results in poor filter...