2024-05-150945.18 KB12页
2024-05-1502.1 MB57页
2024-05-1503.1 MB94页
•clear,clc•A=[3,2,1;2,5,-2;1,-1,-4];b=[5;16;7];n=length(b);•D=diag(diag(A));L=-tril(A,-1);U=-triu(A,1);•X0=zeros(n,1);X=D\((L+U)*X0+b);k=1;•whilenorm(X-X0)>10^(-12)k<10^3•k=k+1;X0=X;X=D\((L+U)*X0+b);•end•X,k一、线性方程组的定常（古典）迭代法第七章：线性与非线性方程组的迭代法1、Jacobi迭代法一、线性方程组的定常（古典）迭代法•clear,clc•A=[3,2,1;2,5,-2;1,-1,-4];b=[5;16;7];n=length(b);•D=... 2024-05-200284.66 KB17页
2024-05-200249.93 KB6页
2024-05-150217.3 KB4页
2024-05-200457.58 KB7页
2024-05-150604.39 KB25页
2024-05-15014.83 KB1页
2024-05-200189.32 KB4页
2024-05-150543.5 KB9页
2024-05-150612.49 KB18页
2024-05-200504.1 KB13页
三角分解（Doolittle分解）算法clear,clcn=5;A=randn(n)+n*eye(n);B=A;fork=1:n-1fori=k+1:nA(i,k)=A(i,k)/A(k,k);forj=k+1:nA(i,j)=A(i,j)-A(i,k)*A(k,j);endendendL=tril(A,-1)+eye(n),U=triu(A),E=B-L*U第三章：线性方程组的数值求解三角分解（Doolittle分解）算法（简化）clear,clcn=5;A=randn(n)+0.5*eye(n);B=A;fork=1:n-1A(k+1:n,k)=A(k+1:n,k)/A(k,k);A(k+1:n,k+1:n)=A(k+1:n,k+1:n)-A(k+1:n,k)*A(k,k+1:n);endL=tril(A... 2024-05-20085.26 KB12页
2024-05-200125.62 KB1页
2024-05-1501.26 MB23页
2024-06-080566.66 KB12页
2024-05-1501.61 MB71页
2024-05-1501.14 MB8页
2024-05-1501.32 MB13页
