اشترك بالحزمة الذهبية واحصل على وصول غير محدود شمرا أكاديميا
تسجيل مستخدم جديدA Parameter Estimation Method Using Linear Response Statistics: Numerical Scheme
188
0
0.0
(
0
)
اسأل ChatGPT حول البحث
ﻻ يوجد ملخص باللغة العربية
This paper presents a numerical method to implement the parameter estimation method using response statistics that was recently formulated by the authors. The proposed approach formulates the parameter estimation problem of It^o drift diffusions as a nonlinear least-squares problem. To avoid solving the model repeatedly when using an iterative scheme in solving the resulting least-squares problems, a polynomial surrogate model is employed on appropriate response statistics with smooth dependence on the parameters. The existence of minimizers of the approximate polynomial least-squares problems that converge to the solution of the true least square problem is established under appropriate regularity assumption of the essential statistics as functions of parameters. Numerical implementation of the proposed method is conducted on two prototypical examples that belong to classes of models with wide range of applications, including the Langevin dynamics and the stochastically forced gradient flows. Several important practical issues, such as the selection of the appropriate response operator to ensure the identifiability of the parameters and the reduction of the parameter space, are discussed. From the numerical experiments, it is found that the proposed approach is superior compared to the conventional approach that uses equilibrium statistics to determine the parameters.
قيم البحث
اقرأ أيضاً
Numerical mode matching (NMM) methods are widely used for analyzing wave propagation and scattering in structures that are piece-wise uniform along one spatial direction. For open structures that are unbounded in transverse directions (perpendicular
to the uniform direction), the NMM methods use the perfectly matched layer (PML) technique to truncate the transverse variables. When incident waves are specified in homogeneous media surrounding the main structure, the total field is not always outgoing, and the NMM methods rely on reference solutions for each uniform segment. Existing NMM methods have difficulty handing gracing incident waves and special incident waves related to the onset of total internal reflection, and are not very efficient at computing reference solutions for non-plane incident waves. In this paper, a new NMM method is developed to overcome these limitations. A Robin-type boundary condition is proposed to ensure that non-propagating and non-decaying wave field components are not reflected by truncated PMLs. Exponential convergence of the PML solutions based on the hybrid Dirichlet-Robin boundary condition is established theoretically. A fast method is developed for computing reference solutions for cylindrical incident waves. The new NMM is implemented for two-dimensional structures and polarized electromagnetic waves. Numerical experiments are carried out to validate the new NMM method and to demonstrate its performance.
In this work we consider information-theoretical observables to analyze short symbolic sequences, comprising time-series that represent the orientation of a single spin in a $2D$ Ising ferromagnet on a square lattice of size $L^2=128^2$, for differen
t system temperatures $T$. The latter were chosen from an interval enclosing the critical point $T_{rm c}$ of the model. At small temperatures the sequences are thus very regular, at high temperatures they are maximally random. In the vicinity of the critical point, nontrivial, long-range correlations appear. Here, we implement estimators for the entropy rate, excess entropy (i.e. complexity) and multi-information. First, we implement a Lempel-Ziv string parsing scheme, providing seemingly elaborate entropy rate and multi-information estimates and an approximate estimator for the excess entropy. Furthermore, we apply easy-to-use black-box data compression utilities, providing approximate estimators only. For comparison and to yield results for benchmarking purposes we implement the information-theoretic observables also based on the well-established M-block Shannon entropy, which is more tedious to apply compared to the the first two algorithmic entropy estimation procedures. To test how well one can exploit the potential of such data compression techniques, we aim at detecting the critical point of the $2D$ Ising ferromagnet. Among the above observables, the multi-information, which is known to exhibit an isolated peak at the critical point, is very easy to replicate by means of both efficient algorithmic entropy estimation procedures. Finally, we assess how good the various algorithmic entropy estimates compare to the more conventional block entropy estimates and illustrate a simple modification that yields enhanced results.
We investigate theoretically and numerically the use of the Least-Squares Finite-element method (LSFEM) to approach data-assimilation problems for the steady-state, incompressible Navier-Stokes equations. Our LSFEM discretization is based on a stress
-velocity-pressure (S-V-P) first-order formulation, using discrete counterparts of the Sobolev spaces $H({rm div}) times H^1 times L^2$ respectively. Resolution of the system is via minimization of a least-squares functional representing the magnitude of the residual of the equations. A simple and immediate approach to extend this solver to data-assimilation is to add a data-discrepancy term to the functional. Whereas most data-assimilation techniques require a large number of evaluations of the forward-simulations and are therefore very expensive, the approach proposed in this work uniquely has the same cost as a single forward run. However, the question arises: what is the statistical model implied by this choice? We answer this within the Bayesian framework, establishing the latent background covariance model and the likelihood. Further we demonstrate that - in the linear case - the method is equivalent to application of the Kalman filter, and derive the posterior covariance. We practically demonstrate the capabilities of our method on a backward-facing step case. Our LSFEM formulation (without data) is shown to have good approximation quality, even on relatively coarse meshes - in particular with respect to mass-conservation and reattachment location. Adding limited velocity measurements from experiment, we show that the method is able to correct for discretization error on very coarse meshes, as well as correct for the influence of unknown and uncertain boundary-conditions.
Estimating parameters of Partial Differential Equations (PDEs) is of interest in a number of applications such as geophysical and medical imaging. Parameter estimation is commonly phrased as a PDE-constrained optimization problem that can be solved i
teratively using gradient-based optimization. A computational bottleneck in such approaches is that the underlying PDEs needs to be solved numerous times before the model is reconstructed with sufficient accuracy. One way to reduce this computational burden is by using Model Order Reduction (MOR) techniques such as the Multiscale Finite Volume Method (MSFV). In this paper, we apply MSFV for solving high-dimensional parameter estimation problems. Given a finite volume discretization of the PDE on a fine mesh, the MSFV method reduces the problem size by computing a parameter-dependent projection onto a nested coarse mesh. A novelty in our work is the integration of MSFV into a PDE-constrained optimization framework, which updates the reduced space in each iteration. We also present a computationally tractable way of differentiating the MOR solution that acknowledges the change of basis. As we demonstrate in our numerical experiments, our method leads to computational savings particularly for large-scale parameter estimation problems and can benefit from parallelization.
We present a Markov-chain Monte-Carlo (MCMC) technique to study the source parameters of gravitational-wave signals from the inspirals of stellar-mass compact binaries detected with ground-based gravitational-wave detectors such as LIGO and Virgo, fo
r the case where spin is present in the more massive compact object in the binary. We discuss aspects of the MCMC algorithm that allow us to sample the parameter space in an efficient way. We show sample runs that illustrate the possibilities of our MCMC code and the difficulties that we encounter.
سجل دخول لتتمكن من نشر تعليقات
التعليقات
جاري جلب التعليقات
سجل دخول لتتمكن من متابعة معايير البحث التي قمت باختيارها
