The linear least squares problem, min x Ax-b 2 , is solved by applying a multisplitting(MS) strategy in which the system matrix is decomposed by columns into p blocks. The b and x vectors are partitioned consistently with the matrix decomposition. The global least squares problem is then replaced by
Computing the conditioning of the components of a linear least-squares solution
β Scribed by Marc Baboulin; Jack Dongarra; Serge Gratton; Julien Langou
- Publisher
- John Wiley and Sons
- Year
- 2009
- Tongue
- English
- Weight
- 375 KB
- Volume
- 16
- Category
- Article
- ISSN
- 1070-5325
- DOI
- 10.1002/nla.627
No coin nor oath required. For personal study only.
π SIMILAR VOLUMES
Accuracy of a Gram-Schmidt algorithm for the solution of linear least squares equations is compared with accuracy of least squares subroutines in three highly respected mathematical packages that use Householder transformations. Results from the four programs for 13 test problems were evaluated at 1
A non-linear least-squares (NLS) method is used without regularization to recover the release history of a groundwater contaminant plume from its current measured spatial distribution. The Β―ow system is assumed to be one-dimensional, with the plume originating from a known single site. The solution