Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “Parametric PDE”

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.

28 records · Page 2
All sourcesNASA NTRSDOE OSTI
DOE OSTI2025

From disorganized data to emergent dynamic models: Questionnaires to partial differential equations

Starting with sets of disorganized observations of spatially varying and temporally evolving systems, obtained at different (also disorganized) sets of parameters, we demonstrate the data-driven derivation of parameter dependent, evolutionary partial differential equation (PDE) models capable of generating the data. This tensor type of data is reminiscent of shuffled (multidimensional) puzzle tiles. The independent variables for the evolution equations (their “space” and “time”) as well as their effective parameters are all emergent , i.e. determined in a data-driven way from our disorganized observations of behavior in them. We use a diffusion map based questionnaire approach to build a smooth parametrization of our emergent space/time/parameter space for the data. This approach iteratively processes the data by successively observing them on the “space,” the “time” and the “parameter” axes of a tensor. Once the data become organized, we use machine learning (here, neural networks) to approximate the operators governing the evolution equations in this emergent space. Our illustrative examples are based (i) on a simple advection–diffusion model; (ii) on a previously developed vertex-plus-signaling model of Drosophila embryonic development; and (iii) on two complex dynamic network models (one neuronal and one coupled oscillator model) for which no obvious smooth embedding geometry is known a priori. This allows us to discuss features of the process like symmetry breaking, translational invariance, and autonomousness of the emergent PDE model, as well as its interpretability.

generative models↗
DOE OSTI2021

Learning viscoelasticity models from indirect data using deep neural networks

In this study, we propose a novel approach to model viscoelasticity materials, where rate-dependent and non-linear constitutive relationships are approximated with deep neural networks. We assume that inputs and outputs of the neural networks are not directly observable, and therefore common training techniques with input–output pairs for the neural networks are inapplicable. To that end, we develop a novel computational approach to both calibrate parametric and learn neural-network-based constitutive relations of viscoelasticity materials from indirect displacement data in the context of multiple-physics systems. We show that limited displacement data holds sufficient information to quantify the viscoelasticity behavior. We formulate the inverse computation – modeling viscoelasticity properties from observed displacement data – as a PDE-constrained optimization problem and minimize the error functional using a gradient-based optimization method. The gradients are computed by a combination of automatic differentiation and implicit function differentiation rules. The effectiveness of our method is demonstrated through numerous benchmark problems in geomechanics and porous media transport.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2023

Residual-based error correction for neural operator accelerated infinite-dimensional Bayesian inverse problems

We explore using neural operators, or neural network representations of nonlinear maps between function spaces, to accelerate infinite-dimensional Bayesian inverse problems (BIPs) with models governed by nonlinear parametric partial differential equations (PDEs). Neural operators have gained significant attention in recent years for their ability to approximate the parameter-to-solution maps defined by PDEs using as training data solutions of PDEs at a limited number of parameter samples. The computational cost of BIPs can be drastically reduced if the large number of PDE solves required for posterior characterization are replaced with evaluations of trained neural operators. However, reducing error in the resulting BIP solutions via reducing the approximation error of the neural operators in training can be challenging and unreliable. We provide an a priori error bound result that implies certain BIPs can be ill-conditioned to the approximation error of neural operators, thus leading to inaccessible accuracy requirements in training. To reliably deploy neural operators in BIPs, we consider a strategy for enhancing the performance of neural operators: correcting the prediction of a trained neural operator by solving a linear variational problem based on the PDE residual. We show that a trained neural operator with error correction can achieve a quadratic reduction of its approximation error, all while retaining substantial computational speedups of posterior sampling when models are governed by highly nonlinear PDEs. The strategy is applied to two numerical examples of BIPs based on a nonlinear reaction–diffusion problem and deformation of hyperelastic materials. We demonstrate that posterior representations of the two BIPs produced using trained neural operators are greatly and consistently enhanced by error correction.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2025

Leveraging operator learning to accelerate convergence of the preconditioned conjugate gradient method

We propose a new deflation strategy to accelerate the convergence of the preconditioned conjugate gradient (PCG) method for solving parametric large-scale linear systems of equations. Unlike traditional deflation techniques that rely on eigenvector approximations or recycled Krylov subspaces, we generate the deflation subspaces using operator learning, specifically the Deep Operator Network (DeepONet). To this aim, we introduce two complementary approaches for assembling the deflation operators. The first approach approximates near-null space vectors of the discrete PDE operator using the basis functions learned by the DeepONet. The second approach directly leverages solutions predicted by the DeepONet. To further enhance convergence, we also propose several strategies for prescribing the sparsity pattern of the deflation operator. Here, a comprehensive set of numerical experiments encompassing steady-state, time-dependent, scalar, and vector-valued problems posed on both structured and unstructured geometries is presented and demonstrates the effectiveness of the proposed DeepONet-based deflated PCG method, as well as its generalization across a wide range of model parameters and problem resolutions.

Deflation↗
NASA NTRS2001

Multi-Level Analysis of Pulsed Detonation Engines

The present study explores some issues concerning the operational performance of pulsed detonation engines. Zero-, one- and two-dimensional, transient models are employed in a synergistic manner to elucidate the various characteristics that can be expected from each level of analysis. The zero-dimensional model provides rapid parametric trends that help to identify the global characteristics of pulsed detonation engines. The one-dimensional model adds key wave propagation issues that are omitted in the zero-dimensional model and helps to assess its limitations. Finally, the two-dimensional model allows estimates of the first-order multi-dimensional effects and provides an initial multi-dimensional end-correction for the one-dimensional model. The zero-dimensional results indicate that the pulsed detonation engine is competitive with a rocket engine when exhausting to vacuum conditions. At finite back pressures, the PDE out-performs the rocket if the combustion pressure rise from the detonation is added to the chamber pressure in the rocket. If the two peak pressures are the same, the rocket performance is higher. Two-dimensional corrections added to the one-dimensional model result in a modest improvement in predicted specific impulse over the constant pressure boundary condition.

Ebrahimi, Houshang B.↗
NASA NTRS1995

Rapid Airplane Parametric Input Design (RAPID)

RAPID is a methodology and software system to define a class of airplane configurations and directly evaluate surface grids, volume grids, and grid sensitivity on and about the configurations. A distinguishing characteristic which separates RAPID from other airplane surface modellers is that the output grids and grid sensitivity are directly applicable in CFD analysis. A small set of design parameters and grid control parameters govern the process which is incorporated into interactive software for 'real time' visual analysis and into batch software for the application of optimization technology. The computed surface grids and volume grids are suitable for a wide range of Computational Fluid Dynamics (CFD) simulation. The general airplane configuration has wing, fuselage, horizontal tail, and vertical tail components. The double-delta wing and tail components are manifested by solving a fourth order partial differential equation (PDE) subject to Dirichlet and Neumann boundary conditions. The design parameters are incorporated into the boundary conditions and therefore govern the shapes of the surfaces. The PDE solution yields a smooth transition between boundaries. Surface grids suitable for CFD calculation are created by establishing an H-type topology about the configuration and incorporating grid spacing functions in the PDE equation for the lifting components and the fuselage definition equations. User specified grid parameters govern the location and degree of grid concentration. A two-block volume grid about a configuration is calculated using the Control Point Form (CPF) technique. The interactive software, which runs on Silicon Graphics IRIS workstations, allows design parameters to be continuously varied and the resulting surface grid to be observed in real time. The batch software computes both the surface and volume grids and also computes the sensitivity of the output grid with respect to the input design parameters by applying the precompiler tool ADIFOR to the grid generation program. The output of ADIFOR is a new source code containing the old code plus expressions for derivatives of specified dependent variables (grid coordinates) with respect to specified independent variables (design parameters). The RAPID methodology and software provide a means of rapidly defining numerical prototypes, grids, and grid sensitivity of a class of airplane configurations. This technology and software is highly useful for CFD research for preliminary design and optimization processes.

Smith, Robert E.↗
DOE OSTI2025

Optimization problems governed by systems of PDEs with uncertainties

This paper reviews current theoretical and numerical approaches to optimization problems governed by partial differential equations (PDEs) that depend on random variables or random fields. Such problems arise in many engineering, science, economics and societal decision-making tasks. This paper focuses on problems in which the governing PDEs are parametrized by the random variables/fields, and the decisions are made at the beginning and are not revised once uncertainty is revealed. Examples of such problems are presented to motivate the topic of this paper, and to illustrate the impact of different ways to model uncertainty in the formulations of the optimization problem and their impact on the solution. A linear–quadratic elliptic optimal control problem is used to provide a detailed discussion of the set-up for the risk-neutral optimization problem formulation, study the existence and characterization of its solution, and survey numerical methods for computing it. Different ways to model uncertainty in the PDE-constrained optimization problem are surveyed in an abstract setting, including risk measures, distributionally robust optimization formulations, probabilistic functions and chance constraints, and stochastic orders. Furthermore, approximation-based optimization approaches and stochastic methods for the solution of the large-scale PDE-constrained optimization problems under uncertainty are described. Some possible future research directions are outlined.

Heinkenschloss, Matthias [Rice Univ., Houston, TX ↗
NASA NTRS2003

Performance Enhancement of Unsteady Ejectors Investigated Using a Pulsejet Driver

Unsteady ejectors are currently under investigation for use in some pulse detonation engine (PDE) propulsion systems. This is due primarily to their potential high performance in comparison to steady ejectors of similar dimensions relative to the source or driver jet. Although some experimental work has been done in the past to study thrust augmentation with unsteady ejectors, there is no proven theory by which optimal design parameters can be selected and an effective ejector constructed for a given pulsed flow. Therefore, an experimental facility was developed at the NASA Glenn Research Center to study the correlation between ejector design and performance, and to get a better understanding of the flow phenomena that result in thrust augmentation. A commercially available pulsejet was used for the unsteady driving jet. This was paired with a basic, yet flexible, ejector design that allowed parametric evaluation of the effects that length, diameter, and inlet radius have on performance.

Paxson, Daniel E.↗
DOE OSTI2024

Subsampling of Parametric Models with Bifidelity Boosting

Least squares regression is a ubiquitous tool for building emulators (a.k.a. surrogate models) of problems across science and engineering for purposes such as design space exploration and uncertainty quantification. When the regression data are generated using an experimental design process (e.g., a quadrature grid) involving computationally expensive models, or when the data size is large, sketching techniques have shown promise at reducing the cost of the construction of the regression model while ensuring accuracy comparable to that of the full data. However, random sketching strategies, such as those based on leverage scores, lead to regression errors that are random and may exhibit large variability. To mitigate this issue, we present a novel boosting approach that leverages cheaper, lower-fidelity data of the problem at hand to identify the best sketch among a set of candidate sketches. This in turn specifies the sketch of the intended high-fidelity model and the associated data. We provide theoretical analyses of this bifidelity boosting (BFB) approach and discuss the conditions the low- and high-fidelity data must satisfy for a successful boosting. In doing so, we derive a bound on the residual norm of the BFB sketched solution relating it to its ideal, but computationally expensive, high-fidelity boosted counterpart. Finally, empirical results on both manufactured and PDE data corroborate the theoretical analyses and illustrate the efficacy of the BFB solution in reducing the regression error, as compared to the nonboosted solution.

97 MATHEMATICS AND COMPUTING↗
NASA NTRSDate not supplied

A Generalized, Compactly-Supported Correlation Function for Data Assimilation Applications

Correlation functions play an essential role in modern data assimilation, where they are used to model covariances given a set of tunable parameters or applied as tapering functions to localize covariances in ensemble-based schemes. One of the most widely-used correlation functions in data assimilation is the Gaspari and Cohn (1999) piecewise-rational, compactly-supported parametric correlation function (hereafter referred to as GC99). The GC99 correlation function is useful due to its tunable cut-off parameter c and Gaussian-like shape achieved when the parameter a is set to one-half. These properties are attractive for tapering functions in data assimilation applications. However, the GC99 correlation function is homogeneous over Euclidean 3-space and isotropic when restricted to the sphere, properties that may be less than ideal for some geophysical applications. GC99 is also compactly-supported on a sphere of fixed radius, which requires tuning of the cut-off parameter c that can depend on the specific application. This work presents a generalization of the GC99 correlation function that allows the cut-off parameter c and shape parameter a to vary over space to gain more flexibility in shape while maintaining its compact support property. The function, which we call the Generalized Gaspari Cohn (GenGC) correlation function, introduces inhomogeneity in Euclidean 3-space and anisotropy when restricted to the sphere by allowing both parameters c and a to vary, as functions, over the spatial domain. The GC99 correlation function is a special case of GenGC where the functions c and a are held constant, as fixed parameters rather than functions. The GenGC correlation function also generalizes the follow-on to the work of Gaspari and Cohn (1999) presented in Gaspari et al. (2006), which allowed a to vary while keeping c fixed. We illustrate through simple one- and two-dimensional examples the variety of inhomogeneous and anisotropic correlation functions GenGC can produce by varying c and a over space, and suggest applications where they may be useful in data assimilation, such as covariance modeling or localization. In particular, we describe how the GenGC correlation function can be used to construct covariances using correlation length and variance fields derived from dynamics. For example, the correlation length field for advective dynamics is governed by a partial differential equation (PDE) in N spatial dimensions, where N is the number of space dimensions of the state. Correlation length fields can be determined from this PDE and used with GenGC to construct the corresponding correlations. We can then approximate the full covariance by rescaling by the variance, which also satisfies a PDE in N spatial dimensions for advective dynamics. Thus we can approximate the full covariance without solving the covariance PDE, which is in 2N spatial dimensions, by solving just two PDEs each in only N spatial dimensions. This approach to evolving the correlation length and variance fields, then reconstructing the correlations using GenGC, is suggested as an alternative to current methods of covariance modeling in data assimilation algorithms.

GC99↗