已阅读5页,还剩67页未读, 继续免费阅读
版权说明:本文档由用户提供并上传,收益归属内容提供方,若内容存在侵权,请进行举报或认领
文档简介
矩阵与数值分析上机实习1. 设, 其精确值为.(1) 编制按从大到小的顺序, 计算的通用程序(2) 编制按从小到大的顺序, 计算的通用程序(3) 按两种顺序分别计算并指出有效位数(编制程序时用单精度)(4) 通过本上机题,你明白了什么从小到大,代码:%1-SN = %N = input(please input a number(N=2)if(N =2)102N = 100S: 7.4005e-001 clearplease input a number(N=2)104N = 10000S: 7.4990e-001 clearplease input a number(N=2)106N = 1000000S: 7.5000e-001从大到小代码:%1-SN = %eps(single)N = input(please input a number(N=2)if(N =2)102N = 100S: 7.4005e-001 clearans = 1.1921e-007please input a number(N=2)104N = 10000S: 7.4990e-001 clearans = 1.1921e-007please input a number(N=2)106N = 1000000S: 7.5000e-001(4)计算的顺序影响结果。2. 秦九韶算法。已知n次多项式,用秦九韶算法编写通用的程序计算函数在点的值,并计算在点的值.(提示:编写程序时,输入系数向量和点,输出结果,多项式的次数可以通过向量的长度来判断)代码:A = input(请输入系数,由高次幂开始);n = input(请输入计算变量的值);len = length(A);val = zeros(len);val(1) = A(1);%printf(len = %c, len)for i = 2: 1: len %disp(val(i-1) %disp(n) val(i) = val(i-1)* n + val(i);end%printf(%f, val(len)val(len)结果:请输入系数,由高次幂开始7 3 -5 11请输入计算变量的值23ans = 851693. 分别用Gauss消元法和列主元消去法编程求解方程组Ax=b,其中,.高斯消去法代码: A= 31 -13 0 0 0 -10 0 0 0 -13 35 -9 0 -11 0 0 0 0 0 -9 31 -10 0 0 0 0 0 0 0 -10 79 -30 0 0 0 -9 0 0 0 -30 57 -7 0 -5 0 0 0 0 0 -7 47 -30 0 0 0 0 0 0 0 -30 41 0 0 0 0 0 0 -5 0 0 27 -2 0 0 0 -9 0 0 0 -2 29 ;B =-15, 27, 23, 0, -20, 12, -7, 7, 10;B = B.;%disp(A)%disp(B) C= A,B; n = size(A,1);ra = rank(A);rc= rank(C);x = zeros(1,n);if ra = rc disp(no solution)else for i = 1: 1: (n-1) for j = i + 1: 1: n temp = (-C(j,i)/ C(i,i); for k = i:1:(n+1) C(j,k) =C(i,k) * temp + C(j, k) ; end end endend for i = n:-1:1 if i = n disp(C(i,(n+1) disp(C(i,(n+1)-sum(C(i,(i+1):n).*x(i+1):n) disp(C(i,i) end x(i) = (C(i,(n+1)-sum(C(i,(i+1):n).*x(i+1):n)/C(i,i);enddisp(solution)disp(x)结果:-2.2051e-002 9.4726e-001 1.0410e+000 7.4481e-002 -2.6617e-001 2.0020e-001 -2.4242e-002 2.3844e-001 3.8439e-001列主元消去法代码:%t4-max %A= 31 -13 0 0 0 -10 0 0 0 -13 35 -9 0 -11 0 0 0 0 0 -9 31 -10 0 0 0 0 0 0 0 -10 79 -30 0 0 0 -9 0 0 0 -30 57 -7 0 -5 0 0 0 0 0 -7 47 -30 0 0 0 0 0 0 0 -30 41 0 0 0 0 0 0 -5 0 0 27 -2 0 0 0 -9 0 0 0 -2 29 ;B =-15, 27, 23, 0, -20, 12, -7, 7, 10;B = B.;%disp(A)%disp(B) C= A,B; n = size(A,1);ra = rank(A);rc= rank(C);x = zeros(1,n);if ra = rc disp(no solution)else for i = 1: 1: (n-1) % make max value in col in the row % max = 0; inx = i; for j = i:n if(abs(C(j,i) max) max = abs(C(j,i); inx = j; end end if inx i for j = i:(n+1) swap = C(i,j); C(i,j) = C(inx,j); C(inx,j) = swap; end end for j = i + 1: 1: n temp = (-C(j,i)/ C(i,i); for k = i:1:(n+1) C(j,k) =C(i,k) * temp + C(j, k) ; end end endend for i = n:-1:1 if i = n disp(C(i,(n+1) disp(C(i,(n+1)-sum(C(i,(i+1):n).*x(i+1):n) disp(C(i,i) end x(i) = (C(i,(n+1)-sum(C(i,(i+1):n).*x(i+1):n)/C(i,i);enddisp(solution)disp(x)结果:solution -2.2051e-002 9.4726e-001 1.0410e+000 7.4481e-002 -2.6617e-001 2.0020e-001 -2.4242e-002 2.3844e-001 3.8439e-0014. 编程求解题3中矩阵的LU分解及列主元的LU分解(求出L,U和P),并用LU分解的方法求A的逆矩阵及A的行列式LU分解:代码:clear A= 31 -13 0 0 0 -10 0 0 0 -13 35 -9 0 -11 0 0 0 0 0 -9 31 -10 0 0 0 0 0 0 0 -10 79 -30 0 0 0 -9 0 0 0 -30 57 -7 0 -5 0 0 0 0 0 -7 47 -30 0 0 0 0 0 0 0 -30 41 0 0 0 0 0 0 -5 0 0 27 -2 0 0 0 -9 0 0 0 -2 29 ;B =-15, 27, 23, 0, -20, 12, -7, 7, 10;B = B.;%disp(A)%disp(B) C= A,B; n = size(A,1);ra = rank(A);rc= rank(C);x = zeros(1,n);L = eye(n,n);if ra = rc disp(no solution)else for i = 1: 1: (n-1) for j = i + 1: 1: n temp = (-C(j,i)/ C(i,i); for k = i:1:(n+1) C(j,k) =C(i,k) * temp + C(j, k) ; end L(j,i) = - (1 * temp); end endend for i = n:-1:1 if i = n disp(C(i,(n+1) disp(C(i,(n+1)-sum(C(i,(i+1):n).*x(i+1):n) disp(C(i,i) end x(i) = (C(i,(n+1)-sum(C(i,(i+1):n).*x(i+1):n)/C(i,i);end%disp(solution)%disp(x)disp(C)disp(C)disp(L)disp(L)结果:L 1.0000e+000 0 0 0 0 0 0 0 0 -4.1935e-001 1.0000e+000 0 0 0 0 0 0 0 0 -3.0459e-001 1.0000e+000 0 0 0 0 0 0 0 0 -3.5387e-001 1.0000e+000 0 0 0 0 0 0 0 0 -3.9755e-001 1.0000e+000 0 0 0 0 0 0 0 0 -1.5694e-001 1.0000e+000 0 0 0 0 0 0 0 0 -6.5398e-001 1.0000e+000 0 0 0 0 0 0 -1.1210e-001 -1.7545e-002 -2.4619e-002 1.0000e+000 0 0 0 0 -1.1927e-001 -8.3391e-002 -1.4227e-002 -1.9962e-002 -9.2316e-002 1.0000e+000U3.1000e+001 -1.3000e+001 0 0 0 -1.0000e+001 0 0 0 0 2.9548e+001 -9.0000e+000 0 -1.1000e+001 -4.1935e+000 0 0 0 0 0 2.8259e+001 -1.0000e+001 -3.3504e+000 -1.2773e+000 0 0 0 0 0 0 7.5461e+001 -3.1186e+001 -4.5200e-001 0 0 -9.0000e+000 0 0 0 0 4.4602e+001 -7.1797e+000 0 -5.0000e+000 -3.5780e+000 0 0 0 0 -8.8818e-016 4.5873e+001 -3.0000e+001 -7.8472e-001 -5.6154e-001 0 0 0 0 0 -3.5527e-015 2.1381e+001 -5.1319e-001 -3.6724e-001 0 0 0 0 0 0 0 2.6413e+001 -2.4200e+000 0 0 0 0 0 0 0 0 2.7390e+001LUP分解代码:结果L = 1.0000e+000 0 0 0 0 0 0 0 0 -4.1935e-001 1.0000e+000 0 0 0 0 0 0 0 0 -3.0459e-001 1.0000e+000 0 0 0 0 0 0 0 0 -3.5387e-001 1.0000e+000 0 0 0 0 0 0 0 0 -3.9755e-001 1.0000e+000 0 0 0 0 0 0 0 0 -1.5694e-001 1.0000e+000 0 0 0 0 0 0 0 0 -6.5398e-001 1.0000e+000 0 0 0 0 0 0 -1.1210e-001 -1.7545e-002 -2.4619e-002 1.0000e+000 0 0 0 0 -1.1927e-001 -8.3391e-002 -1.4227e-002 -1.9962e-002 -9.2316e-002 1.0000e+000U = 3.1000e+001 -1.3000e+001 0 0 0 -1.0000e+001 0 0 0 0 2.9548e+001 -9.0000e+000 0 -1.1000e+001 -4.1935e+000 0 0 0 0 0 2.8259e+001 -1.0000e+001 -3.3504e+000 -1.2773e+000 0 0 0 0 0 0 7.5461e+001 -3.1186e+001 -4.5200e-001 0 0 -9.0000e+000 0 0 0 0 4.4602e+001 -7.1797e+000 0 -5.0000e+000 -3.5780e+000 0 0 0 0 0 4.5873e+001 -3.0000e+001 -7.8472e-001 -5.6154e-001 0 0 0 0 0 0 2.1381e+001 -5.1319e-001 -3.6724e-001 0 0 0 0 0 0 0 2.6413e+001 -2.4200e+000 0 0 0 0 0 0 0 0 2.7390e+001P = 1 0 0 0 0 0 0 0 0 0 1 0 0 0 0 0 0 0 0 0 1 0 0 0 0 0 0 0 0 0 1 0 0 0 0 0 0 0 0 0 1 0 0 0 0 0 0 0 0 0 1 0 0 0 0 0 0 0 0 0 1 0 0 0 0 0 0 0 0 0 1 0 0 0 0 0 0 0 0 0 1求A的逆矩阵:通过LU分解获得LU,LUX =I ,LY = I,UX= Y用高斯下去法解得Y和Xfor i = 1:n RA,RB,n,X=gaus(L,I(1:n,i); Y(1:n,i) = X; endfor i = 1:n RA,RB,n,X=gaus(U,Y(1:n,i); A_(1:n,i) = X; endA_ 3.8952e-002 1.5961e-002 5.8083e-003 3.6407e-003 7.2823e-003 1.7585e-002 1.2867e-002 1.4396e-003 1.2292e-003 1.5863e-002 3.7828e-002 1.3083e-002 6.5129e-003 1.2133e-002 9.7237e-003 7.1149e-003 2.4090e-003 2.1874e-003 4.8698e-003 1.1613e-002 3.8126e-002 7.7386e-003 6.9188e-003 3.8776e-003 2.8373e-003 1.4666e-003 2.5028e-003 8.1938e-004 1.9539e-003 6.4150e-003 1.8128e-002 1.0528e-002 3.2693e-003 2.3922e-003 2.3786e-003 5.7899e-003 4.5601e-004 1.0874e-003 3.5701e-003 1.0089e-002 2.4339e-002 6.9837e-003 5.1100e-003 4.7635e-003 3.4595e-003 1.2743e-004 3.0388e-004 9.9769e-004 2.8193e-003 6.8017e-003 4.1874e-002 3.0639e-002 1.3312e-003 9.6677e-004 9.3244e-005 2.2235e-004 7.3002e-004 2.0629e-003 4.9768e-003 3.0639e-002 4.6809e-002 9.7403e-004 7.0739e-004 1.0381e-004 2.4755e-004 8.1276e-004 2.2967e-003 4.7736e-003 1.3755e-003 1.0064e-003 3.8169e-002 3.3451e-003 2.6145e-004 6.2346e-004 2.0469e-003 5.7843e-003 3.5966e-003 1.1095e-003 8.1180e-004 3.3705e-003 3.6510e-002|A| = |U| = 6.1817e+0135. 编制程序求解矩阵A的cholesky分解,并用程序求解方程组Ax=b,其中, %5-choleky% A= 2 1 -5 1 1 -5 0 7 0 2 1 -1 1 6 -1 -4 ;B = 13,-9, 6, 0;%disp(A) dim = size(A,1); L = zeros(dim, dim);y= x = zeros(dim, 1);for i = 1:1:dim for j= 1: 1: dim if i = (j + 1) L(i,j) = (A(i,j) - sum(L(i,1:(j-1).*L(j,1:(j-1)/L(j,j); else L(j,j) = sqrt(A(j,j) - sum(L(j,1:j-1).*L(j,1:j-1); end endend L_T = L.; for i = 1: 1:dim if i = 1 y(1) = B(1) / L(1,1); else y(i) = (B(i) -sum(L(i,1:(i-1).*y(1:(i-1)/L(i,i); endend for i = dim:-1: 1 if i = dim x(i) = y(i)/L(i,i); else x(i) = (y(i) - sum(L(i+1):dim,i).*x(i+1):dim)/L(i,i); end % disp() %disp(x(i)enddisp(x)disp(x)结果:x 52.2500 -38.7500 30.7500 -52.75006. 用追赶法编制程序求解方程组Ax=b,其中,代码:%t6-%A = 4 2 0 0 3 -2 1 0 0 2 5 3 0 0 -1 6 ;B = 6 2 10 5;B = B.;dim = size(A,1); c = zeros(1,(dim-1);a = zeros(1,dim);b = zeros(1,dim);f = zeros(dim,1);y = zeros(dim,1);% computation for matrix L and Uc(1) = A(1,2);b(1) = A(1,1);for i = 2:(dim -1) c(i) = A(i,(i+1); a(i) = A(i,(i-1)/b(i-1); b(i) = A(i,i)- a(i)*A(i-1),i);end a(dim) = A(dim,(dim-1)/b(dim-1);b(dim) = A(dim,dim) - a(dim)*A(dim-1),dim);% end of computation L and U %Ax= f A= LU LUx = f%Ly = fy(1) = B(1);for i =2:dim y(i) = B(i) - a(i)*y(i-1);enddisp(y)disp(y)%end of Ly = ff(dim) = y(dim)/b(dim);for i = (dim-1):-1:1 f(i) = (y(i) - A(i,(i+1)*f(i+1)/b(i);end disp(f)disp(f)%Yx = f%end of Ux = y%disp(c)%disp(c)%disp(a)%disp(a)%disp(b)%disp(b)%disp(f)%disp(f)结果:f 1 1 1 17. 已知.编程求解矩阵A的QR分解;代码function Q,R=qrhouseholder(A)dim=size(A,1);R=A;Q=eye(dim);for i=1:(dim-1) x=R(i:dim,i); y=1;zeros(dim-i,1); Ht=householder(x,y); H=blkdiag(eye(i-1),Ht); Q=Q*H; R=H*R;end end function H,rho=householder(x,y)x=x(:);y=y(:);if length(x)=length(y) error(The Column Vectors X and Y Must Have The Same Length!);endrho=-sign(x(1)*norm(x)/norm(y);y=rho*y;v=(x-y)/norm(x-y);I=eye(length(x);H=I-2*v*v; end 结果:C = 1.0000 1.0000 0 0 -1.0000 3.0000 -0.5000 0.5000 -2.0000 2.0000 1.5000 0.5000 -2.0000 2.0000 -0.5000 2.5000 Q,R= qrhouseholder(C)Q = -0.3162 -0.7071 -0.2582 0.5774 0.3162 -0.7071 0.2582 -0.5774 0.6325 -0.0000 -0.7746 -0.0000 0.6325 -0.0000 0.5164 0.5774R = -3.1623 3.1623 0.4743 2.0555 0.0000 -2.8284 0.3536 -0.3536 0.0000 0.0000 -1.5492 1.0328 -0.0000 -0.0000 -0.0000 1.15478. 分别应用Jacobi迭代法和Gauss-Seidel迭代法求解如下方程组Jacobi代码A = 4 1 1 4 8 1 2 1 5B = 7 21 15;B = B.;dim = size(A,1);x = zeros(1,dim);px = zeros(1,dim)disp(x)disp(x)%disp(D)%disp(D)n = input(请输入迭代次数);if n = 1 for i = 1:1:n for j = 1:1:dim temp = 1/A(j,j) px(j) = x(j) +temp *(B(j) -sum(A(j,1:dim).*x(1:dim); end x = px; endelse disp(迭代次数不符合规范)enddisp(x)disp(x)请输入迭代次数:10x 0.6623 1.9949 2.3284Gauss-seidel代码A = 4 1 1 4 8 1 2 1 5B = 7 21 15;B = B.;dim = size(A,1);x = zeros(1,dim);disp(x)disp(x)%disp(D)%disp(D)n = input(please input number of iterations:); for i = 1:1:n for j = 1:1:dim temp = 1/A(j,j) x(j) = x(j) +temp *(B(j) -sum(A(j,1:dim).*x(1:dim); end enddisp(x)disp(x)结果x 0.6667 2.0000 2.33339. 分别应用Newton迭代法和割线法计算(1)非线性方程在1,2上的一个根;(2)在-4,-3上的一个根。Newton迭代法(1)%t9-newton-iteration%f = 2*(x3) - 5*x -1;%f_= 6 *(x2) - 5;x0 = 0;x1 = 1.1;while 1 x0 = x1; if(6*(x02)-5 =0) x1 = x0 -(2*(x03)- 5*x0 -1)/(6*(x02)-5); else disp(can not use this method ) break; end if(abs(x1-x0)0.0005) break endenddisp(x1)disp(x1)结果x11.6730(2)%t9-newton-iteration%f = 2*(x3) - 5*x -1;%f_= 6 *(x2) - 5;%f= exp(x)*sin(x)%f_ = exp(x)*(sin(x) + cos(x)x0 = 0;x1 = -3.4;while 1 x0 = x1; % x1 = x0 -(2*(x03)- 5*x0 -1)/(6*(x02)-5); x1 = x0 - exp(x0)*sin(x0)/(exp(x0)*(sin(x0)+cos(x0); if(abs(x1-x0)0.00005) break endenddisp(x1)disp(x1)结果:x1 -3.1416Newton截断法(1)代码%t9-newton-hypotenuse%f= exp(x)*sin(x)%f_ = exp(x)*(sin(x) + cos(x)%f = 2*(x3) - 5*x -1;%f_= 6 *(x2) - 5;%x1 = -3.4;%x0= -3.5;x0 = 1.8;x1 = 1.7;while 1 %x2 = x1 - exp(x1)*sin(x1)*(x1-x0)/(exp(x1)*sin(x1)- exp(x0)*sin(x0); x2 = x1 - (2*(x13)- 5* x1 -1)*(x1-x0)/(2*(x13)- 5* x1 -1)- (2*(x03)- 5* x0 -1) if abs(x2-x1)0.00005 break; else x0 = x1; x1 = x2; endenddisp(x2);disp(x2)结果x2 1.6730(2)%t9-newton-hypotenuse%f= exp(x)*sin(x)%f_ = exp(x)*(sin(x) + cos(x)x1 = -3.4;x0= -3.5; while 1 x2 = x1 - exp(x1)*sin(x1)*(x1-x0)/(exp(x1)*sin(x1)- exp(x0)*sin(x0); if abs(x2-x1)= b disp(wrong number) flag = 0; else fa = a*cos(a) -2; fb = b * cos(b) -2; if fa *fb 0 disp(there is no adequate conditions to judge) flag = 0 else m = (a +b)/2; if (b-a) accuracy flag = 0; else fm = m*cos(m) -2; if fa* fm 0 b = m; else a = m; end end end endenddisp(root)disp(m)结果:root -2.4988e+00011. 已知函数,在-5,5上分别取2,1,为单位长度的等距节点作为插值节点,用Lagrange方法插值,并把原函数图与插值函数图比较,观察插值效果代码:%t11 -lagrange %-5 5% 2,1 1/2%1/(1 + x2)%step = input(please input length of step:);a = -5;b = 5; n = (b
温馨提示
- 1. 本站所有资源如无特殊说明,都需要本地电脑安装OFFICE2007和PDF阅读器。图纸软件为CAD,CAXA,PROE,UG,SolidWorks等.压缩文件请下载最新的WinRAR软件解压。
- 2. 本站的文档不包含任何第三方提供的附件图纸等,如果需要附件,请联系上传者。文件的所有权益归上传用户所有。
- 3. 本站RAR压缩包中若带图纸,网页内容里面会有图纸预览,若没有图纸预览就没有图纸。
- 4. 未经权益所有人同意不得将文件中的内容挪作商业或盈利用途。
- 5. 人人文库网仅提供信息存储空间,仅对用户上传内容的表现方式做保护处理,对用户上传分享的文档内容本身不做任何修改或编辑,并不能对任何下载内容负责。
- 6. 下载文件中如有侵权或不适当内容,请与我们联系,我们立即纠正。
- 7. 本站不保证下载资源的准确性、安全性和完整性, 同时也不承担用户因使用这些下载资源对自己和他人造成任何形式的伤害或损失。
最新文档
- 2026-2027学年上学期单元测试高一化学试卷
- 2026-2027学年上学期单元测试七年级数学试卷打印版
- 2025计算机三级数据库技术培优练习题及答案
- 2025法律职业资格刑诉法仿真模拟卷及答案
- 哪里能找到专业的生长因子品牌类型
- 化工铅玻璃观察窗铅框密封施工
- 机械加工车间操作规范与效率考核表
- 审批采购设备清单函(3篇)范文
- 合作伙伴关系终止函3篇
- 确认系统维护时间函(4篇)范文
- 《隧道施工与管理》全套教学课件
- T/ZACM 001-2025脑卒中后吞咽障碍耳穴压豆技术
- EPC项目图纸会审与深化方案
- 2026吸入制剂技术突破与呼吸系统药物开发报告
- DB32-T 5434-2026 太湖流域农业面源污染负荷评估规范
- 初中数学九年级上册圆的基本概念知识清单
- 2026年内江市科级干部任职资格考试题库附答案
- ISO14644-5-2025洁净室及相关受控环境-第5部分运行中文版
- 遵义会议放光辉混声合唱谱
- 晕针患者麻醉管理
- 呼吸困难患者护理试题(带答案)
评论
0/150
提交评论