arXiv (All)
open access
Finite-Dimensional Recursions for Small-Noise Expansions in Nonlinear Filtering
This paper provides a recursive formula for computing the coefficients in a small-system-noise asymptotic expansion for nonlinear filtering. The expansion, obtained from the Kallianpur--Striebel formula, was justified in the author's previous work. Our main contribution is to reduce the coefficient
Conceptio Open Archive
Analyze & explore related research in Conceptio
Connect this record directly into your research workflow or AI agent. Explore citations across open repositories, query full text, and export structured proof bundles.
This document is indexed with metadata only: full text is not available in the archive for this record. Open the official source ↗
Related documents
- Ergodicity for a class of stochastic Hasegawa-Mima equations with dissipation#1123107
- Dynamical Low-Rank Filters for Data Assimilation#926980
- Matrices perturbed by random noise: The accuracy of low-rank approximation#652125
- Matrices perturbed by random noise: The accuracy of low-rank approximation#650672
- Particle Filtering for a Class of State-Space Models with Low and Degenerate Observational Noise#1131445
Record · ID 1012429
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Bring this data into your agent: Connect via MCP or API · 20 free credits to start · no card required
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive