⎡ ⎤

1 Exercice 1 3 2 5 2
> restart; ⎢ 2 0 −2 −2 ⎥
⎢ ⎥
> with(linalg): ⎣ 5 −2 0 1 ⎦
> A1:=matrix(4,4,[0,1,1,1,1,0,-1,-1,1,-1,0,-1,1,-1,-1,0]); 2 1 −2 0
⎡ ⎤ > inverse(A1);
0 1 1 1 ⎡ ⎤
⎢ 1 0 −1 −1 ⎥ 2 1 1 1
A1 := ⎢⎣ 1 −1
⎥ ⎢ ⎥
0 −1 ⎦ ⎢ 3 3 3 3 ⎥
1 −1 −1 ⎢ 1 2 −1 −1 ⎥
0 ⎢ ⎥
⎢ 3 3 3 3 ⎥
> evalm(A1); ⎢ ⎥
⎡ ⎤ ⎢ 1 −1 2 −1 ⎥
⎢ ⎥
0 1 1 1 ⎢ ⎥
⎢ 1 −1 −1 ⎥ ⎢ 3 3 3 3 ⎥
⎢ 0 ⎥ ⎣ 1 −1 −1 2 ⎦
⎣ 1 −1 0 −1 ⎦
1 −1 −1 0 3 3 3 3
> transpose(A2);
> A2:=matrix([[1,0,1,0],[0,0,0,0],[1,0,0,1],[0,1,0,0]]); ⎡ ⎤
⎡ ⎤ 1 0 1 0
1 0 1 0 ⎢ 0
⎢ 0 0 0 0 ⎥ ⎢ 0 0 1 ⎥
⎥
A2 := ⎢ ⎥ ⎣ 1 0 0 0 ⎦
⎣ 1 0 0 1 ⎦
0 0 1 0
0 1 0 0

2 Exercice 2
> scalarmul(A1,3);
⎡ ⎤
0 3 3 3
⎢ 3 ⎥
> restart;with(linalg):
⎢ 0 −3 −3 ⎥
⎣ 3 −3 0 −3 ⎦
> A:=matrix(3,3,[1,-1,2,-2,1,0,1,1,3]);
⎡ ⎤
3 −3 −3 0 1 −1 2
> matadd(A1,A2); ⎣
A := −2 1 0 ⎦
⎡ ⎤ 1 1 3
1 1 2 1
⎢ 1 0 −1 −1 ⎥
> TA:=transpose(A);
⎢ ⎥ ⎡ ⎤
⎣ 2 −1 0 0 ⎦ 1 −2 1
1 0 −1 0 TA := ⎣ −1 1 1 ⎦
> multiply(A1,A2); 2 0 3
⎡ ⎤ > multiply(A,multiply(TA,A));
1 1 0 1 ⎡ ⎤
⎢ 0 −1 1 −1 ⎥ 18 −3 30
⎢ ⎥
⎣ 1 −1 1 0 ⎦ ⎣ −14 7 −9 ⎦
0 0 1 −1 19 4 45
> evalm(A2&*A1); > det(A);
⎡ ⎤
1 0 1 0 −9
⎢ 0 0 0 0 ⎥ > inverse(A);
⎢ ⎥
⎣ 1 0 0 1 ⎦ ⎡ −1 −5 2 ⎤
1 0 −1 −1 ⎢ 3 9 9 ⎥
⎢ ⎥
> matadd(scalarmul(A1,2),scalarmul(A2,3)); ⎢ −2 −1 4 ⎥
⎢ ⎥
⎢ 3 9 9 ⎥
⎣ ⎦
1 2 1
3 9 9
 > rank(A); > evalm(Q &* K &* Q^(-1));
⎡ ⎤
3 0 1 1 1
> kernel(A); ⎢ 1 0 −1 −1 ⎥
⎢ ⎥
{} ⎣ 1 −1 0 −1 ⎦
> trace(A); 1 −1 −1 0
5
> colspace(A); 4 Exercice 4
> restart;
{[0, 0, 1], [0, 1, 0], [1, 0, 0]}
> with(linalg):
> evalm(A&^3);
⎡ ⎤ > A:=matrix([[58, 52, 36], [-29, 187, 9], [-145, 65, 219]]);
13 3 34 ⎡ ⎤
⎣ −14 3 −20 ⎦ 58 52 36
7 12 37 A := ⎣ −29 187 9 ⎦
−145 65 219
> eigenvals(A);
> eig:=eigenvects(A);
−1, 3, 3    
−13 29
> eigenvects(A); eig := [116, 1, {[4, 1, 5]}], [174, 2, { 0, 1, , 1, 0, }]
9 9
[−1, 1, {[−2, −2, 1]}], [3, 2, {[2, −2, 1]}]
> J:=jordan(A,’P’);
> charpoly(A,x); ⎡ ⎤
116 0 0
x3 − 5 x2 + 3 x + 9 J := ⎣ 0 174 0 ⎦
3 Exercice 3 0 0 174
> restart; > evalm(P);
⎡ −20 9 ⎤
> with(linalg): 2
⎢ 29 29 ⎥
> M:=matrix(4,4,[0,1,1,1,1,0,-1,-1,1,-1,0,-1,1,-1,-1,0]); ⎢ ⎥
⎡ ⎤ ⎢ 1 −1 ⎥
0 1 1 1 ⎢ 0 ⎥
⎢ 2 2 ⎥
⎢ 1 0 −1 −1 ⎥ ⎣ ⎦
M := ⎢
⎣ 1 −1
⎥ 5 −3
0 −1 ⎦ 1
2 2
1 −1 −1 0 > puiss:=x->x^n;
> K:=jordan(M,’Q’);
⎡ ⎤ puiss := x → xn
−3 0 0 0 > # La fonction map permet d’appliquer une procdure chaque oprande
⎢ 0 1 0 0 ⎥ > d’une expression ou une fonction
K := ⎢⎣ 0 0 1 0 ⎦
⎥
> Jn:=map(puiss,J);
0 0 0 1 ⎡ ⎤
116n 0 0
> evalm(Q);
⎡ ⎤ Jn := ⎣ 0 174n 0 ⎦
1 11 0 0 174n
⎢ 4 2 1 ⎥
⎢ 4 ⎥ > An:=multiply(evalm(P) , Jn , inverse(evalm(P)));
⎢ −1 1 ⎥
⎢ 0 0 ⎥
⎢ 4 4 ⎥
⎢ ⎥
⎢ −1 5 ⎥
⎢ 1 0 ⎥
⎢ 4 ⎥
⎢ 4 ⎥
⎣ −1 5 ⎦
1 1
4 4
 ⎡ ⎤
26 116n 26 174n 18 116n 18 174n > B := matrix ([[1], [2],[3]]);
⎢ 2 116 − 174 − − ⎡ ⎤
n n
+ + ⎥
⎢ 29 29 29 29 ⎥ 1
⎢ 116n 174n 13 116n 71 174n 9 116n 9 174n ⎥ B := ⎣ 2 ⎦
An := ⎢
⎢ − − + − + ⎥
⎥
⎢ 2 2 58 58 58 58 ⎥ 3
⎣ 5 116n 5 174n 65 116n 65 174n 45 116n 103 174n ⎦ > X :=linsolve(A,B) ;
− − + − + ⎡ ⎤
2 2 58 58 58 58 3
> n:=1;
X := −1 ⎦
⎣
n := 1
5
> map(eval,An);
⎡ ⎤
58 52 36
⎣ −29 187 9 ⎦
−145 65 219
6 Exercice 6
> restart;
> n:=2;
n := 2
> with(linalg):
> A :=matrix(3,3,[0,2,1,0,0,-1,0,m,0]) ;
> map(eval,An); ⎡ ⎤
⎡ ⎤ 0 2 1
−3364 15080 10440
⎣ −8410 34046 2610 ⎦ A := ⎣ 0 0 −1 ⎦
0 m 0
−42050 18850 43326
> n:=5;
> P:=charpoly(A,x) ;
n := 5 P := x (x2 + m)
> map(eval,An); > eval(P, x=3) ;
⎡ ⎤ 27 + 3 m
−117487861472 124164594112 85960103616
⎣ −69245639024 190535843152 21490025904 ⎦ > f:=unapply(P,x) ;
−346228195120 155205742640 266944824144 f := x → x (x2 + m)
5 Exercice 5 > degree(P,x);
> restart; 3
> with(linalg): > coeff(P,x**3);
> solve({x+3*y=1, -2*x-6*y=2}); 1
Sol = ensemble vide. > solve({P=x^3},{m});
> solve({2*x-y=-1, -4*x+2*y=2});
{m = 0}
{x = x, y = 2 x + 1} > assign(%);m;
0
Infinit de solutions, un paramtre : x.
> evalm(A);
> solve({-x+y+z=1, 2*x-y-z=2, 2*x-2*y-z=3}); ⎡ ⎤
0 2 1
{x = 3, y = −1, z = 5} ⎣ 0 0 −1 ⎦
Solution unique. 0 m 0
> A := matrix([[-1,1,1],[2,-1,-1],[2,-2,-1]]);
⎡ ⎤
−1 1 1
A := ⎣ 2 −1 −1 ⎦
2 −2 −1
 > IndiceNilpotence:=proc(M::matrix):: integer; ⎡ ⎤
> local k::integer,N::matrix; 1
> with(linalg); b1 := ⎣ 3 ⎦
> N:=matrix(rowdim(M),coldim(M),(i,j)->0); 6
> k:=1; > g1:=i->sum(k,k=0..i);
> do
> k:=k+1;
i
> if equal(evalm(M&^k),N)=true then g1 := i → k
> break; k=0
> fi; > b1:=Vector(3,g1);
> od; ⎡ ⎤
> return(k); 1
> end; b1 := ⎣ 3 ⎦
6
IndiceNilpotence := proc(M ::linalg : −matrix )::integer ; > DT:=det(A1);
local k::integer , N ::linalg : −matrix ; DT := 2
with(linalg) ; > IV:=inverse(A1);
N := linalg : −matrix (linalg : −rowdim(M ), linalg : −coldim(M ), (i, j) → 0) ; ⎡ ⎤
3 −3 1
k := 1 ; ⎢ −5 −3 ⎥
do k := k + 1 ; if linalg : −equal (evalm(‘&ˆ‘(M, k)), N ) = true then break end if ⎢ 4 ⎥
IV := ⎢ 2 2 ⎥
end do; ⎣ ⎦
1 1
−1
return k 2 2
end proc > RG:=rank(A1);
> IndiceNilpotence(A); RG := 3
3 > solve({x+y+z=1, x+2*y+4*z=3, x+3*y+9*z=6},{x,y,z});
> evalm(A&^3);
1 1
⎡ ⎤ {x = 0, y = ,z= }
0 0 0 2 2
⎣ 0 0 0 ⎦ > evalm(IV &* b1 );
 
0 0 0 1 1
0, ,
7 Exercice 7 2 2
> restart;with(linalg): > x1:=linsolve(A1,b1) ;
 
> A1:=matrix(3,3,[1,1,1,1,2,4,1,3,9]) ; 1 1
⎡ ⎤ x1 := 0, ,
1 1 1 2 2
A1 := ⎣ 1 2 4 ⎦ > Q1:=x1[1]+x1[2]*n+x1[3]*n^2;
1 3 9 1 1
Q1 := n + n2
> f1:=(i,j)->i^(j-1); 2 2
> L1:=diff(Q1,n);
f1 := (i, j) → i(j−1)
1
> A1 :=matrix(3,3,f1); L1 := + n
⎡ ⎤ 2
1 1 1
A1 := ⎣ 1 2 4 ⎦ > A:=p->matrix(p+2,p+2,(i,j)->i^(j-1));
1 3 9
A := p → linalg : −matrix (p + 2, p + 2, (i, j) → i(j−1) )
> b1:=Vector([1,3,6]);
> A(2);
 ⎡ ⎤
1 1 1 1
⎢ 1 2 4 8 ⎥
⎢ ⎥
⎣ 1 3 9 27 ⎦
1 4 16 64
> B:=p->Vector(p+2,i->sum(k^p,k=0..i));

i
B := p → Vector(p + 2, i → kp )
k=0
> B(2);
⎡⎤
1
⎢ 5 ⎥
⎢ ⎥
⎣ 14 ⎦
30
> X:=p->linsolve(A(p),B(p)) ;
X := p → linalg : −linsolve(A(p), B(p))
> X(1);
 
1 1
0, ,
2 2
> Q:=p->sum(X(p)[k]*n^(k-1),k=1..p+2);

p+2
Q := p → X(p)k n(k−1)
k=1
> Q(2);
1 1 1
n + n2 + n3
6 2 3
> factor(%);
n (n + 1) (2 n + 1)
6
> L:=p->diff(Q(p),n);
L := p → d
dn Q(p)
> L(2);
1
+ n + n2
6