Análisis empírico de algoritmos de inversión de matrices, aplicados al cálculo de propiedades moleculares
In this article, the performance of two algorithms for matrix inversión are evaluated considering as a parameter the times of execution: one traditionally used in the calculations of molecular properties and a new one implemented in our research group, that makes use of a series development of matri...
Guardado en:
| Autores principales: | , , |
|---|---|
| Formato: | Artículo revista |
| Lenguaje: | Español |
| Publicado: |
Facultad de Ciencias Exactas y Naturales y Agrimensura
2000
|
| Materias: | |
| Acceso en línea: | https://revistas.unne.edu.ar/index.php/fce/article/view/7406 |
| Aporte de: |
| Sumario: | In this article, the performance of two algorithms for matrix inversión are evaluated considering as a parameter the times of execution: one traditionally used in the calculations of molecular properties and a new one implemented in our research group, that makes use of a series development of matrix elements. Different platforms, operating sistems, compilers and subroutines of lineal algebra (BLAS) were investigated. Calculations for model compounds that require the treatment of matrix containing a number of elements between 80.000 and 4.000.000 was carried out. The calculation of molecular properties of both, singlet and triplet type was used to evaluate the execution time of these algorithms. It was observed that the performance of the series algorithm increases when the dimension of the given matrix grows. For all plataforms, a gainful performance of the series was obtained, compared to the tradicional algorithm. |
|---|