Skip to main content

EigenValue and EigenVector


Let’s assume a square matrix A

The characteristic equation,

| A – λ*I | = 0

(where I is an identity matrix)

After calculating the values of λs we attempt to find eigenvectors for corresponding eigenvalues like this

For eigenvalue, λ = λ1

A*x = λ1*I*x (where, x is an unknown vector)

Or, (A - λ1*I)*x = 0

The value of x is the corresponding eigenvector of λ1

Power Method for Dominant Eigenvalue

Let λ1, λ2, λ3, and λn be the eigenvalues of an n X n matrix A. λ1 is called the dominant eigenvalue of A if

| λ1| > | λi |, i = 2, 3, ... , n

The eigenvectors corresponding to λ1 are called dominant eigenvectors of A.

Procedure

  1. Choose an n X n matrix

The number of rows and columns should be the same (or matrix dimension mismatched)

  1. Like the Jacobi and Gauss-Seidel methods, the power method for approximating eigenvalues is iterative. First, we assume that matrix A has a dominant eigenvalue with corresponding dominant eigenvectors. Then we choose an initial approximation x0 of one of the

dominant eigenvectors of A. This initial approximation must be a nonzero vector in Rn

Finally, we form the sequence given by

x1 = Ax0

x2 = Ax1 = A(Ax0) = A2x0

x3 = Ax2 = A(A2x0) = A3x0

. . .

xn = Axn-1 = A(An-1x0) = Anx0

(In the above, x1 denotes the value of vector x at the first iteration and so on)

Compare the updated value of x with its previous value (obtained from the previous iteration)

For large powers of k, and by properly scaling this sequence, we will see that we obtain a good approximation of the dominant eigenvector of A.

  1. Repeat the iteration process until convergence

  2. The formula for finding the corresponding eigenvalue from eigenvector x.

If x is an eigenvector of A, then its corresponding eigenvalue is given by

λ = (Ax.x / x.x)

  1. If they do not converge even after many iterations (maybe after 1000 iterations), then

Entered matrix has no dominant eigenvalue

Example

A = $\begin{bmatrix} 2 & - 12 \\ 1 & - 5 \end{bmatrix}$

We begin with an initial nonzero approximation of

x0 = $\begin{bmatrix} 1 \\ 1 \end{bmatrix}$

We then obtain the following approximations

x1 = Ax0 = $\begin{bmatrix} 2 & - 12 \\ 1 & - 5 \end{bmatrix}\begin{bmatrix} 1 \\ 1 \end{bmatrix}$ = $\begin{bmatrix} - 10 \\ - 4 \end{bmatrix}$ = -4$\begin{bmatrix} 2.50 \\ 1.00 \end{bmatrix}$

x2 = Ax1 = $\begin{bmatrix} 2 & - 12 \\ 1 & - 5 \end{bmatrix}\begin{bmatrix} - 10 \\ - 4 \end{bmatrix}$ = $\begin{bmatrix} 28 \\ 10 \end{bmatrix}$ = 10$\begin{bmatrix} 2.80 \\ 1.00 \end{bmatrix}$

x3 = Ax2 = $\begin{bmatrix} 2 & - 12 \\ 1 & - 5 \end{bmatrix}\begin{bmatrix} 28 \\ 10 \end{bmatrix}$ = $\begin{bmatrix} - 64 \\ - 22 \end{bmatrix}$ = -22$\begin{bmatrix} 2.91 \\ 1.00 \end{bmatrix}$

x4 = Ax3 = $\begin{bmatrix} 2 & - 12 \\ 1 & - 5 \end{bmatrix}\begin{bmatrix} - 64 \\ - 22 \end{bmatrix}$ = $\begin{bmatrix} 136 \\ 46 \end{bmatrix}$ = 46$\begin{bmatrix} 2.96 \\ 1.00 \end{bmatrix}$

x5 = Ax4 = $\begin{bmatrix} 2 & - 12 \\ 1 & - 5 \end{bmatrix}\begin{bmatrix} 136 \\ 46 \end{bmatrix}$ = $\begin{bmatrix} - 280 \\ - 94 \end{bmatrix}$ = -94$\begin{bmatrix} 2.98 \\ 1.00 \end{bmatrix}$

x6 = Ax5 = $\begin{bmatrix} 2 & - 12 \\ 1 & - 5 \end{bmatrix}\begin{bmatrix} - 280 \\ - 94 \end{bmatrix}$ = $\begin{bmatrix} 568 \\ 190 \end{bmatrix}$ = 190$\begin{bmatrix} 2.99 \\ 1.00 \end{bmatrix}$

Note that the approximations in Example appear to be approaching scalar multiples of $\begin{bmatrix} 3 \\ 1 \end{bmatrix}$

So, the obtained dominant eigenvector from the above iterations is

x = $\begin{bmatrix} 3 \\ 1 \end{bmatrix}$

Now, we’ll find the corresponding eigenvalue from the obtained eigenvector

Formula

If x is an eigenvector of A, then its corresponding eigenvalue is given by

λ = (Ax.x / x.x)

Ax = $\begin{bmatrix} 2 & - 12 \\ 1 & - 5 \end{bmatrix}\begin{bmatrix} 2.99 \\ 1.00 \end{bmatrix}$ = $\begin{bmatrix} - 6.02 \\ - 2.01 \end{bmatrix}$

Then, Ax.x = $\begin{bmatrix} - 6.02 \\ - 2.01 \end{bmatrix}\begin{bmatrix} 2.99 \\ 1.00 \end{bmatrix}$ = -20.0 (approx.)

And x.x = $\begin{bmatrix} 2.99 \\ 1.00 \end{bmatrix}\begin{bmatrix} 2.99 \\ 1.00 \end{bmatrix}$ = $\begin{bmatrix} 2.99 \\ 1.00 \end{bmatrix}$ = 9.94 (approx.)

So, the corresponding eigenvalue, λ = (-20.0 / 9.94) = -2 (approx.)

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