Subscribe to the gold package and get unlimited access to Shamra Academy
Register a new userClustering-based convergence diagnostic for multi-modal identification in parameter estimation of chromatography model with parallel MCMC
101
0
0.0
(
0
)
Added by
Qiao-Le He
Publication date
2021
fields
Informatics Engineering
and research's language is
English
Ask ChatGPT about the research
No Arabic abstract
Uncertainties from experiments and models render multi-modal difficulties in model calibrations. Bayesian inference and textsc{mcmc} algorithm have been applied to obtain posterior distributions of model parameters upon uncertainty. However, multi-modality leads to difficulty in convergence criterion of parallel textsc{mcmc} sampling chains. The commonly applied $widehat{R}$ diagnostic does not behave well when multiple sampling chains are evolving to different modes. Both partitional and hierarchical clustering methods has been combined to the traditional $widehat{R}$ diagnostic to deal with sampling of target distributions that are rough and multi-modal. It is observed that the distributions of binding parameters and pore diffusion of particle parameters are multi-modal. Therefore, the steric mass-action model used to describe ion-exchange effects of the model protein, lysozyme, on the textsc{sp} Sepharose textsc{ff} stationary phase might not be fully capable in certain experimental conditions, as model uncertainty from steric mass-action would result in multi-modality.
rate research
Read More
Mode-based model-reduction is used to reduce the degrees of freedom of high dimensional systems, often by describing the system state by a linear combination of spatial modes. Transport dominated phenomena, ubiquitous in technical and scientific applications, often require a large number of linear modes to obtain a small representation error. This difficulty, even for the most simple transports, originates from the inappropriateness of the decomposition structure in time dependent amplitudes of purely spatial modes. In this article an approach is discussed, which decomposes a flow field into several fields of co-moving frames, where each one can be approximated by a few modes. The method of decomposition is formulated as an optimization problem. Different singular-value-based objective functions are discussed and connected to former formulations. A boundary treatment is provided. The decomposition is applied to generic cases and to a technically relevant flow configuration of combustion physics.
Reduced model spaces, such as reduced basis and polynomial chaos, are linear spaces $V_n$ of finite dimension $n$ which are designed for the efficient approximation of families parametrized PDEs in a Hilbert space $V$. The manifold $mathcal{M}$ that gathers the solutions of the PDE for all admissible parameter values is globally approximated by the space $V_n$ with some controlled accuracy $epsilon_n$, which is typically much smaller than when using standard approximation spaces of the same dimension such as finite elements. Reduced model spaces have also been proposed in [13] as a vehicle to design a simple linear recovery algorithm of the state $uinmathcal{M}$ corresponding to a particular solution when the values of parameters are unknown but a set of data is given by $m$ linear measurements of the state. The measurements are of the form $ell_j(u)$, $j=1,dots,m$, where the $ell_j$ are linear functionals on $V$. The analysis of this approach in [2] shows that the recovery error is bounded by $mu_nepsilon_n$, where $mu_n=mu(V_n,W)$ is the inverse of an inf-sup constant that describe the angle between $V_n$ and the space $W$ spanned by the Riesz representers of $(ell_1,dots,ell_m)$. A reduced model space which is efficient for approximation might thus be ineffective for recovery if $mu_n$ is large or infinite. In this paper, we discuss the existence and construction of an optimal reduced model space for this recovery method, and we extend our search to affine spaces. Our basic observation is that this problem is equivalent to the search of an optimal affine algorithm for the recovery of $mathcal{M}$ in the worst case error sense. This allows us to perform our search by a convex optimization procedure. Numerical tests illustrate that the reduced model spaces constructed from our approach perform better than the classical reduced basis spaces.
We perform the linear stability analysis for a new model for poromechanical processes with inertia (formulated in mixed form using the solid deformation, fluid pressure, and total pressure) interacting with diffusing and reacting solutes convected in the medium. We find parameter regions that lead to spatio-temporal instabilities of the coupled system. The mutual dependences between deformation and diffusive patterns are of substantial relevance in the study of morphoelastic changes in biomaterials. We provide a set of computational examples in 2D and 3D (related to brain mechanobiology) that can be used to form a better understanding on how, and up to which extent, the deformations of the porous structure dictate the generation and suppression of spatial patterning dynamics, also related to the onset of mechano-chemical waves.
State estimation aims at approximately reconstructing the solution $u$ to a parametrized partial differential equation from $m$ linear measurements, when the parameter vector $y$ is unknown. Fast numerical recovery methods have been proposed based on reduced models which are linear spaces of moderate dimension $n$ which are tailored to approximate the solution manifold $mathcal{M}$ where the solution sits. These methods can be viewed as deterministic counterparts to Bayesian estimation approaches, and are proved to be optimal when the prior is expressed by approximability of the solution with respect to the reduced model. However, they are inherently limited by their linear nature, which bounds from below their best possible performance by the Kolmogorov width $d_m(mathcal{M})$ of the solution manifold. In this paper we propose to break this barrier by using simple nonlinear reduced models that consist of a finite union of linear spaces $V_k$, each having dimension at most $m$ and leading to different estimators $u_k^*$. A model selection mechanism based on minimizing the PDE residual over the parameter space is used to select from this collection the final estimator $u^*$. Our analysis shows that $u^*$ meets optimal recovery benchmarks that are inherent to the solution manifold and not tied to its Kolmogorov width. The residual minimization procedure is computationally simple in the relevant case of affine parameter dependence in the PDE. In addition, it results in an estimator $y^*$ for the unknown parameter vector. In this setting, we also discuss an alternating minimization (coordinate descent) algorithm for joint state and parameter estimation, that potentially improves the quality of both estimators.
In this paper, we develop two parameter-robust numerical algorithms for Biot model and applied the algorithms in brain edema simulations. By introducing an intermediate variable, we derive a multiphysics reformulation of the Biot model. Based on the reformulation, the Biot model is viewed as a generalized Stokes subproblem combining with a reaction-diffusion subproblem. Solving the two subproblems together or separately will lead to a coupled or a decoupled algorithm. We conduct extensive numerical experiments to show that the two algorithms are robust with respect to the physics parameters. The algorithms are applied to study the brain swelling caused by abnormal accumulation of cerebrospinal fluid in injured areas. The effects of key physics parameters on brain swelling are carefully investigated. It is observe that the permeability has the greatest effect on intracranial pressure (ICP) and tissue deformation; the Youngs modulus and the Poisson ratio will not affect the maximum ICP too much but will affect the tissue deformation and the developing speed of brain swelling.
Log in to be able to interact and post comments
comments
Fetching comments
Sign in to be able to follow your search criteria
