arXiv (OAI Expanded)
open access
Unique sparse decomposition of low rank matrices
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
- Unique sparse decomposition of low rank matrices#665415
- Low solution rank of the matrix LASSO under RIP with consequences for rank-constrained algorithms#144202
- Faster Linear Programming with $\sqrt{\mathrm{rank}}$ Linear System Solves#1105412
- Sparsity-Aware Roofline Models for Sparse Matrix-Matrix Multiplication#2560
- Butterfly Factorization Via Randomized Matrix-Vector Multiplications#1119895
Record · ID 663915
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