Algoritmo para Redução da Banda de Matrizes Simétricas Esparsas

Abstract

A simple but efficient automatic algorithm for reducing the bandwidth of symmetric sparse connectivity matrices like stiffness matrix and water distribution network is presented.
The procedure takes an arbitrary input sequence and creates a new sequence for complex network systems by renumbering the node labels looking for an optimal bandwidth. Thus, considerable improvement for computer storage and time is achieved in the solution of the systems
Several examples are presented to demonstrate the reliability and the efficiency of the method.