On solving large-scale weighted least squares problems

DOI10.1007/3-540-45262-1_8MaRDI QIDQ2724475zbMATH OpenFDO

Authors Venansius Baryamureeba

Publication date 12 July 2001

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/3-540-45262-1_8

zbMATH Keywords

conjugate gradientsdense columnselectrical networkselliptic boundary value problemsleast squares problemslinear programminglow-rank correction preconditionersnumerical resultssparse matrixstructural analysis

Mathematics Subject Classification ID

Numerical solutions to overdetermined systems, pseudoinverses (65F20) Numerical mathematical programming methods (65K05) Linear programming (90C05)

Recommendations

• Solution of large‐scale weighted least‐squares problems
• scientific article; zbMATH DE number 1569025
• Preconditioned iterative methods for solving weighted linear least squares problems
• Application of a class of preconditioners to large scale linear programming problems
• scientific article; zbMATH DE number 778128

Cited in

(6)

• Accurate solutions of weighted least squares problems associated with rank-structured matrices
• Fast solving of weighted pairing least-squares systems
• Proximity of weighted and layered least squares solutions
• scientific article; zbMATH DE number 1569025 (Why is no real title available?)
• scientific article; zbMATH DE number 6746226 (Why is no real title available?)
• Solution of large‐scale weighted least‐squares problems

This page was built for publication: On solving large-scale weighted least squares problems

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