Enclosing solutions in least squares problems

MaRDI QIDQ3084845zbMATH OpenFDO

Authors Shinya Miyajima

Publication date 25 March 2011

zbMATH Keywords

algorithmserror boundsnumerical experimentsdirect methodsleast squares problemsunderdetermined systemsguaranteed enclosure

Mathematics Subject Classification ID

Numerical solutions to overdetermined systems, pseudoinverses (65F20)

Recommendations

• Componentwise enclosure for solutions of least squares problems and underdetermined systems
• Fast enclosure for solutions in underdetermined systems
• Verified bounds for least squares problems and underdetermined linear systems
• Fast enclosure for the minimum norm least squares solution of the matrix equation AXB = C
• Tight enclosures of solutions of linear systems

Cited in

(4)

• Verified bounds for least squares problems and underdetermined linear systems
• Solving the full rank interval least squares problem
• Solving interval linear least squares problems by PPS-methods
• Componentwise enclosure for solutions of least squares problems and underdetermined systems

This page was built for publication: Enclosing solutions in least squares problems

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