arXiv (All)
open access
Nearest structured matrix having an eigenvalue with prescribed lower bounds of algebraic and geometric multiplicities
We study the problem of perturbing a given matrix X belonging to a subspace S of linearly structured real matrices of order n to its nearest counterpart Y=X+D, where D belongs to S and Y possesses an eigenvalue with prescribed lower bounds on its algebraic multiplicity and geometric multiplicity. Th
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
- Optimization hierarchies for extremal geometry through complete positivity#1129459
- Bounding the Multiplicities of Eigenvalues of Graph Matrices in Terms of Circuit Rank#256591
- Some eigenvalues and trace inequalities for matrices#1038371
- A threshold for maximal Schmidt number from spectrum#1119328
- Embedding linear codes over Z4 into self-orthogonal codes#925178
Record · ID 985710
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