Stochastic Methods and Simulation

Allen Holder and Joseph Eichholz
Additional contact information
Allen Holder: Rose-Hulman Institute of Technology
Joseph Eichholz: Rose-Hulman Institute of Technology

Chapter Chapter 6 in An Introduction to Computational Science, 2019, pp 237-268 from Springer

Abstract: Abstract This chapter develops stochastic computational methods that assume random elements within their computational task. The methods prior to this chapter have largely been deterministic, as they have not depended on random elements in their computation—previous exceptions being our studies of linear regression, simulated annealing, and genetic algorithms. These exceptions point to a dichotomy into how randomness leaks itself into the computational arena. One way is to use a random element to help decide a deterministic quantity. For example, solving a deterministic TSP problem with either simulated annealing or a genetic algorithm incorporates a stochastic search in the attempt to calculate the deterministic value that is the shortest tour. In this case the problem is deterministic, but the calculation method is stochastic.

Date: 2019
References: Add references at CitEc
Citations:

There are no downloads for this item, see the EconPapers FAQ for hints about obtaining it.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:spr:isochp:978-3-030-15679-4_6

Ordering information: This item can be ordered from
http://www.springer.com/9783030156794

DOI: 10.1007/978-3-030-15679-4_6

Access Statistics for this chapter

More chapters in International Series in Operations Research & Management Science from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().