Monte Carlo method
Broad class of computational algorithms using random sampling to obtain numerical results
Monte Carlo methods, also called the Monte Carlo experiments or Monte Carlo simulations, are a broad class of computational algorithms based on repeated random sampling for obtaining numerical results, conceptualized by Polish mathematician Stanisław Ulam. The underlying concept is to use randomness to solve deterministic problems.
Nº Q232207 ★★★★
Super Rare · Knowledge
Monte Carlo method
Broad class of computational algorithms using random sampling to obtain numerical results
Monte Carlo methods, also called the Monte Carlo experiments or Monte Carlo simulations, are a broad class of computational algorithms based on repeated random sampling for obtaining numerical results, conceptualized by Polish mathematician Stanisław Ulam. The underlying concept is to use randomness to solve deterministic problems.
Last price
—
Floor price
—
7-day median
—
30-day sales
0
30-day range
—
In circulation
0
Price history
median
low – high
sales
No sales in this period
Show table
| Date | median | Low | High | sales |
|---|
Sales history
- Last sale
- —
- 30-day average
- —
- 30-day low
- —
- 30-day high
- —
- Sales 7d
- 0
- Sales 30d
- 0
No sales yet.
Anonymous sales: no buyer or seller shown. Figures count player-to-player sales only.
From Wikipedia
Monte Carlo methods, also called the Monte Carlo experiments or Monte Carlo simulations, are a broad class of computational algorithms based on repeated random sampling for obtaining numerical results, conceptualized by Polish mathematician Stanisław Ulam. The underlying concept is to use randomness to solve deterministic problems. Monte Carlo methods are mainly used in three distinct problem classes: optimization, numerical integration, and non-uniform random variate generation, available for modeling phenomena with significant input uncertainties, e.g. risk assessments for nuclear power plants. Monte Carlo methods are often implemented using computer simulations. They can provide approximate solutions to problems too complex for mathematical analysis.
Text: Wikipédia, CC BY-SA 4.0. · Image: nicoguaro (CC BY 3.0) ·
Related cards
Metropolis–Hastings algorithm
Algorithm
Nº Q910810 ★★
Crank–Nicolson method
Finite difference method for numerically solving parabolic differential equations
Nº Q588725 ★
Monte Carlo tree search
Heuristic search algorithm based on random sampling
Nº Q11785332 ★★
Method of characteristics
Technique for solving hyperbolic partial differential equations
Nº Q1785085 ★
Heron's method
Heron's method of calculating a square root
Nº Q20725439 ★★★
Nelder–Mead method
Numerical optimization algorithm
Nº Q1253278 ★★