CUT Institutional Repository

Automating Upper Triangular Matrix Neutralisation for Minimal Error

Show simple item record

dc.contributor.author Samambgwa, Henry
dc.contributor.author Musora, Thomas
dc.date.accessioned 2026-05-07T09:35:32Z
dc.date.available 2026-05-07T09:35:32Z
dc.date.issued 2025-11-18
dc.identifier.citation Samambgwa, H., & Musora, T. (2025). Automating upper triangular matrix neutralisation for minimal error. World Journal of Advanced Engineering Technology and Sciences. en_US
dc.identifier.issn https://doi.org/10.30574/wjaets.2025.17.3.1561
dc.identifier.uri https://ir.cut.ac.zw:8080/xmlui/handle/123456789/737
dc.description.abstract This study develops and tests a MATLAB program for neutralising systems with upper triangular coefficient matrices. Augmented matrices for systems of linear equations are reduced to produce a neutral (identity matrix) left hand side, at which point the right hand side has the solutions for the system. A strategy for minimal error is pursued, where elimination operations must be completed in one step for each number. The strategy was expressed in pseudocode, a flowchart developed, and then the program was coded in MATLAB. The program was tested for four sample augmented matrices of varying sizes. The results demonstrated that the program was 100% accurate. The technique can be applied to any square matrix system, since any square matrix can be expressed as an upper triangular matrix. The automation of matrix operations and achievement of 100% accuracy allows for the use of the program for very large data sets, extending the potential for research with accurate finding. en_US
dc.language.iso en en_US
dc.publisher World Journal of Advanced Engineering Technology and Sciences, en_US
dc.subject Upper Triangular Matrix en_US
dc.subject MATLAB Programing en_US
dc.subject Algorithm; Source Code en_US
dc.title Automating Upper Triangular Matrix Neutralisation for Minimal Error en_US
dc.type Article en_US
dc.identifier.orcid 0009-0001-6197-1156 en_US


Files in this item

This item appears in the following Collection(s)

Show simple item record

Search DSpace


Advanced Search

Browse

My Account