arXiv (All)
open access
Adapting the Lanczos algorithm to matrices with almost continuous spectra
We consider approximating $B^T(A+sI)^{-1}B$, where $A\in\mathbb{R}^{n\times n}$ is large, symmetric positive definite, and $B\in\mathbb{R}^{n\times p}$ with $p\ll n$. We focus on the case where $A$ has an almost continuous (dense) spectrum: its eigenvalues fill one or more intervals so densely that
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
- Learning with tensors: a framework based on convex optimization and spectral regularization#448953
- Mutually avoiding paths in random media and largest eigenvalues of random matrices#1158232
- A One-Saddle 1/5 Approximation Algorithm for Common-Kernel Bimatrix Games: Recognition, Exact Segment Optimization, Sharp Selector Bounds, and Certified Robustness#1118183
- DF-SQD: Deterministic Fields for Sampling-Based Quantum Diagonalization#821218
- Low-Latency Coded Tensor--Matrix Multiplication for Distributed Signal Processing Systems#1104766
Record · ID 973066
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