Please use this identifier to cite or link to this item:
https://hdl.handle.net/20.500.14279/2005| Title: | Efficient algorithms for block downdating of least squares solutions |
| Authors: | Yanev, Petko I. Kontoghiorghes, Erricos John |
| metadata.dc.contributor.other: | Κοντογιώργης, Έρρικος Γιάννης |
| Major Field of Science: | Natural Sciences |
| Field Category: | Computer and Information Sciences |
| Keywords: | Least squares;Algorithms;Computational complexity |
| Issue Date: | Apr-2004 |
| Source: | Applied Numerical Mathematics, 2004, vol. 49, no. 1, pp. 3-15 |
| Volume: | 49 |
| Issue: | 1 |
| Start page: | 3 |
| End page: | 15 |
| Journal: | Applied Numerical Mathematics |
| 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: | https://hdl.handle.net/20.500.14279/2005 |
| ISSN: | 01689274 |
| DOI: | 10.1016/j.apnum.2003.11.009 |
| Rights: | © Elsevier |
| Type: | Article |
| Affiliation : | Université de Neuchâtel |
| Publication Type: | Peer Reviewed |
| Appears in Collections: | Άρθρα/Articles |
CORE Recommender
Sorry the service is unavailable at the moment. Please try again later.
This item is licensed under a Creative Commons License
