Solving the least squares problem using the method of an extended set of equations with sparse matrix

Cover Page

Cite item

Full Text

Abstract

The solution of the least squares problem is discussed. The proper least squares problem is formulated and solved using the straightforward projection method (SPM). We propose that it should be reduced to an equivalent problem of solving an extended set of linear equations (ESLE) using the corresponding SPM’s modifications. We compare the SPM and the normal equations method in terms of the RAM space utilized and the number of arithmetic operations needed. The use of the methods for the general sparse matrix is discussed and a table of comparative computational efforts is given.

About the authors

S. Yu. Gogoleva

Samara State Aerospace University

Author for correspondence.
Email: vest@ssau.ru
Russian Federation

O. V. Zoteeva

Samara State Aerospace University

Email: vest@ssau.ru
Russian Federation

References

Supplementary files

Supplementary Files
Action
1. JATS XML

Copyright (c) 2015 VESTNIK of the Samara State Aerospace University

This website uses cookies

You consent to our cookies if you continue to use our website.

About Cookies