Inverse Power Method Doesnt Work

Question

Filippos Georgios Sarakis 2023-1-19

0
链接

此问题的直接链接

https://ww2.mathworks.cn/matlabcentral/answers/1897190-inverse-power-method-doesnt-work

回答： Harsh Sanghai 2023-3-21

I try to find the smallest eigenvalue of a matrix using the Power Method to approximate its conditional number but it doesnt work. I can find the biggest eigenvector but not the smallest.

function [dk1,dkinf]=fun(x)

n = numel(x)-1;

psi = @(x)exp(-3*x.^2);

L = zeros(n+1);

for i = 1:n+1

L(i,:) = psi(x(1:n+1)-x(i));

end

format long

L

antL=inv(L)

A=max(sum(abs(L)))

B=max(sum(abs(antL)))

dk1=A*B

C=max(sum(abs(L')))

D=max(sum(abs(antL')))

dkinf=C*D

xold = 0.5*ones(n+1,1);

t=7

for i = 1:t

xnew=L*xold;

X=xnew/norm(xnew,2);

xold=xnew;

end

trX=transpose(X);

lmax=(trX*L*X)/(trX*X)

max(eig(L))

xold3 = 0.5*ones(n+1,1);

s=4

for i = 1:s

xnew2=L\xold3;

antX=xnew2/norm(xnew2,2);

xold3=xnew2;

end

trantX=transpose(antX);

antlmax=(trantX*(L\antX))/(trantX*antX)

lmin=1/antlmax

CN=lmax/lmin

end

1 个评论
显示 -1更早的评论隐藏 -1更早的评论

Suman Sahu 2023-3-10

Similar questions have been asked by other users. Please go through these answers to see if they may be helpful to your case.

Find smallest Eigenvalue and the corresponding eigenvector. - MATLAB Answers - MATLAB Central (mathworks.com)

inverse power method for smallest eigenvector calculation - MATLAB Answers - MATLAB Central (mathworks.com)

[Solved] Power method, eigenvalues. - MATLAB Answers - MATLAB Central (mathworks.com)

请先登录，再进行评论。

请先登录，再回答此问题。

Answer 1

Harsh Sanghai 2023-3-21

0
链接

此回答的直接链接

https://ww2.mathworks.cn/matlabcentral/answers/1897190-inverse-power-method-doesnt-work#answer_1197385

在 MATLAB Online 中打开

Hi,

The Power Method is typically used to find the largest eigenvalue and its associated eigenvector of a matrix. To find the smallest eigenvalue, you can use the Inverse Power Method, which is a variant of the Power Method.

Here is the modified code that implements the Inverse Power Method to find the smallest eigenvalue:

function [dk1, dkinf, CN] = fun(x)
n = numel(x)-1;
psi = @(x)exp(-3*x.^2);
L = zeros(n+1);
for i = 1:n+1
    L(i,:) = psi(x(1:n+1)-x(i));
end
antL = inv(L);
A = max(sum(abs(L)));
B = max(sum(abs(antL)));
dk1 = A*B;
C = max(sum(abs(L')));
D = max(sum(abs(antL')));
dkinf = C*D;
% Inverse Power Method to find the smallest eigenvalue
xold = ones(n+1, 1);
mu = 0; % initial guess for eigenvalue
tol = 1e-10; % tolerance for convergence
maxiter = 100; % maximum number of iterations
for k = 1:maxiter
    xnew = L\xold;
    mu_new = (xnew'*xold)/(xold'*xold);
    if abs(mu_new - mu) < tol
        break;
    end
    xold = xnew;
    mu = mu_new;
end
lmin = mu;
CN = lmax/lmin;
end