arXiv (All)
open access
A MATLAB Tool for the Stable Generation of Matrix Polynomial Evaluation Schemes with Two-Product Savings
Computing numerical approximations of matrix functions frequently relies on the efficient evaluation of high-degree matrix polynomials. Although computational bounds are historically governed by the Paterson--Stockmeyer (PS) method, recent theoretical developments have demonstrated the viability of
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
- Comparing magic state cultivation methods using matrix product states#1013322
- Computing submatrices of the Hermite normal form of a structured polynomial matrix#971756
- Systematic Data Structure Lower Bounds via the Query-with-Sketch Model#1011731
- Low-Order Refined Preconditioning for Spectral/hp Element Method for Complex, 3D Geometries#1106142
- Numerical algorithm and complexity analysis for diagonalization of multivariate homogeneous polynomials#665436
Record · ID 1063981
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