Some efficient methods for computing the determinant of large sparse matrices

DOI10.46298/ARIMA.1968MaRDI QIDQ7005586zbMATH OpenFDO

Authors Emmanuel Kamgnia, L. B. Nguenang

Publication date 31 March 2025

Published in ARIMA. Revue Africaine de la Recherche en Informatique et Mathématiques Appliqués (Search for Journal in Brave)

Copyright license Creative Commons Attribution 4.0 International

Full work available at URL https://doi.org/10.46298/ARIMA.1968

zbMATH Keywords

eigenvaluesdeterminantcharacteristic polynomialSchur complementLU factorizationSPIKE

Mathematics Subject Classification ID

Computational methods for sparse matrices (65F50) Numerical computation of determinants (65F40)

Cites work

• scientific article; zbMATH DE number 4213315 (Why is no real title available?)
• scientific article; zbMATH DE number 1460605 (Why is no real title available?)
• scientific article; zbMATH DE number 1746527 (Why is no real title available?)
• A combined unifrontal/multifrontal method for unsymmetric sparse matrices
• Algorithm 832
• An Unsymmetric-Pattern Multifrontal Method for Sparse LU Factorization
• Counting eigenvalues in domains of the complex field
• Stochastic estimation method of eigenvalue density for nonlinear eigenvalue problem on the complex plane

Cited in

(1)

• Robust localization and counting of eigenvalues

This page was built for publication: Some efficient methods for computing the determinant of large sparse matrices

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7005586)