arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 1105.0437math.NAcs.NA
收藏

行列式近似

Determinant Approximations

North Carolina State University(北卡罗来纳州立大学)

Ilse C. F. Ipsen, Dean J. Lee

AI总结:

本文推导了复矩阵行列式及其对数的近似序列及相对误差界,通过 det(X)=exp(trace(log(X))) 展开得到非 Hermitian 矩阵的近似,并展示了在有限温度核物质晶格模拟中的高效性和低存储需求。

摘要:

推导了复矩阵行列式及其对数的近似序列,并给出了相对误差界。这些行列式近似来自 det(X)=exp(trace(log(X))) 的展开,适用于非 Hermitian 矩阵。示例表明,这些行列式近似对于有限温度核物质的晶格模拟是有效的,并且比高斯消元法使用显著更少的空间。序列中的第一个近似是块对角近似;它代表了 Fischer 和 Hadamard 不等式向非 Hermitian 矩阵的推广。在 Hermitian 正定矩阵的特殊情况下,块对角近似可以与稀疏逆近似竞争。最后,给出了稀疏逆近似的另一种表示,并表明其精度随着包含更多矩阵元素而提高。

英文摘要:

A sequence of approximations for the determinant and its logarithm of a complex matrixis derived, along with relative error bounds. The determinant approximations are derived from expansions of det(X)=exp(trace(log(X))), and they apply to non-Hermitian matrices. Examples illustrate that these determinant approximations are efficient for lattice simulations of finite temperature nuclear matter, and that they use significantly less space than Gaussian elimination. The first approximation in the sequence is a block diagonal approximation; it represents an extension of Fischer's and Hadamard's inequalities to non-Hermitian matrices. In the special case of Hermitian positive-definite matrices, block diagonal approximations can be competitive with sparse inverse approximations. At last, a different representation of sparse inverse approximations is given and it is shown that their accuracy increases as more matrix elements are included.

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

↑