Show simple item record

dc.contributor.authorBisain, Ankit
dc.contributor.authorEdelman, Alan
dc.contributor.authorUrschel, John
dc.date.accessioned2025-10-15T17:34:00Z
dc.date.available2025-10-15T17:34:00Z
dc.date.issued2025-02-26
dc.identifier.urihttps://hdl.handle.net/1721.1/163173
dc.description.abstractThe growth factor in Gaussian elimination measureshow large the entries of an LU factorization can be rel-ative to the entries of the original matrix. It is a keyparameter in error estimates, and one of the most fun-damental topics in numerical analysis. We produce anupper bound of 𝑛 0.2079 ln 𝑛+0.91 for the growth factor inGaussian elimination with complete pivoting — the firstimprovement upon Wilkinson’s original 1961 bound of2 𝑛 0.25 ln 𝑛+0.5.en_US
dc.language.isoen
dc.publisherWileyen_US
dc.relation.isversionofhttps://doi.org/10.1112/blms.70034en_US
dc.rightsCreative Commons Attributionen_US
dc.rights.urihttps://creativecommons.org/licenses/by/4.0/en_US
dc.sourceWileyen_US
dc.titleA new upper bound for the growth factor in Gaussian elimination with complete pivotingen_US
dc.typeArticleen_US
dc.identifier.citationBisain, A., Edelman, A. and Urschel, J. (2025), A new upper bound for the growth factor in Gaussian elimination with complete pivoting. Bull. London Math. Soc., 57: 1369-1387.en_US
dc.contributor.departmentMassachusetts Institute of Technology. Department of Mathematicsen_US
dc.relation.journalBulletin of the London Mathematical Societyen_US
dc.eprint.versionFinal published versionen_US
dc.type.urihttp://purl.org/eprint/type/JournalArticleen_US
eprint.statushttp://purl.org/eprint/status/PeerRevieweden_US
dc.date.updated2025-10-15T17:25:59Z
dspace.orderedauthorsBisain, A; Edelman, A; Urschel, Jen_US
dspace.date.submission2025-10-15T17:26:00Z
mit.journal.volume57en_US
mit.journal.issue5en_US
mit.licensePUBLISHER_CC


Files in this item

Thumbnail

This item appears in the following Collection(s)

Show simple item record