Efficient Gaussian Sampling for Solving Large-Scale Inverse Problems Using MCMC

نویسندگان
چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Efficient Gaussian Sampling for Solving Large-Scale Inverse Problems using MCMC Methods

The resolution of many large-scale inverse problems using MCMC methods requires a step of drawing samples from a high dimensional Gaussian distribution. While direct Gaussian sampling techniques, such as those based on Cholesky factorization, induce an excessive numerical complexity and memory requirement, sequential coordinate sampling methods present a low rate of convergence. Based on the re...

متن کامل

Solving Large-Scale Inverse Magnetostatic Problems using the Adjoint Method

An efficient algorithm for the reconstruction of the magnetization state within magnetic components is presented. The occurring inverse magnetostatic problem is solved by means of an adjoint approach, based on the Fredkin-Koehler method for the solution of the forward problem. Due to the use of hybrid FEM-BEM coupling combined with matrix compression techniques the resulting algorithm is well s...

متن کامل

Efficient Adaptive Strategy for Solving Inverse Problems

The paper describes the strategy for efficient solving of difficult inverse problems, utilizing Finite Element Method (FEM) as a direct problem solver. The strategy consists of finding an optimal balance between the accuracy of global optimization method and the accuracy of an hp-adaptive FEM used for the multiple solving of the direct problem. The crucial relation among errors was found for th...

متن کامل

An Efficient MCMC Method for Uncertainty Quantification in Inverse Problems

The connection between Bayesian statistics and the technique of regularization for inverse problems has been given significant attention in recent years. For example, Bayes’ law is frequently used as motivation for variational regularization methods of Tikhonov type. In this setting, the regularization function corresponds to the negative-log of the prior probability density; the fit-to-data fu...

متن کامل

Solving Large Scale Phylogenetic Problems using DCM2

In an earlier paper, we described a new method for phylogenetic tree reconstruction called the Disk Covering Method, or DCM. This is a general method which can be used with any existing phylogenetic method in order to improve its performance. We showed analytically and experimentally that when DCM is used in conjunction with polynomial time distance-based methods, it improves the accuracy of th...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: IEEE Transactions on Signal Processing

سال: 2015

ISSN: 1053-587X,1941-0476

DOI: 10.1109/tsp.2014.2367457