Title:
Approximation of Probabilistic Distributions Using Selected Discrete Simulations
Approximation of Probabilistic Distributions Using Selected Discrete Simulations
| dc.contributor.author | McCormick, David Jeremy | en_US |
| dc.contributor.author | Olds, John R. | en_US |
| dc.contributor.corporatename | American Institute of Aeronautics and Astronautics | |
| dc.date.accessioned | 2006-03-17T15:59:14Z | |
| dc.date.available | 2006-03-17T15:59:14Z | |
| dc.date.issued | 2000-09 | |
| dc.description | 8th AIAA/USAF/NASA/ISSMO Symposium on Multidisciplinary Analysis and Optimization Long Beach, CA, September 6-8, 2000. | en_US |
| dc.description.abstract | The goal of this research is to find a computationally efficient and easy to use alternative to current approximation of direct Monte Carlo methods for robust design. More specifically, a new technique is sought to use selected deterministic analyses to obtain probability distributions for analyses with large inherent uncertainties. Two techniques for this task are investigated. The first uses a design of experiments array to find key points in the algorithm space upon which deterministic analyses will be performed. An expectation value error minimization routine is then used to assign discrete probabilities to the individual runs in the array based on the joint probability distribution of the inputs. This creates a representative distribution that can be used to estimate expectation values for the output distribution. The second technique uses a similar error minimization algorithm, but this time alters the location of the points to be sampled from the function space. This means that for every change in input variable distribution, the algorithm will generate a table of runs at input locations that minimize the error in expectation values. The advantages of these techniques include a small time savings over approximation or direct Monte Carlo methods as well as elimination of numerical noise due to random number generation. This noise will be shown to be a hindrance when converging multiple Monte Carlo analyses. In additional, when the variable location sampling point algorithm is used, this takes away the arbitrary task of defining levels for the input variables and provides enhanced accuracy. | |
| dc.format.extent | 419608 bytes | |
| dc.format.mimetype | application/pdf | |
| dc.identifier.uri | http://hdl.handle.net/1853/8410 | |
| dc.language.iso | en_US | |
| dc.publisher | Georgia Institute of Technology | en_US |
| dc.publisher.original | American Institute of Aeronautics and Astronautics (AIAA) | |
| dc.relation.ispartofseries | SSDL ; AIAA 2000-4863 | en_US |
| dc.subject | Probabilistic analysis | |
| dc.subject | Robust design simulations | |
| dc.subject | Deterministic analysis | |
| dc.subject | Modeling of uncertainty | |
| dc.title | Approximation of Probabilistic Distributions Using Selected Discrete Simulations | en_US |
| dc.type | Text | |
| dc.type.genre | Paper | |
| dspace.entity.type | Publication | |
| local.contributor.corporatename | Space Systems Design Laboratory (SSDL) | |
| local.contributor.corporatename | Daniel Guggenheim School of Aerospace Engineering | |
| local.contributor.corporatename | Daniel Guggenheim School of Aerospace Engineering | |
| relation.isOrgUnitOfPublication | dc68da3d-4cfe-4508-a4b0-35ba8de923fb | |
| relation.isOrgUnitOfPublication | a348b767-ea7e-4789-af1f-1f1d5925fb65 | |
| relation.isOrgUnitOfPublication | a348b767-ea7e-4789-af1f-1f1d5925fb65 |
Files
Original bundle
1 - 1 of 1
- Name:
- AIAA-2000-4863.pdf
- Size:
- 409.77 KB
- Format:
- Adobe Portable Document Format
- Description: