Least Squares Problems

Heinz Rutishauser

Chapter Chapter 5 in Lectures on Numerical Mathematics, 1990, pp 103-127 from Springer

Abstract: Abstract We consider once again a system of nonlinear equations $$\begin{array}{*{20}{c}} {{f_1}\left( {{x_1},{x_2}, \cdots ,{x_p}} \right) = 0} \\ {{f_2}\left( {{x_1},{x_2}, \cdots ,{x_p}} \right) = 0} \\ \vdots \\ {{f_n}\left( {{x_1},{x_2}, \cdots ,{x_p}} \right) = 0,} \end{array}$$ but now assume that the number n of equations is larger than the number pof unknowns.

Keywords: Computational Implementation; Schmidt Orthogonalization; Orthogonalization Process; Householder Transformation; Trust Region Strategy (search for similar items in EconPapers)
Date: 1990
References: Add references at CitEc
Citations:

There are no downloads for this item, see the EconPapers FAQ for hints about obtaining it.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:spr:sprchp:978-1-4612-3468-5_5

Ordering information: This item can be ordered from
http://www.springer.com/9781461234685

DOI: 10.1007/978-1-4612-3468-5_5

Access Statistics for this chapter

More chapters in Springer Books from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().