Submitted as: development and technical paper |
| 21 Sep 2016
Status: this preprint was under review for the journal GMD. A revision for further review has not been submitted.
Technical Note: Improving the computational efficiency of sparse matrix multiplication in linear atmospheric inverse problems
Vineet Yadavand Anna M. Michalak
Abstract. Matrix multiplication of two sparse matrices is a fundamental operation in linear Bayesian inverse problems for computing covariance matrices of observations and a posteriori uncertainties. Applications of sparse-sparse matrix multiplication algorithms for specific use-cases in such inverse problems remain unexplored. Here we present a hybrid-parallel sparse-sparse matrix multiplication approach that is more efficient by a third in terms of execution time and operation count relative to standard sparse matrix multiplication algorithms available in most libraries. Two modifications of this hybrid-parallel algorithm are also proposed for the types of operations typical of atmospheric inverse problems, which further reduce the cost of sparse matrix multiplication by yielding only upper triangular and/or dense matrices.
Publisher's note: Copernicus Publications remains neutral with regard to jurisdictional claims made in the text, published maps, institutional affiliations, or any other geographical representation in this preprint. The responsibility to include appropriate place names lies with the authors.
Multiplication of two matrices that consists of few non-zero entries is a fundamental operation in problems that involve estimation of greenhouse gas fluxes from atmospheric measurements. To increase computational efficiency of estimating these quantities, modification of the standard matrix multiplication algorithm for multiplying these matrices is proposed in this research.
Multiplication of two matrices that consists of few non-zero entries is a fundamental operation...
- Printer-friendly version
- Supplement