arXiv (All)
open access
Entry growth in Gaussian elimination
Gaussian elimination is one of the oldest algorithms in mathematics, and the most popular method for solving an unstructured linear system. Its stability in finite precision is controlled by its growth factor, which measures how large the entries produced during elimination can become. Understanding
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
- Complete pivoting growth of butterfly matrices and butterfly Hadamard matrices#1105897
- Analysis of RCLUPPr: stability, robustness and acceleration#999827
- Online adaptive non-intrusive model reduction via manifold interpolation and subspace updates: application to FSI convergence acceleration#1123293
- The Lanczos algorithm for matrix functions: a handbook for scientists#629744
- The Lanczos algorithm for matrix functions: a handbook for scientists#627882
Record · ID 800144
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