Robust localization and counting of eigenvalues

DOI10.46298/ARIMA.1983MaRDI QIDQ7005581zbMATH OpenFDO

Authors L. B. Nguenang, Emmanuel Kamgnia, Bernard Philippe

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.1983

zbMATH Keywords

client-serverdeterminantefficiencyeigenvalue countingmasterminimum singular valueorbitpseudospectrumspeeduptraceworkers

Mathematics Subject Classification ID

Eigenvalues, singular values, and eigenvectors (15A18) Inequalities involving eigenvalues and eigenvectors (15A42) Numerical computation of eigenvalues and eigenvectors of matrices (65F15) Computational methods for sparse matrices (65F50)

Cites work

• Algorithm 832
• Counting eigenvalues in domains of the complex field
• scientific article; zbMATH DE number 47363 (Why is no real title available?)
• scientific article; zbMATH DE number 556491 (Why is no real title available?)
• scientific article; zbMATH DE number 1746527 (Why is no real title available?)
• scientific article; zbMATH DE number 852320 (Why is no real title available?)
• Parallel computation of pseudospectra of large sparse matrices
• PAT -- a reliable path-following algorithm
• Some efficient methods for computing the determinant of large sparse matrices
• Stochastic estimation method of eigenvalue density for nonlinear eigenvalue problem on the complex plane
• The University of Florida sparse matrix collection

This page was built for publication: Robust localization and counting of eigenvalues

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