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

People are good at skipping over material they already know!

View Related Topics to







Contact Us

Name

Email *

Message *

Popular Posts

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

馃摌 Overview of BER and SNR 馃М Online Simulator for BER calculation 馃М MATLAB Code for BER calculation 馃摎 Further Reading 馃搨 View Other Topics on M-ary QAM, M-ary PSK, QPSK ... 馃М Online Simulator for Constellation Diagram of m-ary QAM 馃М Online Simulator for Constellation Diagram of m-ary PSK 馃М MATLAB Code for BER calculation of ASK, FSK, and PSK 馃М MATLAB Code for BER calculation of Alamouti Scheme 馃М Different approaches to calculate BER vs SNR What is Bit Error Rate (BER)? The abbreviation BER stands for Bit Error Rate, which indicates how many corrupted bits are received compared to the total number of bits sent. BER = (number of bits received in error) / (total number of transmitted bits) What is Signal-to-Noise Ratio (SNR)? SNR is the ratio of signal power to noise powe...

ASK, FSK, and PSK (with MATLAB + Online Simulator)

馃摌 Overview 馃摌 Amplitude Shift Keying (ASK) 馃摌 Frequency Shift Keying (FSK) 馃摌 Phase Shift Keying (PSK) 馃摌 Which of the modulation techniques—ASK, FSK, or PSK—can achieve higher bit rates? 馃М MATLAB Codes 馃摌 Simulator for binary ASK, FSK, and PSK Modulation 馃摎 Further Reading ASK or OFF ON Keying ASK is a simple (less complex) Digital Modulation Scheme where we vary the modulation signal's amplitude or voltage by the message signal's amplitude or voltage. We select two levels (two different voltage levels) for transmitting modulated message signals. For example, "+5 Volt" (upper level) and "0 Volt" (lower level). To transmit binary bit "1", the transmitter sends "+5 Volts", and for bit "0", it sends no power. The receiver uses filters to detect whether a binary "1" or "0" was transmitted. ...

Calculation of SNR from FFT bins in MATLAB

馃摌 Overview 馃М MATLAB Code for Estimation of SNR from FFT bins 馃М MATLAB Code for SNR from PSD using Kaiser Window 馃摎 Further Reading Here, you can find the SNR of a received signal from periodogram / FFT bins using the Kaiser operator. The beta (尾) parameter characterizes the Kaiser window, which controls the trade-off between the main lobe width and the side lobe level. Steps Set up the sampling rate and time vector Compute the FFT and periodogram Calculate the frequency resolution and signal power Exclude the signal power from noise calculation Compute the noise power and SNR MATLAB Code for Estimation of SNR from FFT bins clc; clear; close all; % Parameters fs = 8000; f_tone = 1000; N = 8192; t = (0:N-1)/fs; % Generate signal + noise signal = sin(2*pi*f_tone*t); SNR_true_dB = 20; signal_power = mean(signal.^2); noise_power = signal_power / (10^(SNR_true_dB/10)); noisy_signal = signal + sqrt(noise_power) * randn(1, N); % Apply ...

Comparing Baseband and Passband Implementations of ASK, FSK, and PSK

馃摌 Overview 馃М Baseband and Passband Implementations of ASK, FSK, and PSK 馃М Difference betwen baseband and passband 馃摎 Further Reading 馃搨 Other Topics on Baseband and Passband ... 馃М Baseband modulation techniques 馃М Passband modulation techniques   Baseband modulation techniques are methods used to encode information signals onto a baseband signal (a signal with frequencies close to zero). Passband techniques shift these signals to higher carrier frequencies for transmission. Here are the common implementations: Amplitude Shift Keying (ASK) [↗] : In ASK, the amplitude of the signal is varied to represent different symbols. Binary ASK (BASK) is a common implementation where two different amplitudes represent binary values (0 and 1). ASK is simple but susceptible to noise. ASK Baseband (Digital Bits) ASK Passband (Modulated Carrier)     Fig 1:  ASK Passband Modulation (...

Comparing Baseband and Passband Implementations of m-ary QAM

  Let's assume your original digital message bitstream is: 0, 0, 1, 0, 0, 0, 1, 0, 1, 1 In 4-QAM, we group them into pairs: (00), (10), (00), (10), (11). Your baseband symbols are: Symbol 1 (Bits 00): -1.00 - j1.00 Symbol 2 (Bits 10): 1.00 - j1.00 Symbol 3 (Bits 00): -1.00 - j1.00 Symbol 4 (Bits 10): 1.00 - j1.00 Symbol 5 (Bits 11): 1.00 + j1.00   To transmit these symbols over a wireless medium, we modulate this baseband signal onto a high-frequency carrier (e.g., 50 Hz). This process creates the passband signal , where the information is stored in the phase and amplitude of the sine wave. Fig 1: 4-QAM Baseband I and Q Components Fig 2: 4-QAM Passband Modulated Signal   In this example, the symbol rate is 5 symbols per second. Detailed Explanation 4-QAM Constellation Mapping In standard 4-QAM mapping, bits are converted to complex points on a grid: Bits...

Online Simulator for ASK, FSK, and PSK

Try our new Digital Signal Processing Simulator!   Start Simulator for binary ASK Modulation Message Bits (e.g. 1,0,1,0) Carrier Frequency (Hz) Sampling Frequency (Hz) Run Simulation Simulator for binary FSK Modulation Input Bits (e.g. 1,0,1,0) Freq for '1' (Hz) Freq for '0' (Hz) Sampling Rate (Hz) Visualize FSK Signal Simulator for BPSK Modulation ...

MATLAB Code for ASK, FSK, and PSK (with Online Simulator)

馃摌 Overview & Theory 馃М MATLAB Code for ASK 馃М MATLAB Code for FSK 馃М MATLAB Code for PSK 馃М Simulator for binary ASK, FSK, and PSK Modulations 馃摎 Further Reading ASK, FSK & PSK HomePage MATLAB Code MATLAB Code for ASK Modulation and Demodulation % The code is written by SalimWireless.Com % Clear previous data and plots clc; clear all; close all; % Parameters Tb = 1; % Bit duration (s) fc = 10; % Carrier frequency (Hz) N_bits = 10; % Number of bits Fs = 100 * fc; % Sampling frequency (ensure at least 2*fc, more for better representation) Ts = 1/Fs; % Sampling interval samples_per_bit = Fs * Tb; % Number of samples per bit duration % Generate random binary data rng(10); % Set random seed for reproducibility binary_data = randi([0, 1], 1, N_bits); % Generate random binary data (0 or 1) % Initialize arrays for continuous signals t_overall = 0:Ts:(N_bits...

Constellation Diagrams of ASK, PSK, and FSK with MATLAB Code + Simulator

馃摌 Overview of Energy per Bit (Eb / N0) 馃М Online Simulator for constellation diagrams of ASK, FSK, and PSK 馃М Theory behind Constellation Diagrams of ASK, FSK, and PSK 馃М MATLAB Codes for Constellation Diagrams of ASK, FSK, and PSK 馃摎 Further Reading 馃搨 Other Topics on Constellation Diagrams of ASK, PSK, and FSK ... 馃М Simulator for constellation diagrams of m-ary PSK 馃М Simulator for constellation diagrams of m-ary QAM BASK (Binary ASK) Modulation: Transmits one of two signals: 0 or -√Eb, where Eb​ is the energy per bit. These signals represent binary 0 and 1.    BFSK (Binary FSK) Modulation: Transmits one of two signals: +√Eb​ ( On the y-axis, the phase shift of 90 degrees with respect to the x-axis, which is also termed phase offset ) or √Eb (on x-axis), where Eb​ is the energy per bit. These signals represent binary 0 and 1.  BPSK (Binary PSK) Modulation: Transmits one of two signals...