Please use this identifier to cite or link to this item: http://ktisis.cut.ac.cy/handle/10488/6776
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: 10.1016/j.apnum.2003.11.009
Rights: © 2003 IMACS. Publised by Elsevier B.V. All rights reserved.
Appears in Collections:Άρθρα/Articles

Show full item record

SCOPUSTM   
Citations 20

8
checked on Jul 8, 2017

WEB OF SCIENCETM
Citations 20

7
Last Week
0
Last month
checked on Jul 21, 2017

Page view(s)

18
Last Week
1
Last month
4
checked on Aug 18, 2017

Google ScholarTM

Check

Altmetric


Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.