Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “polynomial expansions”

Search indexed NASA NTRS and DOE OSTI research on propulsion, heat transfer, battery materials and energy systems. Follow report and document links to the original sources.

Quote a phrase for an exact phrase match. Source license links do not imply unrestricted reuse.

At least 91 records · Page 5
All sourcesNASA NTRSDOE OSTI
NASA NTRS2003

Genetic Algorithm Phase Retrieval for the Systematic Image-Based Optical Alignment Testbed

Phase retrieval requires calculation of the real-valued phase of the pupil fimction from the image intensity distribution and characteristics of an optical system. Genetic 'algorithms were used to solve two one-dimensional phase retrieval problem. A GA successfully estimated the coefficients of a polynomial expansion of the phase when the number of coefficients was correctly specified. A GA also successfully estimated the multiple p h e s of a segmented optical system analogous to the seven-mirror Systematic Image-Based Optical Alignment (SIBOA) testbed located at NASA s Marshall Space Flight Center. The SIBOA testbed was developed to investigate phase retrieval techniques. Tiphilt and piston motions of the mirrors accomplish phase corrections. A constant phase over each mirror can be achieved by an independent tip/tilt correction: the phase Conection term can then be factored out of the Discrete Fourier Tranform (DFT), greatly reducing computations.

Taylor, Jaime↗
NASA NTRS2004

Three-Dimensional High-Order Spectral Volume Method for Solving Maxwell's Equations on Unstructured Grids

A three-dimensional, high-order, conservative, and efficient discontinuous spectral volume (SV) method for the solutions of Maxwell's equations on unstructured grids is presented. The concept of discontinuous 2nd high-order loca1 representations to achieve conservation and high accuracy is utilized in a manner similar to the Discontinuous Galerkin (DG) method, but instead of using a Galerkin finite-element formulation, the SV method is based on a finite-volume approach to attain a simpler formulation. Conventional unstructured finite-volume methods require data reconstruction based on the least-squares formulation using neighboring cell data. Since each unknown employs a different stencil, one must repeat the least-squares inversion for every cell at each time step, or to store the inversion coefficients. In a high-order, three-dimensional computation, the former would involve impractically large CPU time, while for the latter the memory requirement becomes prohibitive. In the SV method, one starts with a relatively coarse grid of triangles or tetrahedra, called spectral volumes (SVs), and partition each SV into a number of structured subcells, called control volumes (CVs), that support a polynomial expansion of a desired degree of precision. The unknowns are cell averages over CVs. If all the SVs are partitioned in a geometrically similar manner, the reconstruction becomes universal as a weighted sum of unknowns, and only a few universal coefficients need to be stored for the surface integrals over CV faces. Since the solution is discontinuous across the SV boundaries, a Riemann solver is thus necessary to maintain conservation. In the paper, multi-parameter and symmetric SV partitions, up to quartic for triangle and cubic for tetrahedron, are first presented. The corresponding weight coefficients for CV face integrals in terms of CV cell averages for each partition are analytically determined. These discretization formulas are then applied to the integral form of the Maxwell equations. All numerical procedures for outer boundary, material interface, zonal interface, and interior SV face are unified with a single characteristic formulation. The load balancing in a massive parallel computing environment is therefore easier to achieve. A parameter is introduced in the Riemann solver to control the strength of the smoothing term. Important aspects of the data structure and its effects to communication and the optimum use of cache memory are discussed. Results will be presented for plane TE and TM waves incident on a perfectly conducting cylinder for up to fifth order of accuracy, and a plane wave incident on a perfectly conducting sphere for up to fourth order of accuracy. Comparisons are made with exact solutions for these cases.

Liu, Yen↗
NASA NTRS2015

Subharmonic Oscillations and Chaos in Dynamic Atomic Force Microscopy

The increasing use of dynamic atomic force microscopy (d-AFM) for nanoscale materials characterization calls for a deeper understanding of the cantilever dynamics influencing scan stability, predictability, and image quality. Model development is critical to such understanding. Renormalization of the equations governing d- AFM provides a simple interpretation of cantilever dynamics as a single spring and mass system with frequency dependent cantilever stiffness and damping parameters. The renormalized model is sufficiently robust to predict the experimentally observed splitting of the free-space cantilever resonance into multiple resonances upon cantilever-sample contact. Central to the model is the representation of the cantilever sample interaction force as a polynomial expansion with coefficients F(sub ij) (i,j = 0, 1, 2) that account for the effective interaction stiffness parameter, the cantilever-to-sample energy transfer, and the amplitude of cantilever oscillation. Application of the Melnikov method to the model equation is shown to predict a homoclinic bifurcation of the Smale horseshoe type leading to a cascade of period doublings with increasing drive displacement amplitude culminating in chaos and loss of image quality. The threshold value of the drive displacement amplitude necessary to initiate subharmonic generation depends on the acoustic drive frequency, the effective damping coefficient, and the nonlinearity of the cantilever-sample interaction force. For parameter values leading to displacement amplitudes below threshold for homoclinic bifurcation other bifurcation scenarios can occur, some of which lead to chaos.

Cantrell, John H.↗
NASA NTRS2021

Seawater Debye Model Function at L-Band and Its Impact on Salinity Retrieval From Aquarius Satellite Data

A model function of seawater, which specifies the dielectric constant of seawater as a function of salinity, temperature, and frequency, is important for the retrieval of sea surface salinity using satellite data. In 2017, a model function has been developed based on measurement data at 1.4134 GHz using a third-order polynomial expression in salinity ( S ) and temperature ( T ). Although the model showed improvements in salinity retrieval, it had an inconsistent behavior between partitioned salinities. To improve the stability of the model, new dielectric measurements of seawater have been made recently over a broad range of salinities and temperatures to expand the data set used for developing the model function. The structure of the model function has been changed from a polynomial expansion in S and T to a physics-based model consisting of a Debye molecular resonance term plus a conductivity term. Each unknown parameter is expressed in S and T based on the expanded measurement data set. Physical arguments have been used to limit the number of unknown coefficients in these expressions to improve the stability of the model function. The new model function has been employed in the retrieval algorithm of the Aquarius satellite mission to obtain a global salinity map. The retrieved salinity using a different model function is compared with in situ data collected by Argo floats to evaluate the impact and the performance of model functions. The results indicate that the new model function has significant improvements in salinity retrieval compared with other existing models.

Seawater↗
NASA NTRSDate not supplied

Constrained Field Construction Using Bernstein Polynomial Derived Operators

This method recasts the mass-conservation equation as a Sylvester equation employing high-order derivative operators derived from modified Bernstein polynomial expansions. Given prescribed velocity fields, the algorithm yields a constrained, least-squared solution for the associated density field. To demonstrate the practical utility of this methodology, it is applied to a computationally-derived two-dimensional isolator dataset. This reconstruction method is envisioned to be used in conjunction with diagnostic techniques to aid in the quantification of isolator flow fields, since obtaining highly characterized datasets within this engine component is exceedingly difficult.

Isolator↗
NASA NTRS2012

Uncertainty Quantification for Polynomial Systems via Bernstein Expansions

This paper presents a unifying framework to uncertainty quantification for systems having polynomial response metrics that depend on both aleatory and epistemic uncertainties. The approach proposed, which is based on the Bernstein expansions of polynomials, enables bounding the range of moments and failure probabilities of response metrics as well as finding supersets of the extreme epistemic realizations where the limits of such ranges occur. These bounds and supersets, whose analytical structure renders them free of approximation error, can be made arbitrarily tight with additional computational effort. Furthermore, this framework enables determining the importance of particular uncertain parameters according to the extent to which they affect the first two moments of response metrics and failure probabilities. This analysis enables determining the parameters that should be considered uncertain as well as those that can be assumed to be constants without incurring significant error. The analytical nature of the approach eliminates the numerical error that characterizes the sampling-based techniques commonly used to propagate aleatory uncertainties as well as the possibility of under predicting the range of the statistic of interest that may result from searching for the best- and worstcase epistemic values via nonlinear optimization or sampling.

Crespo, Luis G.↗
DOE OSTI2023

Stochastic modeling and statistical calibration with model error and scarce data

This paper introduces a procedure to assess the predictive accuracy of stochastic models subject to model error and sparse data. Model error is introduced as uncertainty on the coefficients of appropriate polynomial chaos expansions (PCE). The error associated with finite sample size allows us to conceive of these coefficients as statistics of the data that we describe as random variables whose influence on output quantities of interest is evaluated through the extended polynomial chaos expansion (EPCE). A Bayesian data assimilation scheme is introduced to update these expansions by considering the resulting nested chaos expansion as a hierarchical probabilistic model. Stochastic models of quantities of interest (QoI) are thus constructed and efficiently evaluated. Here, the Metropolis–Hastings Markov chain Monte Carlo procedure is used to sample the posterior. Two illustrative analytical and numerical problems are used to demonstrate the proposed approach.

Bayesian inference↗
NASA NTRSDate not supplied

Design Under Uncertainty with Design-Dependent Uncertain Variables

Uncertainty quantification (UQ) can provide a more robust understanding of a system, leading to better informed decisions earlier in the design process. The additional information that UQ provides can be leveraged during a design optimization process known as design under uncertainty that, when incorporated with multidisciplinary design and optimization, can become computationally infeasible due to the large number of responses required for meaningful results. Previous work addressed reducing the computational expense in design under uncertainty by incorporating analytic derivatives throughout polynomial chaos expansion. Although this allows design under uncertainty to be feasible for more systems, some multidisciplinary systems have design-dependent uncertain variables. This paper details an implementation of design dependent uncertain variables in a manner than preserves derivatives required for efficient gradient-based optimization throughout the process. Two analytic examples of design-dependent uncertain variables are given: the first transforms a uniform uncertain variable with one design variable and the second transforms a normal uncertain variable with two design variables. The polynomial chaos expansion (PCE) results are comparable to both the Monte Carlo (MC) results and the analytic results for the two examples. A case study that maximizes the lift-to-drag ratio with a design-dependence between the wing leading edge sweep angle and uncertain parameter percentage of laminar flow is compared to a MC and alternative optimization formulations. This paper demonstrates that design-dependent uncertain variables are valid and hold throughout PCE.

robust design↗
DOE OSTI2025

Polynomial Chaos Surrogate Construction for Random Fields with Parametric Uncertainty

Engineering and applied science rely on computational experiments to rigorously study physical systems. The mathematical models used to probe these systems are highly complex, and sampling-intensive studies often require prohibitively many simulations for acceptable accuracy. Surrogate models provide a means of circumventing the high computational expense of sampling such complex models. In particular, polynomial chaos expansions (PCEs) have been successfully used for uncertainty quantification studies of deterministic models where the dominant source of uncertainty is parametric. We discuss an extension to conventional PCE surrogate modeling to enable surrogate construction for stochastic computational models that have intrinsic noise in addition to parametric uncertainty. We develop a PCE surrogate on a joint space of intrinsic and parametric uncertainty, enabled by Rosenblatt transformations, which are evaluated via kernel density estimation of the associated conditional cumulative distributions. Furthermore, we extend the construction to random field data via the Karhunen–Loève expansion. We then take advantage of closed-form solutions for computing PCE Sobol indices to perform a global sensitivity analysis of the model which quantifies the intrinsic noise contribution to the overall model output variance. Additionally, the resulting joint PCE is generative in the sense that it allows generating random realizations at any input parameter setting that are statistically approximately equivalent to realizations from the underlying stochastic model. The method is demonstrated on a chemical catalysis example model and a synthetic example controlled by a parameter that enables a switch from unimodal to bimodal response distributions.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2023

Stochastic Framework for Optimal Control of Planetary Reentry Trajectories Under Multilevel Uncertainties

We present a novel stochastic optimal control framework that accounts for various types of uncertainties, with application to reentry trajectory planning. The formulation of the optimal trajectory control problem is presented in the context of an indirect method where a functional objective associated with the terminal vehicle speed is to be minimized. Uncertain input parameters in the optimal trajectory control model, including aerodynamic parameters and initial and terminal conditions, are modeled as aleatory random variables, while the statistical parameters of these aleatory distributions are themselves random variables. The parametric and model uncertainties are simultaneously propagated through an extended polynomial chaos expansion (EPCE) formalism. Several metrics are described to evaluate response statistics and presented as insightful tools for robust decision making. Specifically, the response probability density function (PDF) reflecting influence of both epistemic and aleatory uncertainties is obtained. By sampling over the random variables representing model error, an ensemble of response PDFs is generated and the associated failure probability is estimated as a random variable with its own polynomial chaos expansion. Besides, the sensitivity index functions of response PDF with respect to the statistical parameters are evaluated. Coupling parametric and model uncertainties within the EPCE framework leads to a robust and efficient paradigm for multilevel uncertainty propagation and PDF characterization in general optimal control problems.

Engineering↗
NASA NTRSDate not supplied

Design Under Uncertainty for Conceptual Aircraft Design Leveraging Analytical Gradients

The purpose of this paper is to extend previously demonstrated methodologies for design under uncertainty, leveraging analytical gradients to higher fidelity analysis for use in conceptual aircraft design. Previous work developed methods to generate analytical derivatives through polynomial chaos expansion, eliminating the need to estimate derivatives via complex step or finite difference. In this research, the authors build upon the methods to include physics-based aircraft design codes for aircraft design under uncertainty. This extends the previous work’s case study, which employed analytical aerodynamics and Breguet range estimations for wing design, to a higher fidelity level. In addition, this work extends previous work on interface development between the Uncertainty Quantification with Polynomial Chaos Expansion (UQPCE) software and Model-Based Systems Analysis and Engineering (MBSA&E) frameworks. This paper will discuss the development work necessary to perform multidisciplinary design under uncertainty as well as demonstrate the mechanics of interfacing UQPCE and conceptual aircraft design tools such as NASA’s Aviary code. In a case study, a conceptual aircraft design under uncertainty was conducted and compared against a traditional deterministic design. When given information about the uncertainty space from UQPCE, the optimizer was able to shape the output distribution and produce a more robust design

UQ↗
NASA NTRSDate not supplied

Design Under Uncertainty for Conceptual Aircraft Design Leveraging Analytical Gradients

The purpose of this paper is to extend previously demonstrated methodologies for design under uncertainty, leveraging analytical gradients to higher fidelity analysis for use in conceptual aircraft design. Previous work developed methods to generate analytical derivatives through polynomial chaos expansion, eliminating the need to estimate derivatives via complex step or finite difference. In this research, the authors build upon the methods to include physics-based aircraft design codes for aircraft design under uncertainty. This extends the previous work’s case study, which employed analytical aerodynamics and Breguet range estimations for wing design, to a higher fidelity level. In addition, this work extends previous work on interface development between the Uncertainty Quantification with Polynomial Chaos Expansion (UQPCE) software and Model-Based Systems Analysis and Engineering (MBSA&E) frameworks. This paper will discuss the development work necessary to perform multidisciplinary design under uncertainty as well as demonstrate the mechanics of interfacing UQPCE and conceptual aircraft design tools such as NASA’s Aviary code. In a case study, a conceptual aircraft design under uncertainty was conducted and compared against a traditional deterministic design. When given information about the uncertainty space from UQPCE, the optimizer was able to shape the output distribution and produce a more robust design.

UQ↗
NASA NTRSDate not supplied

Design Under Uncertainty with Design-Dependent Uncertain Variables

Uncertainty quantification (UQ) can provide a more robust understanding of a system, leading to better informed decisions earlier in the design process. The additional information that UQ provides can be leveraged during a design optimization process known as design under uncertainty that, when incorporated with multidisciplinary design and optimization, can become computationally infeasible due to the large number of responses required for meaningful results. Previous work addressed reducing the computational expense in design under uncertainty by incorporating analytic derivatives throughout polynomial chaos expansion. Although this allows design under uncertainty to be feasible for more systems, some multidisciplinary systems have design-dependent uncertain variables. This paper details an implementation of design dependent uncertain variables in a manner than preserves derivatives required for efficient gradient-based optimization throughout the process. Two analytic examples of design-dependent uncertain variables are given: the first transforms a uniform uncertain variable with one design variable and the second transforms a normal uncertain variable with two design variables. The polynomial chaos expansion (PCE) results are comparable to both the Monte Carlo (MC) results and the analytic results for the two examples. A case study that maximizes the lift-to-drag ratio with a design-dependence between the wing leading edge sweep angle and uncertain parameter percentage of laminar flow is compared to a MC and alternative optimization formulations. This paper demonstrates that design-dependent uncertain variables are valid and hold throughout PCE.

Joanna N Schmidt↗
DOE OSTI2025

Neural chaos: A spectral stochastic neural operator

Building surrogate models for operators with uncertainty quantification capabilities is essential for many engineering applications where randomness–such as variability in material properties, boundary conditions, and initial conditions–is unavoidable. Polynomial Chaos Expansion (PCE) is widely recognized as a go-to method for constructing stochastic surrogates in both intrusive and non-intrusive ways, and it has recently been used in the context of operator learning. However, its application becomes challenging for complex or high-dimensional processes, as achieving accuracy requires higher-order polynomials, which can increase computational demand and/or the risk of overfitting. Furthermore, PCE requires specialized treatments to manage random variables that are not independent, and these treatments may be problem-dependent or may fail with increasing complexity. Here, in this work, we adopt the same formalism as the spectral expansion used in PCE; however, we replace the classical polynomial basis functions with neural network (NN) basis functions to leverage their expressivity. To achieve this, we propose an algorithm that identifies NN-parameterized basis functions in a purely data-driven manner, without any prior assumptions about the joint distribution of the random variables involved, whether independent or dependent, or about their marginal distributions. The proposed algorithm identifies each NN-parameterized basis function sequentially, ensuring they are orthogonal with respect to the data distribution. The basis functions are constructed directly on the joint stochastic variables without requiring a tensor product structure or assuming independence of the random variables. This approach may offer greater flexibility for complex stochastic models, while simplifying implementation compared to the tensor product structures typically used in PCE to handle random vectors. This is particularly advantageous given the current state of open-source packages, where building and training neural networks can be done with just a few lines of code and extensive community support. We demonstrate the effectiveness of the proposed scheme through several numerical examples of varying complexity and provide comparisons with classical PCE.

Polynomial chaos expansion↗
DOE OSTI2022

GenMod: A generative modeling approach for spectral representation of PDEs with random inputs

Here, we propose a method for quantifying uncertainty in high-dimensional PDE systems with random parameters, where the number of solution evaluations is small. Parametric PDE solutions are often approximated using a spectral decomposition based on polynomial chaos expansions. For the class of systems we consider (i.e., high dimensional with limited solution evaluations) the coefficients are given by an underdetermined linear system in a regression formulation. This implies additional assumptions, such as sparsity of the coefficient vector, are needed to approximate the solution. Here, we present an approach where we assume the coefficients are close to the range of a generative model that maps from a low to a high dimensional space of coefficients. Our approach is inspired be recent work examining how generative models can be used for compressed sensing in systems with random Gaussian measurement matrices. Using results from PDE theory on coefficient decay rates, we construct an explicit generative model that predicts the polynomial chaos coefficient magnitudes. The algorithm we developed to find the coefficients, which we call GenMod, is composed of two main steps. First, we predict the coefficient signs using Orthogonal Matching Pursuit. Then, we assume the coefficients are within a sparse deviation from the range of a sign-adjusted generative model. This allows us to find the coefficients by solving a nonconvex optimization problem, over the input space of the generative model and the space of sparse vectors. We obtain theoretical recovery results for a Lipschitz continuous generative model and for a more specific generative model, based on coefficient decay rate bounds. We examine three high-dimensional problems and show that, for all three examples, the generative model approach outperforms sparsity promoting methods at small sample sizes.

97 MATHEMATICS AND COMPUTING↗