Efficient computation of matrix-vector products with full observation weighting matrices in data assimilation
Guannan Hu, Sarah L. Dance

TL;DR
This paper introduces a fast multipole method-based approach to efficiently compute matrix-vector products with full observation weighting matrices in data assimilation, significantly reducing computational costs for large datasets.
Contribution
It adapts the SVD-FMM technique for data assimilation, providing a novel parallelization scheme and demonstrating its accuracy and efficiency through numerical experiments.
Findings
SVD-FMM greatly reduces computational complexity.
The method maintains accuracy with various covariance matrices.
Parallelization reduces communication costs in computations.
Abstract
Recent studies have demonstrated improved skill in numerical weather prediction via the use of spatially correlated observation error covariance information in data assimilation systems. In this case, the observation weighting matrices (inverse error covariance matrices) used in the assimilation may be full matrices rather than diagonal. Thus, the computation of matrix-vector products in the variational minimization problem may be very time-consuming, particularly if the parallel computation of the matrix-vector product requires a high degree of communication between processing elements. Hence, we introduce a well-known numerical approximation method, called the fast multipole method (FMM), to speed up the matrix-vector multiplications in data assimilation. We explore a particular type of FMM that uses a singular value decomposition (SVD-FMM) and adjust it to suit our new application in…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
