arXiv (All)
open access
Locally Approximating the Top Eigenvector of Bounded Entry Matrices
We provide a local computation algorithm to approximate the top eigenvector $x \in \mathbb{R}^n$ of a symmetric matrix $A \in \mathbb{R}^{n \times n}$ with entries between $-1$ and $1$, building on the work of Swartworth and Woodruff [SODA 25] who show how to approximate the eigenvalues up to additi
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
- Regional Stability and New Eigenvalue Perturbation Bounds#1083755
- Truly Sub-Nyquist Generalized Eigenvalue Method with High-Resolution#179087
- A General Algorithm to Calculate the Inverse Principal $p$-th Root of Symmetric Positive Definite Matrices#1128455
- New matrix perturbation bounds with relative strength: Perturbation of eigenspaces#1037675
- Structural Packing and Dyadic Factorization of Sparse Positive Definite Matrices#798603
Record · ID 1076921
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