Lecture6.1: Whatwewillnot betalkingabout
Optimization and Computational Linear Algebra for Data ScienceLéo Miolane
Lecture6.1: Whatwewillnot betalkingabout Optimization and - - PowerPoint PPT Presentation
Lecture6.1: Whatwewillnot betalkingabout Optimization and Computational Linear Algebra for Data Science Lo Miolane Warning / Home works 1 exams . 1/6 The determinant There exists a function det : R n n R called the determinant
Lecture6.1: Whatwewillnot betalkingabout
Optimization and Computational Linear Algebra for Data ScienceLéo Miolane
Warning
1/6/ Homeworks 1 exams
.The determinant
2/6There exists a function det : Rn×n → R called the determinant that verifies det(M) = 0 ⇐ ⇒ M is not invertible. The determinant can be computed using the following formula: det(M) =
ÿ
σ∈Sn‘(‡)
nŸ
i=1Mi,σ(i) =
=rrorqdeu
:L
" -y -
,
numbers
1,2 -
g
Exe :
n=4
,2341
is
a
)
depending
ah t .
amodeling of
t .
. - - 4Geometrical interpretation
3/6£2
A=f¥?dD)
/detlA=ad-bI
Vz
I detest
= laddel
⇒
A
⇐s
Va , vz
lin
.dep
.⇐
A is not invertible
Link with eigenvalues
4/6X
is
aneigenvalue
rot Kala - did) ⇒
there exists
vto
such
that Ao
.⇒
Kala
⇐s A
is
not
invertible
.⇐
det ( A
O
X
that
we writeThe characteristic polynomial
5/6)
is
a
polynomial
in
se .Ed: Let's
consider
A = (ta z)
Pala)
=det CA
det ( FIFA)
=( n -a)( 2-a)
is called
the
characteristic polynomial of A
its
roots
are
the
eigenvalues of A
.hence
A
has at
most
n distincteigenvalues
.Example
6/6 I 1Let's
take A=fy ;
for D= Tk
i 'Pala)
=det CA
det ( IIe)
= Ia2tIaER
,Pala
) = htt 71 70
Hence
A-
does
not have
any real eigenvalues
.a.Ztt
=C-1) t 1
= 0i
is
a
complex eigenvalue
(