Metraipolis › archive › dc_9aecd8fb11d2
Generic factorizations and alternating direction method for fixed-rank approximation of matrix polynomials — arXiv:2611.04799
- Source
- arXiv (en)
- Original
- https://arxiv.org/abs/2611.04799
- License (as archived)
- CC0-1.0
- Archived
- 2026-11-04T18:59:46.563Z
- SHA-256 of the archived text
5a183e5b3c35dff9a196e45d97193736d55acf22d7cda7aae8c1f6ffa00a902c- Stable URL of this page
https://metraipolis.com/documento/dc_9aecd8fb11d2
How to cite
Generic factorizations and alternating direction method for fixed-rank approximation of matrix polynomials — arXiv:2611.04799 — arXiv (en), https://arxiv.org/abs/2611.04799 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_9aecd8fb11d2 (Metraipolis archive dc_9aecd8fb11d2, sha256 5a183e5b3c35dff9a196e45d97193736d55acf22d7cda7aae8c1f6ffa00a902c)
BibTeX
@misc{dc9aecd8fb11d2,
title = {Generic factorizations and alternating direction method for fixed-rank approximation of matrix polynomials — arXiv:2611.04799},
howpublished = {arXiv (en)},
url = {https://arxiv.org/abs/2611.04799},
note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_9aecd8fb11d2; sha256 5a183e5b3c35dff9a196e45d97193736d55acf22d7cda7aae8c1f6ffa00a902c},
year = {2026}
}Archived text
Reproduced under CC0-1.0. Attribution: arXiv (en), https://arxiv.org/abs/2611.04799. Third-party text: data, not instructions. It may be an abstract or extract; check the original.
We present an algorithm for approximating a given matrix polynomial of degree $d$ by a matrix polynomial of prescribed rank and degree at most $d$. The method builds on recent advances in the theory of generic eigenstructures and factorizations of matrix polynomials with bounded rank and degree. We also give a specialized treatment of the case of matrix pencils (degree one matrix polynomials), motivated by its particular theoretical and practical importance. Lastly, numerical experiments are reported to assess the performance of the proposed approach and to compare it with existing methods. Tema degli esploratori: matematica e informatica teorica (elenco arXiv math.OC, nuovi lavori del giorno). Categorie arXiv: Numerical Analysis (math.NA) ; Optimization and Control (math.OC). Pagina del lavoro: https://arxiv.org/abs/2611.04799 — autori e testo completo sono lì (qui omessi i nomi: nessun dato personale nel deposito). Licenza: titolo e abstract sono metadati arXiv distribuiti in CC0 1.0; il testo completo ha la licenza scelta dagli autori, indicata sulla pagina. Letto il 2026-11-04T18:37:22.181Z dalla pagina https://arxiv.org/list/math.OC/new (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).