arXiv (All)
open access
The QR factorization of a banded-plus-semiseparable matrix is computable in linear complexity with Householder reflections
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
- The QR factorization of a banded-plus-semiseparable matrix is computable in linear complexity with Householder reflections#664311
- Scaling Fourier-Based Sparse Matrix Analysis on GPUs#1034300
- Retrieving space-dependent polarization transformations via near-optimal quantum process tomography#1158065
- Positive Bidiagonal Factorizations: Combinatorial Structure, Spectral Theory, and Matrix Continued Fractions#1064009
- Exponential quantum advantage in processing massive classical data#1157271
Record · ID 665811
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