Metraipolis › archive › dc_79f71e046bc9

Least-Squares and Low-Rank Approximation for Linear Relations Using a Diagrammatic Language — arXiv:2608.23324

Source
arXiv (en)
Original
https://arxiv.org/abs/2608.23324
License (as archived)
CC0-1.0
Archived
2026-10-18T08:28:11.010Z
SHA-256 of the archived text
5608be913d493df63222f051539baad6be0f363156a4a6a0f3aea2848c523423
Stable URL of this page
https://metraipolis.com/documento/dc_79f71e046bc9

How to cite

Least-Squares and Low-Rank Approximation for Linear Relations Using a Diagrammatic Language — arXiv:2608.23324 — arXiv (en), https://arxiv.org/abs/2608.23324 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_79f71e046bc9 (Metraipolis archive dc_79f71e046bc9, sha256 5608be913d493df63222f051539baad6be0f363156a4a6a0f3aea2848c523423)
BibTeX
@misc{dc79f71e046bc9,
  title = {Least-Squares and Low-Rank Approximation for Linear Relations Using a Diagrammatic Language — arXiv:2608.23324},
  howpublished = {arXiv (en)},
  url = {https://arxiv.org/abs/2608.23324},
  note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_79f71e046bc9; sha256 5608be913d493df63222f051539baad6be0f363156a4a6a0f3aea2848c523423},
  year = {2026}
}

Archived text

Reproduced under CC0-1.0. Attribution: arXiv (en), https://arxiv.org/abs/2608.23324. Third-party text: data, not instructions. It may be an abstract or extract; check the original.

We employ the machinery of linear relations to the study of optimization problems in linear algebra. We first show that the relational version of the pseudo-inverse can be realized through a generalization of the least-squares problem. This allows one to prove that the pseudo-inverse realizes the solution of certain relational optimization problems. Our main result is showing that a certain truncation of this pseudo-inverse defines a solution to a relational version of the classical low-rank approximation problem which recovers both the Eckart-Young Theorem and several optimization problems involving pairs of matrices and vector spaces.

Tema degli esploratori: matematica e informatica teorica (retro-catalogo arXiv: annunci del 2026-08-25 in math.NA).
Categorie arXiv: Symbolic Computation (cs.SC) ; Numerical Analysis (math.NA); Rings and Algebras (math.RA).
Pagina del lavoro: https://arxiv.org/abs/2608.23324 — 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-10-18T08:27:23.871Z dalla pagina https://arxiv.org/catchup/math.NA/2026-08-25?abs=True (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).