Emmanuel Kamgnia ; Louis Bernard Nguenang - Some efficient methods for computing the determinant of large sparse matrices

arima:1968 - Revue Africaine de la Recherche en Informatique et Mathématiques Appliquées, August 4, 2014, Volume 17 - 2014 - Special issue CARI'12 - https://doi.org/10.46298/arima.1968
Some efficient methods for computing the determinant of large sparse matrices

Authors: Emmanuel Kamgnia ; Louis Bernard Nguenang

The computation of determinants intervenes in many scientific applications, as for example in the localization of eigenvalues of a given matrix A in a domain of the complex plane. When a procedure based on the application of the residual theorem is used, the integration process leads to the evaluation of the principal argument of the complex logarithm of the function g(z) = det((z + h)I - A)/ det(zI - A), and a large number of determinants is computed to insure that the same branch of the complex logarithm is followed during the integration. In this paper, we present some efficient methods for computing the determinant of a large sparse and block structured matrix. Tests conducted using randomly generated matrices show the efficiency and robustness of our methods.


Volume: Volume 17 - 2014 - Special issue CARI'12
Published on: August 4, 2014
Submitted on: January 23, 2014
Keywords: SPIKE., Schur complement,Determinant, eigenvalues, LU factorization, characteristic polynomial,Déterminants, valeurs propres, polynôme caractéristique, factorisation LU, complément de Schur, SPIKE,[INFO] Computer Science [cs],[MATH] Mathematics [math]


Share

Consultation statistics

This page has been seen 83 times.
This article's PDF has been downloaded 511 times.