基于Givens旋转的不完全正交分解的高斯马尔可夫随机场
Specifying Gaussian Markov Random Fields with Incomplete Orthogonal Factorization using Givens Rotations
摘要:
本文讨论了通过Givens旋转的不完全正交分解求稀疏不完全Cholesky因子的方法,并将其应用于高斯马尔可夫随机场场(GMRF)。由不完全正交分解得到的不完全Cholesky因子通常比通过标准Cholesky分解得到的常用Cholesky因子稀疏。在计算方面,这种方法可以提供更稀疏的Cholesky因子,其给出了计算上更有效的GMRF表示。在理论方面,这种方法是稳定和鲁棒的,并且总是返回稀疏的Cholesky因子。由于这种方法既适用于正方形矩阵,也适用于矩形矩阵,因此它不仅适用于GMRF的精度矩阵,而且适用于GMRF以变量的子集或观测数据为条件的情况。一些常见的结构精度矩阵进行了测试,以说明该方法的实用性。这种方法的一个缺点是,不完全正交分解通常比标准库中实现的标准Cholesky分解慢,并且目前构建稀疏Cholesky因子可能更慢。
英文摘要:
In this paper an approach for finding a sparse incomplete Cholesky factor through an incomplete orthogonal factorization with Givens rotations is discussed and applied to Gaussian Markov random fields (GMRFs). The incomplete Cholesky factor obtained from the incomplete orthogonal factorization is usually sparser than the commonly used Cholesky factor obtained through the standard Cholesky factorization. On the computational side, this approach can provide a sparser Cholesky factor, which gives a computationally more efficient representation of GMRFs. On the theoretical side, this approach is stable and robust and always returns a sparse Cholesky factor. Since this approach applies both to square matrices and to rectangle matrices, it works well not only on precision matrices for GMRFs but also when the GMRFs are conditioned on a subset of the variables or on observed data. Some common structures for precision matrices are tested in order to illustrate the usefulness of the approach. One drawback to this approach is that the incomplete orthogonal factorization is usually slower than the standard Cholesky factorization implemented in standard libraries and currently it can be slower to build the sparse Cholesky factor.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。