Michael Scott Eldred

Michael Scott Eldred

Auto-generated profile, based on publicly available information

Michael Scott Eldred

Sandia National Laboratories (SNL-NM), Albuquerque, NM (United States)

Research Focus & Metrics

Academic Career Length

23Years (2004-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
12 December 2012 in Journal of Mechanical Design
Verified
Journal Article
Closed access
PDF file
BBBarron J. Bichon
Barron J. Bichon
MEMichael S. Eldred
Michael S. Eldred
SMSankaran Mahadevan
Sankaran Mahadevan
JMJohn M. McFarland
John M. McFarland

1 January 2011 in International Journal for Uncertainty Quantification
Verified
Journal Article
Closed access
PDF file
MEMichael S. Eldred
Michael S. Eldred
HEHoward C. Elman
Howard C. Elman
Nonintrusive polynomial chaos expansion (PCE) and stochastic collocation (SC) methods are attractive techniques for uncertainty quantification due to their fast convergence properties and ability to produce functional representations of stochastic variability. PCE estimates coefficients for known orthogonal polynomial basis functions based on a set of response function evaluations, using sampling, linear regression, tensor-product quadrature, cubature, or Smolyak sparse grid approaches. SC, on the other hand, forms interpolation functions for known coefficients and requires the use of structured collocation point sets derived from tensor product or sparse grids. Once PCE or SC representations have been obtained for a response metric of interest, analytic expressions can be derived for the moments of the expansion and for the design derivatives of these moments, allowing for efficient design under uncertainty formulations involving moment control (e.g., robust design). This paper presents two approaches for moment design sensitivities, one involving a single response function expansion over the full range of both the design and uncertain variables and one involving response function and derivative expansions over only the uncertain variables for each instance of the design variables. These two approaches present trade-offs involving expansion dimensionality, global versus local validity, collocation point data requirements, and L2 (mean, variance, probability) versus L∞ (minima, maxima) interrogation requirements. Given this capability for analytic moments and moment sensitivities, bilevel, sequential, and multifidelity formulations for design under uncertainty are explored. Computational results are presented for a set of algebraic benchmark test problems, with attention to design formulation, stochastic expansion type, stochastic sensitivity approach, and numerical integration method.

30 May 2007 in Structure and Infrastructure Engineering
Verified
Journal Article
Closed access
MEM. S. Eldred
M. S. Eldred
HAH. Agarwal
H. Agarwal
VPV. M. Perez
V. M. Perez
SWS. F. Wojtkiewicz
S. F. Wojtkiewicz
JRJ. E. Renaud
J. E. Renaud
Reliability methods are probabilistic algorithms for quantifying the effect of simulation input uncertainties on response metrics of interest. In particular, they compute approximate response function distribution statistics (probability, reliability and response levels) based on specified input random variable probability distributions. In this paper, a number of algorithmic variations are explored for both the forward reliability analysis of computing probabilities for specified response levels (the reliability index approach (RIA)) and the inverse reliability analysis of computing response levels for specified probabilities (the performance measure approach (PMA)). These variations include limit state linearizations, probability integrations, warm starting and optimization algorithm selections. The resulting RIA/PMA reliability algorithms for uncertainty quantification are then employed within bi-level and sequential reliability-based design optimization approaches. Relative performance of these uncertainty quantification and reliability-based design optimization algorithms are presented for a number of computational experiments performed using the DAKOTA/UQ software.

5 August 2023 in Computer Methods in Applied Mechanics and Engineering
Verified
Journal Article
Closed access
XZXiaoshu Zeng
Xiaoshu Zeng
GGGianluca Geraci
Gianluca Geraci
MEMichael S. Eldred
Michael S. Eldred
JJJohn D. Jakeman
John D. Jakeman
AGAlex A. Gorodetsky
Alex A. Gorodetsky
RGRoger Ghanem
Roger Ghanem

30 September 2022 in Journal of Computational Physics
Verified
Journal Article
Closed access
LPLauren Partin
Lauren Partin
GGGianluca Geraci
Gianluca Geraci
ARAhmad A. Rushdi
Ahmad A. Rushdi
MEMichael S. Eldred
Michael S. Eldred
DSDaniele Schiavazzi
Daniele Schiavazzi

12 April 2010
Verified
Conference Paper
Closed access
GTGary Tang
Gary Tang
GIGianluca Iaccarino
Gianluca Iaccarino
MEMichael Eldred
Michael Eldred