Unverified50% confidenceFactExact time
卡尔曼增益 K = PH^T(HPH^T + R)^{-1}，当R趋近零时K趋近H^{-1}，当P趋近零时K趋近零
1
Sources
50%
Confidence
Long-term
Relevance
7/14/2026
First Seen
Sources
多传感器卡尔曼融合实战：Shahed无人机追踪系统完整解析
Related Claims
Unverified卡尔曼增益公式为 K = PH^T(HPH^T + R)^{-1}，在线性高斯条件下达到理论最优估计82% similarPartially VerifiedKL divergence is asymmetric, i.e., D(p,q) ≠ D(q,p).63% similarUnverifiedKL散度是非对称的，P相对于Q的KL散度与Q相对于P的KL散度不相等63% similarUnverified阶数P的Runge-Kutta方法需要至少P次函数评估，单步误差为h^(P+1)62% similarUnverifiedThe division optimization technique of multiplying by a magic number and shifting originates from 'Hacker's Delight' (by Henry S. Warren Jr.), based on the principle n/d≈(n×M)>>k, where M≈2^k/d.59% similar
Cite This Claim
Stable URI
https://kongchang.com/claim/507283API
curl https://kongchang.com/api/v1/knowledge/claims/507283MCP
get_claim(id=507283)