Kirk-Othmer Encyclopedia of Chemical Technology 2007
DOI: 10.1002/0471238961.sampdiwe.a01
|View full text |Cite
|
Sign up to set email alerts
|

Sampling Techniques

Abstract: Sampling is a statistical procedure that involves the selection of a finite number of individuals to represent and infer some knowledge about a population of concern. Sampling techniques are used in a wide range of science and engineering applications; they are of basic importance in computational statistics, in the implementation of probabilistic algorithms, and in related problems of statistical computing that have a stochastic ingredient (eg, financial modeling, artificial intelligence, computational chemis… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1
1

Citation Types

0
4
0

Year Published

2015
2015
2022
2022

Publication Types

Select...
7
2

Relationship

2
7

Authors

Journals

citations
Cited by 11 publications
(4 citation statements)
references
References 131 publications
(117 reference statements)
0
4
0
Order By: Relevance
“…Finally, the Response Surface Optimization is executed based on the Response Surface and the defined objectives. In our case, the objectives are to minimize the pressure drop and maximize the velocity uniformity and the Screening method based on Shifted Hammersley Sampling is used [6,7]. As results, DX provides the best candidates for defined objectives and in the case of multiple objectives, it also shows the graph of Pareto fronts.…”
Section: Designxplorermentioning
confidence: 99%
“…Finally, the Response Surface Optimization is executed based on the Response Surface and the defined objectives. In our case, the objectives are to minimize the pressure drop and maximize the velocity uniformity and the Screening method based on Shifted Hammersley Sampling is used [6,7]. As results, DX provides the best candidates for defined objectives and in the case of multiple objectives, it also shows the graph of Pareto fronts.…”
Section: Designxplorermentioning
confidence: 99%
“…Even the derivative information is calculated using reweighing. We use the efficient Hammersley sequence sampling (HSS) [45,46] for the base distributions to increase the computational efficiency further. The algorithm we have developed is essentially a sequential quadratic programming (SQP) algorithm that replaces the sampling loop and uses a reweighting scheme to estimate the objective function and gradient at each iteration.…”
Section: The Bonus Algorithmmentioning
confidence: 99%
“…Therefore, in order to reach high accuracy, larger sample sizes are needed, which adversely affects the computational efficiency (Diwekar & Kalagnanam, 1997;Diwekar & Ulas, 2007). algorithm.…”
Section: Efficient Ant Colony Optimization (Eaco) Algorithmmentioning
confidence: 99%