arXiv (All)
open access
The Mode of Null-A: Compositional Computation of a Generalized Inverse
We present a novel algorithm for calculating the preimage of an affine space through a product ${J}={J}_{T-1}\cdots{J}_0$ of matrices ${J}_t$ of special form: finding the largest input space $\mathbf{X}$ such that $\mathbf{x}\in\mathbf{X}$ implies ${J}\mathbf{x}\in \mathbf{Y}$, where $\mathbf{Y}$ is
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
- MPX: A Unified Systolic Array for Matrix and Polynomial Multiplication#280109
- The bi-adjoint scalar $\ell$-loop planar integrand recursion and graded inverse variables#158707
- Exploiting the the nonzero diagonal pattern in matrix function computations#617767
- Exploiting the the nonzero diagonal pattern in matrix function computations#617267
- Efficient approximations of matrix multiplication using truncated decompositions#163122
Record · ID 1143098
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