Please use this identifier to cite or link to this item: https://hdl.handle.net/20.500.14279/2035
Title: Computationally efficient methods for estimating the updated-observations SUR models
Authors: Yanev, Petko I. 
Kontoghiorghes, Erricos John 
Major Field of Science: Natural Sciences
Keywords: Parallel algorithms;Mathematical models;Regression analysis
Issue Date: Nov-2007
Source: Applied Numerical Mathematics, 2007, vol. 57, no. 11-12, pp. 1245-1258.
Volume: 57
Issue: 11-12
Start page: 1245
End page: 1258
Journal: Applied Numerical Mathematics 
Abstract: Computational strategies for estimating the seemingly unrelated regressions model after been updated with new observations are proposed. A sequential block algorithm based on orthogonal transformations and rich in BLAS-3 operations is proposed. It exploits efficiently the sparse structure of the data matrix and the Cholesky factor of the variance-covariance matrix. A parallel version of the new estimation algorithms for two important classes of models is considered. The parallel algorithm utilizes an efficient distribution of the matrices over the processors and has low inter-processor communication. Theoretical and experimental results are presented and analyzed. The parallel algorithm is found for these classes of models to be scalable and efficient
URI: https://hdl.handle.net/20.500.14279/2035
ISSN: 01689274
DOI: 10.1016/j.apnum.2007.01.004
Rights: © Elsevier
Type: Article
Affiliation: Cyprus University of Technology 
Affiliation : University of Cyprus 
University of Plovdiv “Paisii Hilendarski,” Bulgaria 
Appears in Collections:Άρθρα/Articles

Files in This Item:
File Description SizeFormat
Doc...doc23.5 kBMicrosoft WordView/Open
CORE Recommender
Show full item record

SCOPUSTM   
Citations

2
checked on Nov 9, 2023

WEB OF SCIENCETM
Citations 50

2
Last Week
0
Last month
0
checked on Oct 29, 2023

Page view(s)

388
Last Week
2
Last month
27
checked on Apr 28, 2024

Download(s)

69
checked on Apr 28, 2024

Google ScholarTM

Check

Altmetric


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