Rehabilitation of the Gauss-Jordan algorithm
By using vector and parallel computers, a number of algorithms may have a renewed interest. In this paper, the Gauss-Jordan algorithm with column interchanges is analyzed. It is shown that by using the Gauss-Jordan algorithm with column interchanges, a more satisfactory bound for the residual norm can be given. The presented error analysis gives a theoretical evidence that this algorithm yields numerical solutions as good as those obtained by Gauss elimination. Furthermore, the residual of the obtained solution is not larger than that corresponding to the Gauss elimination's solution. For demonstrating that the error and the residual are satisfactory, some computer results are presented. Some results of experiments on a Cyber 205 vector computer are gathered to show that the Gauss-Jordan algorithm is not slower than the Gauss elimination for systems of order up to 25, although for its realization, about 1,5 times work is required.
- scientific article; zbMATH DE number 3748409 (Why is no real title available?)
- scientific article; zbMATH DE number 3473182 (Why is no real title available?)
- scientific article; zbMATH DE number 3892457 (Why is no real title available?)
- Monitoring the numerical stability of Gaussian elimination
- On the stability of Gauss-Jordan elimination with pivoting
- Solving linear systems on a vector computer
- On the backward stability of Gauss-Jordan elimination
- The Gauss-Huard algorithm and LU factorization
- Parallel algorithms for solving large linear systems
- Stability of the Gauss-Huard algorithm with partial pivoting
- Modelling and analysis of communication overhead for parallel matrix algorithms
- Two inverse-of-\(N\)-free methods for \(A_{M,N}^\dagger\)
- An estimate for the spectral norm of the inverse of a matrix with the Gauss-Jordan algorithm
- An efficient variant of gauss-jordan type algorithms for direct and parallel solution of dense linear systems
- scientific article; zbMATH DE number 4001309 (Why is no real title available?)
- Simultaneous backward stability of Gauss and Gauss–Jordan elimination
- An homage to Joseph-Louis Lagrange and Pierre Huard
- Growth factor and expected growth factor of some pivoting strategies
This page was built for publication: Rehabilitation of the Gauss-Jordan algorithm
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1120248)