165M2 · Linear algebra · extension

Matrices of Order Two and Three

Matrices of Order Two and Three

Linear algebra extension. Matrices of Order Two and Three. Use REG Lin. First enter order n=2 or 3, then operation 1=determinant, 2=inverse, 3=solve. Enter matrix entries row by row; for solving, follow with the right-hand vector. Inverse mode outputs det(A), then every inverse entry row by row. Solve mode gives x,y or x,y,z. The three-dimensional branch clears statistical data with statistics reset. Record important data first. The program occupies 619 of the shared 680 bytes, leaving 61 if installed alone.

  • 619 bytes
  • REG Lin mode
01

Worked examples

Example 1

Original exercise. Linear algebra extension. Data: 3x+2y=34; 2x+5y=41. Find: x,y; Au=b. Calculate all requested quantities in the stated order.

Answer
(x,y)=(8,5)
Standard solution (without a calculator)
  1. Build the mathematical model and substitute the data.
  2. A=[[3,2],[2,5]]; b=[34,41]ᵀ
  3. det(A)=3×5−2×2=11≠0
  4. x=(34×5−2×41)/11=8; y=(3×41−2×34)/11=5
  5. 3×8+2×5=34; 2×8+5×5=41
  6. Combine the preceding results to obtain the answer.
Do it on the calculator

Example 2

Original exercise. Linear algebra extension. Data: A=[[1,2,3],[0,1,4],[5,6,0]]. Find: det(A), A⁻¹; AA⁻¹=I₃. Calculate all requested quantities in the stated order.

Answer
det(A)=1; A⁻¹=[[-24,18,5],[20,-15,-4],[-5,4,1]]
Standard solution (without a calculator)
  1. Build the mathematical model and substitute the data.
  2. A=[[1,2,3],[0,1,4],[5,6,0]]
  3. det(A)=1(0−24)−2(0−20)+3(0−5)=1
  4. C=[[-24,20,-5],[18,-15,4],[5,-4,1]]; adj(A)=Cᵀ
  5. A⁻¹=[[-24,18,5],[20,-15,-4],[-5,4,1]]
  6. AA⁻¹=[[−24+40−15,18−30+12,5−8+3],[20−20,−15+16,−4+4],[−120+120,90−90,25−24]]=I₃
  7. Combine the preceding results to obtain the answer.
Do it on the calculator

Example 3

Original exercise. Linear algebra extension. Data: 2x+y−z=2; x+3y+2z=11; −2y+5z=13. Find: x,y,z; Au=b. Calculate all requested quantities in the stated order.

Answer
(x,y,z)=(2,1,3)
Standard solution (without a calculator)
  1. Build the mathematical model and substitute the data.
  2. A=[[2,1,−1],[1,3,2],[0,−2,5]]; b=[2,11,13]ᵀ
  3. det(A)=38−5+2=35≠0
  4. det(A₁)=70; det(A₂)=35; det(A₃)=105
  5. (x,y,z)=(70,35,105)/35=(2,1,3)
  6. 2×2+1−3=2; 2+3×1+2×3=11; −2×1+5×3=13
  7. Combine the preceding results to obtain the answer.
Do it on the calculator
02

When to use it

Linear algebra extension. Matrices of Order Two and Three. Use REG Lin. First enter order n=2 or 3, then operation 1=determinant, 2=inverse, 3=solve. Enter matrix entries row by row; for solving, follow with the right-hand vector. Inverse mode outputs det(A), then every inverse entry row by row. Solve mode gives x,y or x,y,z. The three-dimensional branch clears statistical data with statistics reset. Record important data first. The program occupies 619 of the shared 680 bytes, leaving 61 if installed alone.

Input order

  • X=n∈{2,3}
  • M=1: det(A); M=2: A⁻¹; M=3: Au=b
  • A=(aᵢⱼ), i=1,…,n; j=1,…,n
  • M=3: b₁,…,bₙ
  • Enter every required value again, including 0. Blank EXE retains memory; it is not zero. Used registers and Ans are overwritten.

Output order

  • M=1: det(A)
  • M=2: det(A),a⁻¹₁₁,…,a⁻¹ₙₙ
  • M=3: x,y / x,y,z
  • Record the value and press EXE.
  • The program has ended. Press AC to leave; EXE runs it again.

Conditions and limitations

  • n=2/3; M=1/2/3; aᵢⱼ,bᵢ∈ℝ
  • 619+61=680 bytes
  • Use REG Lin. First enter order n=2 or 3, then operation 1=determinant, 2=inverse, 3=solve. Enter matrix entries row by row; for solving, follow with the right-hand vector. Inverse mode outputs det(A), then every inverse entry row by row. Solve mode gives x,y or x,y,z. The three-dimensional branch clears statistical data with statistics reset. Record important data first. The program occupies 619 of the shared 680 bytes, leaving 61 if installed alone.
  • For a singular inverse, 0 is followed by −1. For two-variable solving, −3 means no solution and −2 infinitely many; three-variable solving returns only −4 for no unique solution. Invalid order or operation gives −9. Negative entries and roots are valid: identify a status from the selected branch and number of screens. Near-singular or large matrices may lose precision; verify Ax=b or AA⁻¹=I by hand.
  • Enter every required value again, including 0. Blank EXE retains memory; it is not zero. Used registers and Ans are overwritten.
  • Finite precision can lose small differences between large numbers or probabilities extremely near 0 or 1. An error marker is never a valid answer.

Sign in to unlock the full programme

Checking access…

The programme code and appendix unlock together.

Checking access…

Sign in to unlock the full programme

Checking access…

The programme code and appendix unlock together.