Παρακαλώ χρησιμοποιήστε αυτό το αναγνωριστικό για να παραπέμψετε ή να δημιουργήσετε σύνδεσμο προς αυτό το τεκμήριο:
https://hdl.handle.net/20.500.14279/1995
Τίτλος: | Parallel algorithms for downdating the least squares estimator of the regression model | Συγγραφείς: | Yanev, Petko I. Kontoghiorghes, Erricos John |
Major Field of Science: | Social Sciences | Field Category: | Economics and Business | Λέξεις-κλειδιά: | Least squares;Parallel algorithms;Communication systems;Problem solving;Regression analysis | Ημερομηνία Έκδοσης: | 2008 | Πηγή: | Parallel Computing, 2008, vol. 34, iss. 6-8, pp. 451-468 | Volume: | 34 | Issue: | 6-8 | Start page: | 451 | End page: | 468 | Περιοδικό: | Parallel Computing | Περίληψη: | Computationally efficient parallel algorithms for downdating the least squares estimator of the ordinary linear regression are proposed. The algorithms, which are based on the QR decomposition, are block versions of sequential Givens strategies and efficiently exploit the triangular structure of the data matrices. The first strategy utilizes only part of the orthogonal matrix which is derived from the QR decomposition of the initial data matrix. The rest of the orthogonal matrix is not updated or explicitly computed. A modification of the parallel algorithm, which explicitly computes the whole orthogonal matrix in the downdated QR decomposition, is also considered. An efficient distribution of the matrices over the processors is proposed. Furthermore, the new algorithms do not require any inter-processor communication. The theoretical complexities are derived and experimental results are presented and analyzed. The parallel strategies are scalable and highly efficient for large scale downdating least squares problems. A new parallel block-hyperbolic downdating strategy is developed. The algorithm is rich in BLAS-3 computations, involves negligible duplicated computations and requires insignificant inter-processor communication. It is found to outperform the previous downdating strategies and to be highly efficient for large scale problems. The experimental results confirm the derived theoretical complexities. | URI: | https://hdl.handle.net/20.500.14279/1995 | ISSN: | 01678191 | DOI: | 10.1016/j.parco.2008.01.002 | Rights: | © Elsevier | Type: | Article | Affiliation: | Cyprus University of Technology | Affiliation: | Université de Neuchâtel University of Cyprus Plovdiv University Paisii Hilendarski Birkbeck University of London |
Publication Type: | Peer Reviewed |
Εμφανίζεται στις συλλογές: | Άρθρα/Articles |
CORE Recommender
SCOPUSTM
Citations
4
checked on 9 Νοε 2023
WEB OF SCIENCETM
Citations
50
4
Last Week
0
0
Last month
0
0
checked on 29 Οκτ 2023
Page view(s)
495
Last Week
0
0
Last month
1
1
checked on 23 Νοε 2024
Google ScholarTM
Check
Altmetric
Όλα τα τεκμήρια του δικτυακού τόπου προστατεύονται από πνευματικά δικαιώματα