Rehabilitation of the Gauss-Jordan algorithm

DOI10.1007/BF01396364zbMath0672.65011MaRDI QIDQ1120248

T. J. Dekker, Walter Hoffmann

Publication date: 1989

Published in: Numerische Mathematik (Search for Journal in Brave)

Full work available at URL: https://eudml.org/doc/133335

zbMATH Keywords

error analysisGauss eliminationGauss-Jordan algorithmcomputer resultsvector and parallel computers

Mathematics Subject Classification ID

Roundoff error (65G50) Parallel numerical computation (65Y05) Direct numerical methods for linear systems and matrix inversion (65F05) Linear equations (linear algebraic aspects) (15A06)

Related Items

An efficient variant of gauss-jordan type algorithms for direct and parallel solution of dense linear systems ⋮ Parallel algorithms for solving large linear systems ⋮ Two inverse-of-\(N\)-free methods for \(A_{M,N}^\dagger\) ⋮ Stability of the Gauss-Huard algorithm with partial pivoting ⋮ Simultaneous backward stability of Gauss and Gauss–Jordan elimination ⋮ Growth factor and expected growth factor of some pivoting strategies ⋮ On the backward stability of Gauss-Jordan elimination ⋮ An homage to Joseph-Louis Lagrange and Pierre Huard ⋮ An estimate for the spectral norm of the inverse of a matrix with the Gauss-Jordan algorithm ⋮ Modelling and analysis of communication overhead for parallel matrix algorithms ⋮ The Gauss-Huard algorithm and LU factorization

Uses Software

• LINPACK
• NUMVEC

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Solving linear systems on a vector computer
• Monitoring the numerical stability of Gaussian elimination
• On the stability of Gauss-Jordan elimination with pivoting

This page was built for publication: Rehabilitation of the Gauss-Jordan algorithm