Skip to main content

Manual Code for Eigenvalue Decomposition in MATLAB


MATLAB Code for Manual Eigenvalue Decomposition

clc;
clear;
close all;

A = [1,2];
R = A' * A;
array_length = length(A);
eigenvalues = manual_eigenvalue_decomposition(R, array_length);
disp('Eigenvalues:');
disp(eigenvalues);

eigenvectors = find_eigenvectors(R, eigenvalues);
disp('Eigenvector Matrix:');
disp(eigenvectors);

% Manual Eigenvalue Decomposition Function
function eigenvalues = manual_eigenvalue_decomposition(A, n)
eigenvalues = zeros(n, 1); % Initialize eigenvalues as a column vector
for i = 1:n
% Start with a random vector
v = randn(n, 1);

% Power iteration to find the eigenvector corresponding to the largest eigenvalue
for j = 1:10 % Iteration count (power iteration steps)
v = A * v; % Multiply by matrix A
v = v / norm(v); % Normalize the vector
end

% Eigenvalue is the Rayleigh quotient
eigenvalues(i) = (v' * A * v) / (v' * v);

% Deflate the matrix to find the next eigenvector
A = A - eigenvalues(i) * (v * v');
end
end

function eigenvectors = find_eigenvectors(A, eigenvalues)
n = size(A, 1); % Get the size of the matrix A
num_eigenvalues = length(eigenvalues); % Get the number of eigenvalues
eigenvectors = zeros(n, num_eigenvalues); % Initialize eigenvectors matrix

for i = 1:num_eigenvalues
lambda = eigenvalues(i); % Take the eigenvalue

% Solve (A - lambda * I) * v = 0
eig_matrix = A - lambda * eye(n); % (A - lambda * I)

% Find the null space (eigenvector corresponding to the eigenvalue)
v = null(eig_matrix);

% If there are multiple eigenvectors, select the first one
if size(v, 2) > 1
v = v(:, 1);
end

% Normalize the eigenvector
eigenvectors(:, i) = v / norm(v);
end
end

 

Output

Eigenvalues:
    5.0000
   -0.0000

Eigenvector Matrix:
    0.4472   -0.8944
    0.8944    0.4472 

 

MATLAB Code for Manual Eigenvalue Decomposition with Scaling of the Input Matrix R

clc;
clear;
close all;

A = [1,2];
R = (A' * A)/2;
array_length = length(A);
eigenvalues = manual_eigenvalue_decomposition(R, array_length);
disp('Eigenvalues:');
disp(eigenvalues);

eigenvectors = find_eigenvectors(R, eigenvalues);
disp('Eigenvector Matrix:');
disp(eigenvectors);

% Manual Eigenvalue Decomposition Function
function eigenvalues = manual_eigenvalue_decomposition(A, n)
eigenvalues = zeros(n, 1); % Initialize eigenvalues as a column vector
for i = 1:n
% Start with a random vector
v = randn(n, 1);

% Power iteration to find the eigenvector corresponding to the largest eigenvalue
for j = 1:10 % Iteration count (power iteration steps)
v = A * v; % Multiply by matrix A
v = v / norm(v); % Normalize the vector
end

% Eigenvalue is the Rayleigh quotient
eigenvalues(i) = (v' * A * v) / (v' * v);

% Deflate the matrix to find the next eigenvector
A = A - eigenvalues(i) * (v * v');
end
end

function eigenvectors = find_eigenvectors(A, eigenvalues)
n = size(A, 1); % Get the size of the matrix A
num_eigenvalues = length(eigenvalues); % Get the number of eigenvalues
eigenvectors = zeros(n, num_eigenvalues); % Initialize eigenvectors matrix

for i = 1:num_eigenvalues
lambda = eigenvalues(i); % Take the eigenvalue

% Solve (A - lambda * I) * v = 0
eig_matrix = A - lambda * eye(n); % (A - lambda * I)

% Find the null space (eigenvector corresponding to the eigenvalue)
v = null(eig_matrix);

% If there are multiple eigenvectors, select the first one
if size(v, 2) > 1
v = v(:, 1);
end

% Normalize the eigenvector
eigenvectors(:, i) = v / norm(v);
end
end


Output 

Eigenvalues:
    2.5000
   -0.0000

Eigenvector Matrix:
    0.4472   -0.8944
    0.8944    0.4472

 

Conclusion

The eigenvalues change, while the eigenvectors remain the same when scaling the input matrix for eigenvalue decomposition.


Copy the MATLAB Code above from here


Further Reading

[1] Singular Value Decomposition in Multi-Antenna Communication

📊 MATLAB & ONLINE SIMULATIONS (Web-Based)
🎓 GATE & UGC - NET SOLUTIONS
📡 WIRELESS & SIGNAL PROCESSING


Contact Us

Name

Email *

Message *

Popular Posts

UGC NET Electronic Science Previous Year Question Papers with Solutions

Home / Engineering & Other Exams / UGC NET 2026 PYQ ⬇️ Download Papers and Solutions 📋 Exam Pattern 💡 Preparation Tips ❓ FAQs 📊 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 2025 - Question Paper Download PDF June 2025 - Solved Paper + Explanation ...
Read more

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

Design of CMOS XOR/XNOR Gates

Design of CMOS XOR/XNOR Gates The semiconductor industry has experienced rapid integration of multimedia applications into mobile electronics, leading to very high integration density in CMOS VLSI. As operating frequencies increase, power consumption, speed, silicon area, and reliability become critical considerations. The XOR-XNOR circuits are fundamental building blocks in arithmetic circuits (Full Adders, Multipliers), compressors, comparators, parity checkers, code converters, error-detecting/correcting codes, and phase detectors. Their performance directly impacts the complex circuits they are used in. Design goals include full output voltage swing, low power consumption, reduced transistor count, minimal delay, and simultaneous non-skewed outputs. Static Logic (Static CMOS) Stat...
Read more

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 More Topics 1. ASK (Amplitude Shift Keying) Simulat...
Read more

MATLAB Code for MUSIC

  MATLAB Code clc; clear; close all ; %% Step 1: Define Parameters M = 8; % Number of array sensors d = 0.5; % Sensor spacing (lambda/2) K = 2; % Number of signals N = 200; % Number of snapshots theta = [-20 30]; % True signal angles (degrees) SNR = 10; % Signal-to-noise ratio (dB) fprintf( 'Step 1: Parameters Initialized\n' ); %% Step 2: Generate Signal Sources t = 1:N; s1 = exp(1j*2*pi*0.05*t); s2 = exp(1j*2*pi*0.1*t); S = [s1; s2]; figure; plot(real(S(1,:))) title( 'Signal 1 (Real Part)' ) xlabel( 'Samples' ) ylabel( 'Amplitude' ) figure; plot(real(S(2,:))) title( 'Signal 2 (Real Part)' ) xlabel( 'Samples' ) ylabel( 'Amplitude' ) fprintf( 'Step 2: Source Signals Generated\n' ); %% Step 3: Construct Steering Matrix A = zeros(M,K); for k = 1:K A(:,k) = exp(-1j*2*pi*d*(0:M-1)'*sin(theta(k)*pi/180)); end fprintf( 'Step 3: Steering Matr...
Read more

Interactive Eye Diagram & ISI Simulator: Visualizing Signal Integrity

Interactive Eye Diagram & Noise Margin Filter Roll-off (α) α = 0.4 Noise Level Bitstream (TX) Stage 1: Components (Click Legend to Hide/Show) Stage 2: Composite Signal Stage 3: The Eye (Annotated Analysis) Simulation Workflow 1. Pulse Mapping: Each bit a[k] is mapped to a pulse shape p(t) . We use the Raised Cosine filter, which is the standard for bandwidth-limited communication. Clicking the legend above removes a specific bit's contribution to show how it affects the neighbors. 2. Linear Superposition: The total signal x(t) is the sum of all individual pulses shifted by the symbol period T . This "Combined Waveform" shows how pulses "bleed" into each other, cre...
Read more

OFDM Baseband and Passband

  MATLAB Code >> %% OFDM BPSK Full Simulation: All Plots clear all ; close all ; clc; % --- 0. Parameters (Matching your HTML UI) --- nSymbols = 2; % Number of OFDM Symbols N = 4; % Subcarriers nCP = 2; % Cyclic Prefix fs = 1000; % Sampling Frequency (Hz) fc = 5; % Carrier Frequency (Hz) baudRate = 1; % Baud Rate %% --- 1. Generate Message (Bitstream) --- totalBits = nSymbols * N; bits = randi([0 1], 1, totalBits); %% --- 2. Make OFDM Symbols (Serial to Parallel) --- % Each column is one OFDM Symbol bitMatrix = reshape(bits, N, nSymbols); %% --- 3. Apply BPSK Mapping --- % 0 -> -1, 1 -> 1 bpskSymbols = 2*bitMatrix - 1; %% --- 4. Perform IFFT (Baseband Time Domain) --- ofdmTimeDomain = ifft(bpskSymbols, N); %% --- 5. Add Cyclic Prefix --- cpPart = ofdmTimeDomain(end-nCP+1:end, :); ofdmWithCP = [cpPart; ofdmTimeDomain]; serialBaseband = ofdmWithCP(:); % Flatten for transmission %% --- 6. Generat...
Read more