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

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 →