arXiv (OAI Expanded)
open access
Eigensolvers for polynomial roots and tensor decomposition
Computing eigenvalues and eigenvectors is at the heart of the solution of many non-linear problems. For instance, finding the roots of polynomial systems reduces to computing joint eigenvectors of operators of multiplication. Similarly, tensor decomposition can be performed via the joint diagonaliza
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
- Boundary value problems for linear differential-algebraic equations: solvability via the Kronecker canonical form#985383
- Unleashing the Power of Equality Saturation for Tensor Program Superoptimization#1000287
- Higher order stray field computation on tensor product domains#924430
- Higher order stray field computation on tensor product domains#920199
- Lossless Tensor Compression as Program Synthesis#424036
Record · ID 1109127
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