maple解答
合集下载
- 1、下载文档前请自行甄别文档内容的完整性,平台不提供额外的编辑、内容补充、找答案等附加服务。
- 2、"仅部分预览"的文档,不可在线预览部分如存在完整性等问题,可反馈申请退款(可完整预览的文档不适用该条件!)。
- 3、如文档侵犯您的权益,请联系客服反馈,我们会尽快为您处理(人工客服工作时间:9:00-18:30)。
restart; with(LinearAlgebra): x:=Vector[row]([x_1,x_2,x_3]); y :=Transpose(x); A:= Matrix([[3,2,4],[2,0,2],[4,2,3]]);
Eigenvalues(A,output=list); r,v:=Eigenvectors(A); w:=Column(v,1..3); B:=convert(GramSchmidt([w],normalized),Matrix); T:=evalm(B^(-1)&*A&*B); Q:=simplify(evalm(x&*T&*y));
restart; with(linalg): A:=Matrix(4,4,[[6,2,1,-1],[2,4,1,0],[1,1,4,-1],[-1,0,-1,3]]); b:=Vector(4,[6,1,5,-5]); jie:=linsolve(A,b);
restart; f:=a*x^3+b*x^2; f1:=diff(f,x): g:=diff(f1,x); jie:=solve({g=0,f=y,x=1,y=3},{a,b,x,y}); subs(jie,[a,b]);
restart; with(LinearAlgebra): a:=RandomVector(3); b:=RandomVector(3); c:=RandomVector(3); A:=Matrix([a,b,c]); d:= Vector(3, [0, 0, 0]); 解 := L i n e a r S o l v e ( A , d ) ; 行列式的值:= D e t e r m i n a n t ( A ) ;如果行列式的值为0 ,那么线性相关, 否 则, 线性无关;
evalf(%);
restart; f:=proc(x) if x<-Pi then -x-Pi elif (x>=-Pi) and (x<=Pi) then sin(x) else (x-Pi)/2 end if end proc:plot(f,-6..6);
restart; evalf(abs(c*a+(-1)*b+d)/sqrt(c^2+1));
restart; evalf(sum(1/k,k=1..1000)-ln(1000));
resห้องสมุดไป่ตู้art; limit((1+1/n)^n,n=infinity);
restart; sum(k^4,k=1..n);
restart; with(LinearAlgebra):
a:=RandomVector[row](3); b:=RandomVector[row](3); c:=DotProduct(a,b); d:=norm(a,2); e:=norm(b,2); VectorAngle(a,b);
restart; datax:=[-Pi,-Pi/2,0,Pi/2,Pi]; datay:=[0,-1,0,1,0]; p:=interp(datax,datay,x); plot([sin(x),p],x=-Pi..Pi);
restart; rsolve({f(n)=f(n-1)+n^2,f(1)=1},f(n)): factor(%); rs restart; evalf(abs(3*3+0*(-7)+(-1)*5+(-12))/sqrt(3^2+(-7)^2+5^2),15);
restart; with(linalg): A:=vector([1,1,-1]); B:=vector([2,-2,2]); C:=vector([1,-1,2]); M:= vector([x,y,z]); a:=evalm(B-A); b:=evalm(C-A); c:=evalm(M-A); N:=concat(c,a,b): T:=transpose(N); s:=det(T): t:=sort(s); print(t=0);
restart; a:=evalf(sqrt(2),101): b:=frac(a); Digits:=1000: d:=[seq(trunc(b*10^n)-10*trunc(b*10^(n-1)),n=1..100)]; s:=proc(n) local i,total; total:=0; for i to n do total:=total+d[i] end do; total end proc: he:=s(100); pingjun:=evalf((1/100)*he,4);
r e s t a r t ;w i t h ( l i n a l g ) : Q : = M a t r i x ( [ [ 1 , - 1 / 2 , - 4 / 5 ] , [ 1 / 2 , 1 , - 2 / 5 ] , [ 1 , 0 , 1 ] ] ) ; P : = t r a n s p o s e ( Q ) ; e v a l m ( Q & * P ) ; i n v e r s e ( Q ) ; (不做的) ;
restart; r:=series(sin(x),x=0,15): s:=series(cos(x),x=0,6): p:=convert(r,polynom); q:=convert(s,polynom); s:=quo(p,q,x); r:=rem(p,q,x);
restart; with(LinearAlgebra): A:=Matrix(9,9,(i,j)->10*i+j); r:=Rank(A);
restart; f1:=2/3*x^(3/2); f:=diff(f1,x); s:=int(sqrt(1+f^2),x=a..b);
restart; x:=diff(a*(t-sin(t)),t); y:=diff(a*(1-cos(t)),t); s:=int(sqrt(x^2+y^2),t=0..2*Pi);
restart; with(LinearAlgebra): A:=RandomVector(2); B:=RandomVector(2); C:=RandomVector(2); AB:=norm(evalm(A-B),2); AC:=norm(evalm(A-C),2); d:= evalm(B-A): e:= evalm(C-A): f:= convert(d,Vector); g:=convert(e,Vector); theta:=VectorAngle(f,g): MianJi:=evalf((1/2)*AB*AC*sin(theta));
restart; s:=proc(n) local i,t; for i from 0 to n do t:=[seq(binomial(i,j),j=0..i)]; op(t); print(%); end do; end proc: s(10);
restart; f:=x^3*sin(x)+x^2/3+x*cos(x): plot(f,x=-2..1); solve(f=0,x):
restart; with(LinearAlgebra): A:=Matrix(9,9,(i,j)->i^(j-1)); B:=VandermondeMatrix([1,2,3,4,5,6,7,8,9],9,9); Determinant(A);
restart; f:=(x,y)->exp(x+y)+sin(x^2+y^2); f(1,2):=evalf(f(1,2)); f:=exp(x+y)+sin(x^2+y^2); subs(x=1,y=2,f): f:=evalf(%); f:=proc(x,y) exp(x+y)+sin(x^2+y^2) end proc; f(1,2):=evalf(f(1,2) ) ;
restart; (s1,s2):=solve({y^2=2*x,y=x-4},{x,y}); a:=subs(s1,y); b:=subs(s2,y); f:=solve(y^2=2*x,x);
g:=solve(y=x-4,x); mianji:=int(int(1,x=f..g),y=a..b);
restart: with(student): f:=1/(1+x^2); s1:=middlesum(f,x=0..1); s2:=trapezoid(f,x=0..1); s3:=simpson(f,x=0..1); evalf(s1); evalf(s2); evalf(s3); int(1/(1+x^2),x=0..1); evalf((s1+s2+s3)*4/3);
Maple assignments.
restart; evalf(Pi,20); evalf(exp(1),20); evalf(gamma,20);
restart; a:=[seq(-Pi+n*Pi/10,n=0..20)]; map(sin,a);
restart; evalf(sum(1/k^2,k=1..1000)-Pi^2/6);