BANDWIDTH REDUCTION ON SPARSE MATRICES BY INTRODUCING NEW VARIABLES
A sparse matrix bandwidth reduction method is analyzed. It consists of equation splitting, substitution and introducing new variables, similar to the substructure decomposition in the finite element method (FEM). It is especially useful when the bandwidth cannot be reduced by strategically interchan...
| Autor: | |
|---|---|
| Tipo de recurso: | artículo |
| Estado: | Versión publicada |
| Fecha de publicación: | 2010 |
| País: | Chile |
| Institución: | CONICYT Chile |
| Repositorio: | SciELO Chile |
| OAI Identifier: | oai:scielo:S0718-33052010000300013 |
| Acceso en línea: | http://www.scielo.cl/scielo.php?script=sci_arttext&pid=S0718-33052010000300013 |
| Access Level: | acceso abierto |
| Palabra clave: | Sparse matrix bandwidth representative volume element (RVE) homogenization kinematic minimal boundary conditions |
| Sumario: | A sparse matrix bandwidth reduction method is analyzed. It consists of equation splitting, substitution and introducing new variables, similar to the substructure decomposition in the finite element method (FEM). It is especially useful when the bandwidth cannot be reduced by strategically interchanging columns and rows. In such cases, equation splitting and successive reordering can further reduce the bandwidth, at cost of introducing new variables. While the substructure decomposition is carried out before the system matrix is built, the given approach is applied afterwards, independently on the origin of the linear system. It is successfully applied to a sparse matrix, the bandwidth of which cannot be reduced by reordering. For the exemplary FEM simulation, an increase of performance of the direct solver is obtaine. |
|---|