arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~
arXiv 1405.2276math.NAcs.NA
收藏

基于分层矩阵和低秩微扰方法的快速卡尔曼滤波

Fast Kalman Filter using Hierarchical-matrices and low-rank perturbative approach

Tufts University(塔夫茨大学);Stanford University(斯坦福大学)

Arvind K. Saibaba, Eric Miller, Peter K. Kitanidis

AI总结:

本文提出一种快速卡尔曼滤波算法,用于随机游走预测模型。通过高效表示估计协方差矩阵,结合过程噪声协方差矩阵和低秩项,实现O(N log N)的计算复杂度。

摘要:

我们开发了一种用于随机游走预测模型的快速卡尔曼滤波算法。关键思想是将每个时间步的估计协方差矩阵表示为过程噪声协方差矩阵和通过广义本征值问题计算的低秩项的加权和。我们描述了更新上述项的权重以及计算广义本征值问题(GEP)本征模式的高效算法。所提出的卡尔曼滤波算法在内存和计算成本上分别为O(N)和O(N log N),其中N是网格点数。我们展示了如何从每个时间步的状态分布中高效计算不确定性度量和条件实现。还讨论了非线性测量算子情况的扩展。数值实验展示了算法性能,应用于利用旅行时间反演监测地下二氧化碳的合成示例。

英文摘要:

We develop a fast algorithm for Kalman Filter applied to the random walk forecast model. The key idea is an efficient representation of the estimate covariance matrix at each time-step as a weighted sum of two contributions - the process noise covariance matrix and a low rank term computed from a generalized eigenvalue problem, which combines information from the noise covariance matrix and the data. We describe an efficient algorithm to update the weights of the above terms and the computation of eigenmodes of the generalized eigenvalue problem (GEP). The resulting algorithm for the Kalman filter with a random walk forecast model scales as $\bigO(N)$ in memory and $\bigO(N \log N)$ in computational cost, where $N$ is the number of grid points. We show how to efficiently compute measures of uncertainty and conditional realizations from the state distribution at each time step. An extension to the case with nonlinear measurement operators is also discussed. Numerical experiments demonstrate the performance of our algorithms, which are applied to a synthetic example from monitoring CO$_2$ in the subsurface using travel time tomography.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑