Please use this identifier to cite or link to this item:
|Title:||Efficient algorithms for block downdating of least squares solutions||Authors:||Yanev, Petko I.
Kontoghiorghes, Erricos John
|Keywords:||Least squares;Algorithms;Computational complexity||Issue Date:||2004||Publisher:||Elsevier||Source:||Applied Numerical Mathematics, 2004, Volume 49, Issue 1, Pages 3-15||Abstract:||Five computationally efficient algorithms for block downdating of the least squares solutions are proposed. The algorithms are block versions of Givens rotations strategies and are rich in BLAS-3 operations. They efficiently exploit the triangular structure of the matrices. The theoretical complexities of the algorithms are derived and analyzed. The performance of the implementations confirms the theoretical results. The new strategies are found to outperform existing downdating methods.||URI:||http://ktisis.cut.ac.cy/handle/10488/6776||ISSN:||01689274||DOI:||http://dx.doi.org/10.1016/j.apnum.2003.11.009||Rights:||© 2003 IMACS. Publised by Elsevier B.V. All rights reserved.||Type:||Article|
|Appears in Collections:||Άρθρα/Articles|
Show full item record
checked on Feb 13, 2018
checked on Feb 23, 2019
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.