Solution of sparse quasi-square rectangular systems by Gaussian elimination

DOI10.1093/IMANUM/18.2.165MaRDI QIDQ4398499zbMATH OpenOpenAlexFDO

Authors J. Cardenal, José Manuel Jiménez, Iain S. Duff

Publication date 20 December 1998

Published in IMA Journal of Numerical Analysis (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1093/imanum/18.2.165

zbMATH Keywords

Gaussian eliminationleast squaresLU factorizationminimum-norm problemsnumerical examplesparse linear equationssparse quasi-square rectangular systems

Mathematics Subject Classification ID

Direct numerical methods for linear systems and matrix inversion (65F05) Numerical solutions to overdetermined systems, pseudoinverses (65F20)

Recommendations

• Solution of Sparse Underdetermined Systems of Linear Equations
• scientific article; zbMATH DE number 3844929
• scientific article; zbMATH DE number 778128
• scientific article; zbMATH DE number 4041162

Cited in

(8)

• Gaussian elimination is optimal for solving linear equations in dimension two
• Solution of sparse rectangular systems using LSQR and Craig
• A new sparse Gaussian elimination algorithm and the Niederreiter linear system for trinomials over F₂
• scientific article; zbMATH DE number 4201505 (Why is no real title available?)
• scientific article; zbMATH DE number 4041162 (Why is no real title available?)
• scientific article; zbMATH DE number 778128 (Why is no real title available?)
• A survey of direct methods for sparse linear systems
• MINQUE for block diagonal bordered systems such as those encountered in VLBI data analysis

This page was built for publication: Solution of sparse quasi-square rectangular systems by Gaussian elimination

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4398499)