Location via proxy:   [ UP ]  
[Report a bug]   [Manage cookies]                
Scribd Logo
Upload

Welcome to Scribd!

  • 13 views

    Note 1

    Uploaded by

    AYAN PANJA
    The document discusses computing the characteristic polynomial and minimal polynomial of a matrix. 1. The characteristic polynomial of a matrix A is obtained by calculating the determinant of (A - λI) where λ is the eigenvalue. This yields a polynomial in λ whose roots are the eigenvalues of A. 2. The minimal polynomial of a matrix is the monic polynomial of lowest degree such that when evaluated at the matrix A yields the zero matrix. 3. The minimal polynomial and characteristic polynomial of a matrix have the same roots, as the roots are the eigenvalues of the matrix.

    Copyright:

    © All Rights Reserved
    Download as PDF, TXT or read online from Scribd

    Note 1

    Uploaded by

    AYAN PANJA
    13 views38 pages
    The document discusses computing the characteristic polynomial and minimal polynomial of a matrix. 1. The characteristic polynomial of a matrix A is obtained by calculating the determinant of (A - λI) where λ is the eigenvalue. This yields a polynomial in λ whose roots are the eigenvalues of A. 2. The minimal polynomial of a matrix is the monic polynomial of lowest degree such that when evaluated at the matrix A yields the zero matrix. 3. The minimal polynomial and characteristic polynomial of a matrix have the same roots, as the roots are the eigenvalues of the matrix.

    Original Title

    NOTE 1

    Copyright

    © © All Rights Reserved

    Available Formats

    PDF, TXT or read online from Scribd

    Did you find this document useful?

    Is this content inappropriate?

    The document discusses computing the characteristic polynomial and minimal polynomial of a matrix. 1. The characteristic polynomial of a matrix A is obtained by calculating the determinant of (A - λI) where λ is the eigenvalue. This yields a polynomial in λ whose roots are the eigenvalues of A. 2. The minimal polynomial of a matrix is the monic polynomial of lowest degree such that when evaluated at the matrix A yields the zero matrix. 3. The minimal polynomial and characteristic polynomial of a matrix have the same roots, as the roots are the eigenvalues of the matrix.

    Copyright:

    © All Rights Reserved
    Download as PDF, TXT or read online from Scribd
    Download as pdf or txt
    13 views38 pages

    Note 1

    Uploaded by

    AYAN PANJA
    The document discusses computing the characteristic polynomial and minimal polynomial of a matrix. 1. The characteristic polynomial of a matrix A is obtained by calculating the determinant of (A - λI) where λ is the eigenvalue. This yields a polynomial in λ whose roots are the eigenvalues of A. 2. The minimal polynomial of a matrix is the monic polynomial of lowest degree such that when evaluated at the matrix A yields the zero matrix. 3. The minimal polynomial and characteristic polynomial of a matrix have the same roots, as the roots are the eigenvalues of the matrix.

    Copyright:

    © All Rights Reserved
    Download as PDF, TXT or read online from Scribd
    Download as pdf or txt
    of 38

    ( Leaden )

    : 1. AYAN PANJAKUM
    roup AR MAHAWAR
    2. BRIJENDRA PRAJAPAT
    KumAR
    3. VIJAY

    2 4. HARSH VARSHNE Y
    5. DEEPENDRA SONI
    6- RAGiHAV PANDEY

    Poynomials & minimal Polynenials.


    Chanactenistit
    Considen the problem for nn

    matriX A,

    The Soution of the problem consists identifying


    pOssible Vades A( Cale he eigene), aud

    He coreapndg non- Zero eetors (Caled the


    Satisfi'es
    eiqevettor) that
    Haat One Caw rewri te

    (A - AI)v =0. -

    This set of n hmgeneos equatiom. Tf


    A-AI invertible matnX, then ne Can
    both sides oy equatiom by (A-AI)
    t Concude that 9=o is the onique souiom,

    By definition, the 2ero Uecto s


    Thus, in ordr to fnd nm-trivjal Henvecto
    Solutions ,
    me must demand that A-AI is not inwe rtible,
    equivalently
    PC)= det (A-AI) = o

    E. 3 is caled the CHARACTE RIS TIC EQUATION.


    Evalating he detenant yields nth
    rde
    poynomlal in , called the haracteristic poynomial,
    have olenoted aboe by PA).
    hh we
    The deteminant (3) Can be evauated by the
    sua methds. takes the f¡rm,

    PCA) det( A-AI) = 421 2h

    !
    ani hn

    + Cn-1 d + Cn

    The Coeffcients Ci ane to be


    9here A = a3)
    the deteminaut
    Comnputed by evaluatirg
    The method of rect Expans ion
    The chanacteristic paynemjal of n nh

    marix KalA) = det (AIn -A) = A-@


    A- 922 .-92n

    n
    there,
    trocea).
    IS the Sum of al first - Ordar
    diogonal minor& of A.
    2

    the Sum of al
    MSecond - orden diagonal mnors of A."
    aig
    the SUm of all third- ord diagoma! minoA
    mino of A,

    so forth Fnay
    det (A)

    there ( ) dagonl minors of orden k n A.


    From this that the direct computation of
    Hnd

    the coe fficient of he Chanacteristic þoynomal of au


    nn matrix is eqwivalent to computing

    (): () (9): + (0) = 2-1

    de terminants of vorios ordes, Lohich generalty


    major task, This has aiven Tise
    sþeoki
    Spelal methods for expan ding chanacteris tic
    to

    poynommial. We shall e xplain Some of these meth oos.

    Example: Compute the characteristic poynomia of A


    2
    A =
    4
    2 1
    1

    We have i

    O1 : 1+1+ 2 =4,

    (-3) + (2) +(-) = -2.


    2 3
    and
    2 1 -4 -17.
    2

    Thus
    Ka (A) =
    = -4A -2A +7
    minimal Poly nom ial:
    poynomial m(*) is sad to be the minimal
    S:3 of A if
    polynomial
    m(A) = 0;
    m(x) is monic poynomial ( The coe fficient
    of the highest deree term 7is 1) gCA)= 0,
    (iii) If poynomial g(*) i's such that
    hen m(x) iuides g«).

    Sorne Importmt Points:

    The minimal poynomial o a metrx is unque.


    °vi des characteris tic
    Pts
    The minímal poynom iad
    polynomial.
    the characteris tic
    The inimal polynomial and
    Sme ro6ts.
    poynomial have the

    Similas matrices have the same mnfmat polynomiala


    Let A e Ma(F) nd A,d2 À3,--Ak e F be al
    Vaes of A,
    here Ar for i J . The
    matrix A is diagomalizable îf awd f ony if
    ts minimal poynom'a is a pro cuct of distipt
    that is, m(*) = (-A)(<-d)- --
    Lfneor poy nomials ; dis tint element
    (z-Ax) where
    of F.
    Theorn:
    The minimal polynomial and the
    oraterini polynomial have Hue Same root.
    Let f ) and mex) be tue e haraeterin
    and Ae minnal poynomjal of a atria
    Them 9 ()m (a.

    Henee d i0 a root of fea

    sely non tria


    d ian eigenvaluQ of eathe
    CA

    amd V PO

    Kin a r oot o m(n).


    (Proved)
    d,
    prove
    8nd oolynomiala
    A minimol Yespect
    ve
    xtnt-t b bo+hi (n)2 w,and
    m
    LeL
    P. matir inert
    be Aome tor PBp - A
    wmat, eie be Band A
    Polynomial.
    minimmo pame tu sen have matries Similar
    Example: Compute the minmal poynomiad of the
    matrix 3
    2
    1 -1

    The Characteristic polynomial of A is detlA -AI)


    3-AJ -1

    2-A
    1 -1 2

    the minimal polynomal P(A) dvides f(t) and


    hawe the Same Zeras So pasATbilities for
    P(a) ahe
    (A -2)(A-3) (A- 2) (A-3).
    if let PC) = 4-2)(A-3) then

    P(A) = (A-2I)(A -3L) = A-5A +6I = o

    Thus PCA) polynomial of Leas t dgree

    Sahis Fying p(A) =0 So the minimal poynomial


    of A
    P(a) = (A-2)(A-3))

    You might also like