Location via proxy:   [ UP ]  
[Report a bug]   [Manage cookies]                
skip to main content
article
Free access

On the stability of Gauss-Jordan elimination with pivoting

Published: 01 January 1975 Publication History

Abstract

The stability of the Gauss-Jordan algorithm with partial pivoting for the solution of general systems of linear equations is commonly regarded as suspect. It is shown that in many respects suspicions are unfounded, and in general the absolute error in the solution is strictly comparable with that corresponding to Gaussian elimination with partial pivoting plus back substitution. However, when A is ill conditioned, the residual corresponding to the Gauss-Jordan solution will often be much greater than that corresponding to the Gaussian elimination solution.

References

[1]
Forsythge, G. E., and Moler, C. B., Computer Solution of Linear Algebraic Systems. Prentice-Hall, Englewood Cliffs, N.J., 1967.
[2]
Wilkinson, J.H. Error analysis of direct methods of matrix inversion. J. ACM 8, 3 (July 1961), 281-330.
[3]
Wilkinson, J.H. Rounding Errors in Algebraic Processes. Her Majesty's Stationery Store, London; and Prentice-Hall, Englewood Cliffs, N.J., 1963.
[4]
Wilkinson, J.H. The Algebraic Eigeuvalue Problem. Oxford University Press, London, 1965.

Cited By

View all
  • (2023)Simpler is better: a comparative study of randomized pivoting algorithms for CUR and interpolative decompositionsAdvances in Computational Mathematics10.1007/s10444-023-10061-z49:4Online publication date: 7-Aug-2023
  • (2022)The explicit formula for Gauss-Jordan elimination applied to flexible systemsSpecial Matrices10.1515/spma-2022-016810:1(366-393)Online publication date: 10-Jun-2022
  • (2022)Weight distribution algorithm for global ship analysis in preliminary design stageJournal of Computational Design and Engineering10.1093/jcde/qwac0349:3(907-918)Online publication date: 13-May-2022
  • Show More Cited By

Recommendations

Comments

Information & Contributors

Information

Published In

Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]

Publisher

Association for Computing Machinery

New York, NY, United States

Publication History

Published: 01 January 1975
Published in CACM Volume 18, Issue 1

Permissions

Request permissions for this article.

Check for updates

Author Tags

  1. Gauss-Jordan algorithm
  2. Gaussian elimination
  3. back-substitution
  4. backward error analysis
  5. bound for residual
  6. bounds for error in solution

Qualifiers

  • Article

Contributors

Other Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

  • Downloads (Last 12 months)164
  • Downloads (Last 6 weeks)15
Reflects downloads up to 17 Oct 2024

Other Metrics

Citations

Cited By

View all
  • (2023)Simpler is better: a comparative study of randomized pivoting algorithms for CUR and interpolative decompositionsAdvances in Computational Mathematics10.1007/s10444-023-10061-z49:4Online publication date: 7-Aug-2023
  • (2022)The explicit formula for Gauss-Jordan elimination applied to flexible systemsSpecial Matrices10.1515/spma-2022-016810:1(366-393)Online publication date: 10-Jun-2022
  • (2022)Weight distribution algorithm for global ship analysis in preliminary design stageJournal of Computational Design and Engineering10.1093/jcde/qwac0349:3(907-918)Online publication date: 13-May-2022
  • (2022)A solver of single-agent stochastic puzzle: A case study with MinesweeperKnowledge-Based Systems10.1016/j.knosys.2022.108630246(108630)Online publication date: Jun-2022
  • (2022)Dynamic recognition prefetch engine for DRAM-PCM hybrid main memoryThe Journal of Supercomputing10.1007/s11227-021-03948-578:2(1885-1902)Online publication date: 1-Feb-2022
  • (2020)Access pattern-based high-performance main memory system for graph processing on single machinesFuture Generation Computer Systems10.1016/j.future.2020.03.015108(560-573)Online publication date: Jul-2020
  • (2020)A multi-GPU implementation of a full-field crystal plasticity solver for efficient modeling of high-resolution microstructuresComputer Physics Communications10.1016/j.cpc.2020.107231254(107231)Online publication date: Sep-2020
  • (2019)Increasing Accuracy of Iterative Refinement in Limited Floating-Point Arithmetic on Half-Precision Accelerators2019 IEEE High Performance Extreme Computing Conference (HPEC)10.1109/HPEC.2019.8916392(1-6)Online publication date: Sep-2019
  • (2019)Suitability of physicochemical models for embedded systems regarding a nickel-rich, silicon-graphite lithium-ion batteryJournal of Power Sources10.1016/j.jpowsour.2019.226834436(226834)Online publication date: Oct-2019
  • (2017)Towards numerical benchmark for half-precision floating point arithmetic2017 IEEE High Performance Extreme Computing Conference (HPEC)10.1109/HPEC.2017.8091031(1-5)Online publication date: Sep-2017
  • Show More Cited By

View Options

View options

PDF

View or Download as a PDF file.

PDF

eReader

View online with eReader.

eReader

Get Access

Login options

Full Access

Media

Figures

Other

Tables

Share

Share

Share this Publication link

Share on social media