A Monte Carlo approach to computing stiffness matrices arising in polynomial chaos approximations

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

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

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

منابع مشابه

Comparison of polynomial approximations to speed up planewave-based quantum Monte Carlo calculations

Article history: Received 31 October 2014 Received in revised form 21 January 2015 Accepted 22 January 2015 Available online 7 February 2015

متن کامل

Fast Monte Carlo Algorithms for Matrices II: Computing a Low-Rank Approximation to a Matrix

In many applications, the data consist of (or may be naturally formulated as) an m×n matrix A. It is often of interest to find a low-rank approximation to A, i.e., an approximation D to the matrix A of rank not greater than a specified rank k, where k is much smaller than m and n. Methods such as the singular value decomposition (SVD) may be used to find an approximation to A which is the best ...

متن کامل

Computing strategies for achieving acceptability: A Monte Carlo approach

We consider a trader who wants to direct his or her portfolio towards a set of acceptable wealths given by a convex risk measure. We propose a Monte Carlo algorithm, whose inputs are the joint law of stock prices and the convex risk measure, and whose outputs are the numerical values of initial capital requirement and the functional form of a trading strategy for achieving acceptability. We als...

متن کامل

A Polynomial Hybrid Monte Carlo Algorithm

We present a simulation algorithm for dynamical fermions that combines the multiboson technique with the Hybrid Monte Carlo algorithm. We find that the algorithm gives a substantial gain over the standard methods in practical simulations. We point out the ability of the algorithm to treat fermion zero modes in a clean and controllable manner.

متن کامل

A Monte Carlo Approach to Sequence Assembly

Motivation: Assembling shotgun sequencing data from repetitive DNA sequences is a non-trivial task. In existing sequence assembly methods repeats are resolved by either using statistical analyses to identify and separate fragments corresponding to repeats, or by using extra information, not contained in the fragments. In this paper we take a different approach. Using the simulated-tempering Mon...

متن کامل

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


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

ژورنال

عنوان ژورنال: Mathematics and Computers in Simulation

سال: 2019

ISSN: 0378-4754

DOI: 10.1016/j.matcom.2018.11.008