Stability of the Gauss-Huard algorithm with partial pivoting
The paper deals with the stability of a stabilized version of the Gauss-Huard elimination, a variant of the Gaussian elimination, using partial pivoting with column interchanges calculating in floating-point arithmetic and given machine precision when solving dense linear systems. This variant reduces the system to an equivalent diagonal system like Gauss-Jordan elimination, but without requiring more floating-point operations than Gaussian elimination. It is proved that Huard's elimination is as stable as Gauss-Jordan elimination with the appropriate pivoting strategy. Numerical experiments verifying the error analysis are supplied.
- A new presentation of the conjugate direction algorithm
- Average-Case Stability of Gaussian Elimination
- Error Analysis of Direct Methods of Matrix Inversion
- scientific article; zbMATH DE number 4016031 (Why is no real title available?)
- scientific article; zbMATH DE number 4213315 (Why is no real title available?)
- scientific article; zbMATH DE number 3976197 (Why is no real title available?)
- scientific article; zbMATH DE number 48972 (Why is no real title available?)
- scientific article; zbMATH DE number 3473182 (Why is no real title available?)
- scientific article; zbMATH DE number 4001309 (Why is no real title available?)
- scientific article; zbMATH DE number 862514 (Why is no real title available?)
- Monitoring the numerical stability of Gaussian elimination
- On the stability of Gauss-Jordan elimination with pivoting
- Parallel algorithms for solving large linear systems
- Rehabilitation of the Gauss-Jordan algorithm
- Solving linear systems on a vector computer
This page was built for publication: Stability of the Gauss-Huard algorithm with partial pivoting
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1362360)