Asymptotic ensemble stabilizability of the Bloch equation

In this paper we are concerned with the stabilizability to an equilibrium point of an ensemble of non interacting half-spins. We assume that the spins are immersed in a static magnetic field, with dispersion in the Larmor frequency, and are controlled by a time varying transverse field. Our goal is to steer the whole ensemble to the uniform "down" position. Two cases are addressed: for a finite ensemble of spins, we provide a control function (in feedback form) that asymptotically stabilizes the ensemble in the "down" position, generically with respect to the initial condition. For an ensemble containing a countable number of spins, we construct a sequence of control functions such that the sequence of the corresponding solutions pointwise converges, asymptotically in time, to the target state, generically with respect to the initial conditions. The control functions proposed are uniformly bounded and continuous

On dimension reduction in Gaussian filters

A priori dimension reduction is a widely adopted technique for reducing the computational complexity of stationary inverse problems. In this setting, the solution of an inverse problem is parameterized by a low-dimensional basis that is often obtained from the truncated Karhunen-Loeve expansion of the prior distribution. For high-dimensional inverse problems equipped with smoothing priors, this technique can lead to drastic reductions in parameter dimension and significant computational savings. In this paper, we extend the concept of a priori dimension reduction to non-stationary inverse problems, in which the goal is to sequentially infer the state of a dynamical system. Our approach proceeds in an offline-online fashion. We first identify a low-dimensional subspace in the state space before solving the inverse problem (the offline phase), using either the method of "snapshots" or regularized covariance estimation. Then this subspace is used to reduce the computational complexity of various filtering algorithms - including the Kalman filter, extended Kalman filter, and ensemble Kalman filter - within a novel subspace-constrained Bayesian prediction-and-update procedure (the online phase). We demonstrate the performance of our new dimension reduction approach on various numerical examples. In some test cases, our approach reduces the dimensionality of the original problem by orders of magnitude and yields up to two orders of magnitude in computational savings

Model reduction, centering, and the Karhunen-Loeve expansion

We propose a new computationally efficient modeling method that captures a given translation symmetry in a system. To obtain a low order approximate system of ODEs, prior to performing a Karhunen Loeve expansion, we process the available data set using a “centering” procedure. This approach has been shown to be efficient in nonlinear scalar wave equations