arXiv (All)
open access
A fast and stable test to check if a weakly diagonally dominant matrix is a nonsingular M-matrix
We present a test for determining if a substochastic matrix is convergent. By establishing a duality between weakly chained diagonally dominant (w.c.d.d.) L-matrices and convergent substochastic matrices, we show that this test can be trivially extended to determine whether a weakly diagonally domin
Conceptio Open Archive
Analyze & explore related research in Conceptio
Connect this record directly into your research workflow or AI agent. Explore citations across open repositories, query full text, and export structured proof bundles.
This document is indexed with metadata only: full text is not available in the archive for this record. Open the official source ↗
Related documents
- New matrix perturbation bounds with relative strength: Perturbation of eigenspaces#1037675
- Some eigenvalues and trace inequalities for matrices#1038371
- Asymptotically Optimal Mixed-State Cloning#1130828
- Locally Approximating the Top Eigenvector of Bounded Entry Matrices#1076921
- Algorithmic stability via ensembling#997311
Record · ID 984772
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Bring this data into your agent: Connect via MCP or API · 20 free credits to start · no card required
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive