#504 new
George Gibson

Monte Carlo methods

Reported by George Gibson | June 13th, 2018 @ 01:35 PM

It is used primarily in those tasks (assignments of introduction - go to article and in which the theoretically-likely description is admitted. This is explained by the naturalness of obtaining a result with some given probability in problems with probable content, as well as a significant simplification of the solution procedure. The random variable X is normally distributed and its mean square deviation is known.
In this case, the probability is the upper bound of the error.
Where n - the number of tests (played out values of X); t is the value of the Laplace function argument, in which, it is the known mean square deviation of X.

No comments found

Please Sign in or create a free account to add a new ticket.

With your very own profile, you can contribute to projects, track your activity, watch tickets, receive and update tickets through your email and much more.

New-ticket Create new ticket

Create your profile

Help contribute to this project by taking a few moments to create your personal profile. Create your profile ยป

GitX is the nice-looking gitk clone for OS X

People watching this ticket