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

Welcome to Scribd!

  • 6K views

    Startup Execution: Loading Initial Environment

    Uploaded by

    Jai
    The document shows examples of linear algebra operations on matrices including: finding the rank, reduced row echelon form, eigenvalues and eigenvectors using spec(), and solving systems of linear equations using linsolve(). It demonstrates these operations do not work as expected when the matrices are not full rank or have inconsistent constraints.

    Copyright:

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

    Startup Execution: Loading Initial Environment

    Uploaded by

    Jai
    6K views12 pages
    The document shows examples of linear algebra operations on matrices including: finding the rank, reduced row echelon form, eigenvalues and eigenvectors using spec(), and solving systems of linear equations using linsolve(). It demonstrates these operations do not work as expected when the matrices are not full rank or have inconsistent constraints.

    Original Description:

    fd

    Original Title

    araj2

    Copyright

    © © All Rights Reserved

    Available Formats

    RTF, PDF, TXT or read online from Scribd

    Did you find this document useful?

    Is this content inappropriate?

    The document shows examples of linear algebra operations on matrices including: finding the rank, reduced row echelon form, eigenvalues and eigenvectors using spec(), and solving systems of linear equations using linsolve(). It demonstrates these operations do not work as expected when the matrices are not full rank or have inconsistent constraints.

    Copyright:

    © All Rights Reserved
    Download as RTF, PDF, TXT or read online from Scribd
    Download as rtf, pdf, or txt
    6K views12 pages

    Startup Execution: Loading Initial Environment

    Uploaded by

    Jai
    The document shows examples of linear algebra operations on matrices including: finding the rank, reduced row echelon form, eigenvalues and eigenvectors using spec(), and solving systems of linear equations using linsolve(). It demonstrates these operations do not work as expected when the matrices are not full rank or have inconsistent constraints.

    Copyright:

    © All Rights Reserved
    Download as RTF, PDF, TXT or read online from Scribd
    Download as rtf, pdf, or txt
    You are on page 1of 12

    Startup execution:

    loading initial environment

    -->A=[1 1 0;0 1 1;1 0 1];

    -->B=[-2;1;1];

    -->rank([A B])

    ans =

    3.

    -->C=[1 1 1;1 -1 2;2 3 -1];

    -->D=[4;3;6];

    -->rank([C D])

    ans =

    3.

    -->rref([C D])

    ans =
    1. 0. 0. 2.

    0. 1. 0. 1.

    0. 0. 1. 1.

    -->rref([A B])

    ans =

    1. 0. 0. - 1.

    0. 1. 0. - 1.

    0. 0. 1. 2.

    -->E=[1 3 -1 8;1 1 1 6;3 1 1 11;4 -2 0 0];

    -->F=[13;13;25;6];

    -->linsolve(A,-B)

    ans =

    - 1.

    - 1.

    2.

    -->linsolve(E,-F)

    ans =
    1.

    - 1.

    1.

    2.

    -->linsolve(C,-D)

    ans =

    2.

    1.

    1.

    -->G=[1 1 1;2 -1 3;4 1 5;3 -2 1];

    -->H=[3;1;2;4];

    -->linsolve(G,-H)

    WARNING: Conflicting linear constraints.

    ans =

    []

    -->rank([G H])

    ans =
    4.

    -->G/h

    !--error 4

    Undefined variable: h

    -->G/H

    !--error 266

    A and B must have equal number of columns.

    -->I=[1 1 1 0;2 -1 3 0;4 1 5 0;3 -2 1 0];

    -->linsolve(I,-H)

    WARNING: Conflicting linear constraints.

    ans =

    []

    -->G=[1 1 1;2 -1 3;4 1 5;3 -2 1]

    G =

    1. 1. 1.

    2. - 1. 3.
    4. 1. 5.

    3. - 2. 1.

    -->H=[3;1;2;4]

    H =

    3.

    1.

    2.

    4.

    -->G/H

    !--error 266

    A and B must have equal number of columns.

    -->G\H

    ans =

    2.0151515

    0.4545455

    - 1.1363636

    -->A=[0 0 0 1;0 0 1 2;0 1 2 3;1 2 3 4]

    A =
    0. 0. 0. 1.

    0. 0. 1. 2.

    0. 1. 2. 3.

    1. 2. 3. 4.

    -->M=[0 0 0 1;0 0 1 2;0 1 2 3;1 2 3 4]

    M =

    0. 0. 0. 1.

    0. 0. 1. 2.

    0. 1. 2. 3.

    1. 2. 3. 4.

    -->x=poly(0,'x')

    x =

    -->p=det(x*eye(4,4)-M)

    p =

    2 3 4

    1 + 2x - 7x - 6x + x
    -->roots(p)

    ans =

    6.9613208

    - 1.1216783

    0.4469163

    - 0.2865588

    -->N=[3 1 3;3 4 0;1 4 2]

    N =

    3. 1. 3.

    3. 4. 0.

    1. 4. 2.

    -->[v,e]=spec(M)

    e =

    - 1.1216783 0. 0. 0.

    0. - 0.2865588 0. 0.

    0. 0. 0.4469163 0.

    0. 0. 0. 6.9613208

    v =

    0.4589356 0.5205747 - 0.7111656 0.1123542


    0.6674381 - 0.6806645 - 0.0199182 0.3013725

    0.2809054 0.4934010 0.6267614 0.5336833

    - 0.5147782 - 0.1491753 - 0.3178316 0.7821338

    -->x=poly(0,'x')

    x =

    -->p=det(x*eye(3,3)-N)

    p =

    2 3

    - 42 + 20x - 9x + x

    -->roots(p)

    ans =

    7.

    1. + 2.236068i

    1. - 2.236068i

    -->[v,e]=spec(N)

    e =
    7. 0 0

    0 1. + 2.236068i 0

    0 0 1. - 2.236068i

    v =

    - 0.5773503 - 0.2737854 - 0.5477605i - 0.2737854 + 0.5477605i

    - 0.5773503 - 0.0864586 + 0.4833181i - 0.0864586 - 0.4833181i

    - 0.5773503 0.6196197 0.6196197

    -->O=[2 0 3;0 2 0;0 0 2]

    O =

    2. 0. 3.

    0. 2. 0.

    0. 0. 2.

    -->x=poly(0,'x')

    x =

    -->p=det(x*eye(3,3)-O)

    p =

    2 3
    - 8 + 12x - 6x + x

    -->roots(p)

    ans =

    2.0000132

    1.9999934 + 0.0000114i

    1.9999934 - 0.0000114i

    -->[v,e]=spec(O)

    e =

    2. 0 0

    0 2. 0

    0 0 2.

    v =

    1. 0 - 1.

    0 1. 0

    0 0 1.480D-16

    -->J=[1 0 3;1 2 1;0 0 2]

    J =

    1. 0. 3.
    1. 2. 1.

    0. 0. 2.

    -->x=poly(o,'x')

    !--error 4

    Undefined variable: o

    -->x=poly(0,'x')

    x =

    -->p=det(x*eye(3,3)-J)

    p =

    2 3

    - 4 + 8x - 5x + x

    -->roots(p)

    ans =

    2.

    2.

    1.
    -->[v,e]=spec(J)

    e =

    2. 0 0

    0 1. 0

    0 0 2.

    v =

    0 0.7071068 3.331D-16

    1. - 0.7071068 - 1.

    0 0 1.110D-16

    You might also like