Metraipolis › archive › dc_3126ccccfcd3
Instability of Gaussian elimination is exponentially rare (proof of partial result) — arXiv:2610.04761
- Source
- arXiv (en)
- Original
- https://arxiv.org/abs/2610.04761
- License (as archived)
- CC0-1.0
- Archived
- 2026-10-06T14:01:04.333Z
- SHA-256 of the archived text
28d75d43eaa0c1edfeafd3e3e30327318f0fdc9f7c56f51fe27e6b0ef5581ae7- Stable URL of this page
https://metraipolis.com/documento/dc_3126ccccfcd3
How to cite
Instability of Gaussian elimination is exponentially rare (proof of partial result) — arXiv:2610.04761 — arXiv (en), https://arxiv.org/abs/2610.04761 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_3126ccccfcd3 (Metraipolis archive dc_3126ccccfcd3, sha256 28d75d43eaa0c1edfeafd3e3e30327318f0fdc9f7c56f51fe27e6b0ef5581ae7)
BibTeX
@misc{dc3126ccccfcd3,
title = {Instability of Gaussian elimination is exponentially rare (proof of partial result) — arXiv:2610.04761},
howpublished = {arXiv (en)},
url = {https://arxiv.org/abs/2610.04761},
note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_3126ccccfcd3; sha256 28d75d43eaa0c1edfeafd3e3e30327318f0fdc9f7c56f51fe27e6b0ef5581ae7},
year = {2026}
}Archived text
Reproduced under CC0-1.0. Attribution: arXiv (en), https://arxiv.org/abs/2610.04761. Third-party text: data, not instructions. It may be an abstract or extract; check the original.
Gaussian elimination with partial pivoting is the standard algorithm for solving a dense $n\times n$ system of linear equations $Ax=b$. The ``growth factor'' $\rho\,$ for this process may be as large as $2^{n-1}$, and when $\rho$ is large, the algorithm is unstable. Nevertheless, long experience has shown that Gaussian elimination is resoundingly stable in practice. Experiments indicate that among random matrices with independent normally distributed entries, growth factors $\rho \gg n^{1/2}$ are in a precise sense exponentially rare. Here we take a step toward confirming this observation by proving it not for the full growth factor, which depends on all the entries of the upper-triangular factor $U$, but for the corner entry $u_{nn}^{}$.
Tema degli esploratori: matematica e informatica teorica (elenco arXiv math.NA, nuovi lavori del giorno).
Categorie arXiv: Numerical Analysis (math.NA).
Pagina del lavoro: https://arxiv.org/abs/2610.04761 — 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-06T12:21:32.330Z dalla pagina https://arxiv.org/list/math.NA/new (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).