Steepest Descent Method COde

2 次查看(过去 30 天)
I wrote a code on Steepest Decsent Method, with 550 X 550 random number matrix
M=rand(550);
P=0.5*(M+M');
N= sum(P,2);
D=abs(diag(P));
W=N-D;
A = P - diag(diag(P)) + diag(W);
X=(1:550)';
b=A*X;
x=zeros(550,1);
t=1e-7;
res=1;
count=1;
i=1;
while res>t
r=b-A*x;
p=r'*r/(r'*A*r);
x=x+p*r;
res(i)=norm(r);
i=i+1;
end
Someone please tell me if it is correct it or not ?
  1 个评论
Walter Roberson
Walter Roberson 2020-11-4
Steepest descent implies that you have a function being evaluated, but it is not clear what the function is. Something about eigenvalues? eigenvalues of a random matrix??

请先登录,再进行评论。

回答(0 个)

类别

Help CenterFile Exchange 中查找有关 Mathematics 的更多信息

Community Treasure Hunt

Find the treasures in MATLAB Central and discover how the community can help you!

Start Hunting!

Translated by