Approximate observability and back and forth observer of a PDE model of crystallisation process
Lucas Brivadis (LAGEPP), Ludovic Sacchelli (LAGEPP)

TL;DR
This paper demonstrates the approximate observability of a PDE model for a crystallization process and applies a back-and-forth nudging algorithm to estimate particle size distributions from chord length measurements.
Contribution
It proves approximate observability of a PDE system modeling crystallization and introduces a BFN algorithm for PSD reconstruction from CLD data.
Findings
Proved approximate observability of the PDE system.
Successfully applied BFN algorithm for PSD estimation.
Validated approach with theoretical guarantees.
Abstract
In this paper, we are interested in the estimation of Particle Size Distributions (PSDs) during a batch crystallization process in which particles of two different shapes coexist and evolve simultaneously. The PSDs are estimated thanks to a measurement of an apparent Chord Length Distribution (CLD), a measure that we model for crystals of spheroidal shape. Our main result is to prove the approximate observability of the infinite-dimensional system in any positive time. Under this observability condition, we are able to apply a Back and Forth Nudging (BFN) algorithm to reconstruct the PSD.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Code & Models
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsCrystallization and Solubility Studies · Bayesian Methods and Mixture Models · Point processes and geometric inequalities
