Koc University Digital Collections
metadata only
Large-scale computation of L-infinity-norms by a greedy subspace method
We are concerned with the computation of the L-infinity-norm for an L-infinity-function of the form H(s) = C(s) D(s) B-1(s), where the middle factor is the inverse of a meromorphic matrix-valued function, and C(s), B(s) are meromorphic functions mapping to short-and-fat and tall-and-skinny matrices,
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 S-matrix conjecture#798380
- The S-matrix conjecture#796967
- Tight Stability Estimates Near the Simplex and Applications for the Banach-Mazur Distance and Rogers-Shephard-Type Inequalities#1109818
- Improved bounds for Szpiro's conjecture#1123755
- On Generalisation Error Bounds for Transformers#984813
Record · ID 955301
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