Papers › Regularized Ensemble Kalman Methods for Inverse Problems
Regularized Ensemble Kalman Methods for Inverse Problems
Xin-Lei Zhang, Carlos Michelén-Ströfer, Heng Xiao
The archive published only this paper's code-link row. Authors, date and abstract are from arXiv's metadata (CC0), read from the Kaggle arXiv metadata snapshot of 2026-09-12 where its title matched the archive's; the title is the archive's.
Inverse problems are common and important in many applications in computational physics but are inherently ill-posed with many possible model parameters resulting in satisfactory results in the observation space. When solving the inverse problem with adjoint-based optimization, the problem can be regularized by adding additional constraints in the cost function. However, similar regularizations have not been used in ensemble-based methods, where the same optimization is done implicitly through the analysis step rather than through explicit minimization of the cost function. Ensemble-based methods, and in particular ensemble Kalman methods, have gained popularity in practice where physics models typically do not have readily available adjoint capabilities. While the model outputs can be improved by incorporating observations using these methods, the lack of regularization means the inference of the model parameters remains ill-posed. Here we propose a regularized ensemble Kalman method capable of enforcing regularization constraints. Specifically, we derive a modified analysis scheme that implicitly minimizes a cost function with generalized constraints. We demonstrate the method's ability to regularize the inverse problem with three cases of increasing complexity, starting with inferring scalar model parameters. As a final case, we utilize the proposed method to infer the closure field in the Reynolds-averaged Navier--Stokes equations; a problem of significant importance in fluid dynamics and many engineering applications.
Code
Repository list and official/mentioned flags are the archive's, frozen 2025-07-28. Reachability, where shown, is from one Syntology probe window (2026-09-16 to 2026-09-18); repositories not probed show nothing. GitHub stars are not tracked.
Code Syntology ran Syntology
Not run by Syntology. Nothing on this page verifies that the listed code works.
Results from the paper archive 2025-07-28
No leaderboard rows for this paper in the archive.
Report a problem or propose a change · a person checks every report against the paper or source before anything changes; decisions are listed on /corrections