arXiv (All)
open access
Element-wise Convergence Behavior of Subspace Iteration
This paper studies the element-wise convergence behavior of subspace iteration. All results are established for both \(\mathbb{F}=\mathbb{R}\) and \(\mathbb{F}=\mathbb{C}\). For a diagonal matrix \(Λ=\mathrm{diag}(λ_1,\ldots,λ_n)\) with \(|λ_1|>\cdots>|λ_n|>0\), we analyze the modulus of each entry
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
- Infinite Matrix Operators and $E$-Frames in Hilbert Spaces#999863
- On the Commutant of Invertible Positive Operators#1034993
- Admissible Fourier Lengths, KAM Reducibility, and Spectral Applications#998592
- Local perturbations of block Toeplitz matrices#1075983
- The SATOR Matrix - Spectrum Selection in the SATOR Matrix Programme: No-Go Theorems, Shell-Balanced Pairing, and a Unique 13-Site Completion#299638
Record · ID 1035938
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