An Efficient Implementation of the First Least-Connected Node Strategy

Abstract

The implementation of a new algorithm that partitions matrices to a specific block lower-triangular form was carried out. The method was specially designed for applications to process plant instrumentation. Its main feature is its capacity to deal with structurally singular matrices. The software was implemented in C language, the resulting code being highly portable and efficient. In this respect, the run-times for a series of examples executed under different platforms are presented.