arXiv (All)
open access
Dimension-independent eigenvalue approximation for sparse matrices
Many applications in science and engineering require solving sparse Hermitian eigenvalue problems that are so large that even algorithms whose runtime scales linearly with the matrix dimension are unacceptably slow. Responding to this challenge, there is a growing body of work on sparsified iterativ
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
- An Iterative Method with Asymptotic Orthogonality for Simultaneous Eigenpair Computation#925887
- On the Robustness of Sparse Randomized Sketching to FP16 Rounding on GPUs#1343613
- A Deeper Analysis of Block-Sparse Featurizers#780827
- A Deeper Analysis of Block-Sparse Featurizers#779452
- Linear maps preserving the matrix discriminant. An enhanced approach#1324661
Record · ID 1325516
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