Parallel restricted maximum likelihood estimation for linear models with a dense exogenous matrix

Authors:
Joël M. Malard
Affiliations:
Pacific Northwest National Laboratory, Battelle Boulevard, P.O. Box 999, Richland, WA
Venue:
Parallel Computing - Parallel matrix algorithms and applications
Year:
2002

Citing 7
Cited 0

Matrix computations (3rd ed.)

Matrix computations (3rd ed.)
Efficient management of parallelism in object-oriented numerical software libraries

Modern software tools for scientific computing
Parallel implementation of a multilevel modelling package

Computational Statistics & Data Analysis - Special issue on parallel processing and statistics
A Restricted Additive Schwarz Preconditioner for General Sparse Linear Systems

SIAM Journal on Scientific Computing
Parallel Strategies for Solving SURE Models with Variance Inequalities and Positivity of Correlations Constraints

Computational Economics - Computational Studies at Stanford
An updated set of basic linear algebra subprograms (BLAS)

ACM Transactions on Mathematical Software (TOMS)
Structured automatic differentiation

Structured automatic differentiation

Quantified Score

Hi-index	0.00

Visualization

Abstract

Restricted maximum likelihood (REML) estimation of variance-covariance matrices is an optimization problem that has both scientific and industrial applications. Parallel REML gradient algorithms are presented and compared for linear models whose covariance matrix is large, sparse and possibly unstructured. These algorithms are implemented using publicly available toolkits and demonstrate that REML estimates of large, sparse covariance matrices can be computed efficiently on multicomputers with hundreds of processors by using an effective mixture of data distributions together with a mixture of dense and sparse linear algebra kernels.