How to resolve the algorithm Cramer's rule step by step in the Maple programming language

Published on 12 May 2024 09:40 PM
#Maple

How to resolve the algorithm Cramer's rule step by step in the Maple programming language

Table of Contents

Problem Statement

Given

which in matrix format is

Then the values of

x , y

{\displaystyle x,y}

and

z

{\displaystyle z}

can be found as follows:

Given the following system of equations:

solve for

w

{\displaystyle w}

,

x

{\displaystyle x}

,

y

{\displaystyle y}

and

z

{\displaystyle z}

, using Cramer's rule.

Let's start with the solution:

Step by Step solution about How to resolve the algorithm Cramer's rule step by step in the Maple programming language

Source code in the maple programming language

with(LinearAlgebra):
cramer:=proc(A,B)
  local n,d,X,V,i;
  n:=upperbound(A,2);
  d:=Determinant(A);
  X:=Vector(n,0);
  for i from 1 to n do
    V:=A(1..-1,i);
    A(1..-1,i):=B;
    X[i]:=Determinant(A)/d;
    A(1..-1,i):=V;
  od;
  X;
end:

A:=Matrix([[2,-1,5,1],[3,2,2,-6],[1,3,3,-1],[5,-2,-3,3]]):
B:=Vector([-3,-32,-47,49]):
printf("%a",cramer(A,B));

You may also check:How to resolve the algorithm Van Eck sequence step by step in the MAD programming language
You may also check:How to resolve the algorithm Compare sorting algorithms' performance step by step in the Kotlin programming language
You may also check:How to resolve the algorithm Middle three digits step by step in the DCL programming language
You may also check:How to resolve the algorithm Prime conspiracy step by step in the Julia programming language
You may also check:How to resolve the algorithm Chowla numbers step by step in the CLU programming language