How to resolve the algorithm Reduced row echelon form step by step in the AutoHotkey programming language

Published on 12 May 2024 09:40 PM

How to resolve the algorithm Reduced row echelon form step by step in the AutoHotkey programming language

Table of Contents

Problem Statement

Show how to compute the reduced row echelon form (a.k.a. row canonical form) of a matrix. The matrix can be stored in any datatype that is convenient (for most languages, this will probably be a two-dimensional array). Built-in functions or this pseudocode (from Wikipedia) may be used: For testing purposes, the RREF of this matrix: is:

Let's start with the solution:

Step by Step solution about How to resolve the algorithm Reduced row echelon form step by step in the AutoHotkey programming language

Source code in the autohotkey programming language

ToReducedRowEchelonForm(M){
    rowCount 	:= M.Count()		; the number of rows in M
    columnCount := M.1.Count()		; the number of columns in M
    r := lead := 1
    while (r <= rowCount) {
        if (columnCount < lead)
            return M
        i := r
        while (M[i, lead] = 0) {
            i++
            if (rowCount+1 = i) {
                i := r, 	lead++
                if (columnCount+1 = lead)
                    return M
            }
        }
        if (i<>r)
            for col, v in M[i]		; Swap rows i and r
                tempVal := M[i, col],	M[i, col] := M[r, col],		M[r, col] := tempVal
        
        num := M[r, lead]
        if (M[r, lead] <> 0)
            for col, val in M[r]
                M[r, col] /= num	; If M[r, lead] is not 0 divide row r by M[r, lead]
            
        i := 2
        while (i <= rowCount) {
            num := M[i, lead]
            if (i <> r)
                for col, val in M[i]	; Subtract M[i, lead] multiplied by row r from row i
                    M[i, col] -= num * M[r, col]
            i++
        }
        lead++,		r++
    }
    return M
}


M :=  [[1 , 2, -1, -4 ]
    , [2 , 3, -1, -11]
    , [-2, 0, -3,  22]]
    
M := ToReducedRowEchelonForm(M)
for row, obj in M
{
    for col, v in obj
        output .= RegExReplace(v, "\.0+$|0+$") "`t"
    output .= "`n"
}
MsgBox % output
return


  

You may also check:How to resolve the algorithm Anonymous recursion step by step in the Rust programming language
You may also check:How to resolve the algorithm Substring/Top and tail step by step in the PureBasic programming language
You may also check:How to resolve the algorithm CSV data manipulation step by step in the PicoLisp programming language
You may also check:How to resolve the algorithm Integer sequence step by step in the Go programming language
You may also check:How to resolve the algorithm Farey sequence step by step in the Arturo programming language