Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “optimization, inverse problems”

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 199 records · Page 11
All sourcesNASA NTRSDOE OSTI
DOE OSTI2016

Optimal-Order Preconditioners for Linear Systems Arising in the Semismooth Newton Solution of a Class of Control-Constrained Problems

We present a new multigrid preconditioner for the linear systems arising in the semismooth Newton method solution of certain control-constrained, quadratic distributed optimal control problems. Using a piecewise constant discretization of the control space, each semismooth Newton iteration essentially requires inverting a principal submatrix of the matrix entering the normal equations of the associated unconstrained optimal control problem, the rows (and columns) of the submatrix representing the constraints deemed inactive at the current iteration. Previously developed multigrid preconditioners for the aforementioned submatrices were based on constructing a sequence of conforming coarser spaces and proved to be of suboptimal quality for the class of problems considered. Instead, the multigrid preconditioner introduced in this work uses nonconforming coarse spaces, and it is shown that, under reasonable geometric assumptions on the constraints that are deemed inactive, the preconditioner approximates the inverse of the desired submatrix to optimal order. The preconditioner is tested numerically on a classical elliptic-constrained optimal control problem and further on a constrained image-deblurring problem.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2022

Invertible Neural Networks for Airfoil Design

We report the airfoil design problem, in which an engineer seeks a shape with desired performance characteristics, is fundamental to aerodynamics. Design workflows traditionally rely on iterative optimization methods using low-fidelity integral boundary-layer methods as higher-fidelity adjoint-based computational fluid dynamics methods are computationally expensive. Surrogate-based approaches can accelerate the design process but still rely on some iterative inverse design procedure. In this work, we leverage emerging invertible neural network (INN) tools to enable the rapid inverse design of airfoil shapes for wind turbines. INNs are specialized deep-learning models with well-defined inverse mappings. When trained appropriately, INN surrogate models are capable of forward prediction of aerodynamic and structural quantities for a given airfoil shape as well as inverse recovery of airfoil shapes with specified aerodynamic and structural characteristics. The INN approach offers a roughly 100 times speed-up compared to adjoint-based methods for inverse design. We demonstrate the INN tool for inverse design on three test cases of 100 airfoils each that satisfy the performance characteristics close to those of airfoils used in wind-turbine blades. All generated shapes satisfy the desired aerodynamic characteristics, demonstrating the success of the INN approach for inverse design of airfoils.

17 WIND ENERGY↗
DOE OSTI2015

Subspace-based Inverse Uncertainty Quantification for Nuclear Data Assessment

Safety analysis and design optimization depend on the accurate prediction of various reactor attributes. Predictions can be enhanced by reducing the uncertainty associated with the attributes of interest. An inverse problem can be defined and solved to assess the sources of uncertainty, and experimental effort can be subsequently directed to further improve the uncertainty associated with these sources. In this work a subspace-based algorithm for inverse sensitivity/uncertainty quantification (IS/UQ) has been developed to enable analysts account for all sources of nuclear data uncertainties in support of target accuracy assessment-type analysis. An approximate analytical solution of the optimization problem is used to guide the search for the dominant uncertainty subspace. By limiting the search to a subspace, the degrees of freedom available for the optimization search are significantly reduced. A quarter PWR fuel assembly is modeled and the accuracy of the multiplication factor and the fission reaction rate are used as reactor attributes whose uncertainties are to be reduced. Numerical experiments are used to demonstrate the computational efficiency of the proposed algorithm. Our ongoing work is focusing on extending the proposed algorithm to account for various forms of feedback, e.g., thermal-hydraulics and depletion effects.

21 SPECIFIC NUCLEAR REACTORS AND ASSOCIATED PLANTS↗
DOE OSTI2015

Turning statistical physics models into materials design engines

Despite the success statistical physics has enjoyed at predicting the properties of materials for given parameters, the inverse problem, identifying which material parameters produce given, desired properties, is only beginning to be addressed. Recently, several methods have emerged across disciplines that draw upon optimization and simulation to create computer programs that tailor material responses to specified behaviors. However, so far the methods developed either involve black-box techniques, in which the optimizer operates without explicit knowledge of the material's configuration space, or require carefully tuned algorithms with applicability limited to a narrow subclass of materials. Here we introduce a formalism that can generate optimizers automatically by extending statistical mechanics into the realm of design. The strength of this approach lies in its capability to transform statistical models that describe materials into optimizers to tailor them. Here, by comparing against standard black-box optimization methods, we demonstrate how optimizers generated by this formalism can be faster and more effective, while remaining straightforward to implement. The scope of our approach includes possibilities for solving a variety of complex optimization and design problems concerning materials both in and out of equilibrium.

36 MATERIALS SCIENCE↗
DOE OSTI2013

A multiresolution spatial parametrization for the estimation of fossil-fuel carbon dioxide emissions via atmospheric inversions.

The estimation of fossil-fuel CO2 emissions (ffCO2) from limited ground-based and satellite measurements of CO2 concentrations will form a key component of the monitoring of treaties aimed at the abatement of greenhouse gas emissions. To that end, we construct a multiresolution spatial parametrization for fossil-fuel CO2 emissions (ffCO2), to be used in atmospheric inversions. Such a parametrization does not currently exist. The parametrization uses wavelets to accurately capture the multiscale, nonstationary nature of ffCO2 emissions and employs proxies of human habitation, e.g., images of lights at night and maps of built-up areas to reduce the dimensionality of the multiresolution parametrization. The parametrization is used in a synthetic data inversion to test its suitability for use in atmospheric inverse problem. This linear inverse problem is predicated on observations of ffCO2 concentrations collected at measurement towers. We adapt a convex optimization technique, commonly used in the reconstruction of compressively sensed images, to perform sparse reconstruction of the time-variant ffCO2 emission field. We also borrow concepts from compressive sensing to impose boundary conditions i.e., to limit ffCO2 emissions within an irregularly shaped region (the United States, in our case). We find that the optimization algorithm performs a data-driven sparsification of the spatial parametrization and retains only of those wavelets whose weights could be estimated from the observations. Further, our method for the imposition of boundary conditions leads to a 10 computational saving over conventional means of doing so. We conclude with a discussion of the accuracy of the estimated emissions and the suitability of the spatial parametrization for use in inverse problems with a significant degree of regularization.

Ray, Jaideep↗
DOE OSTI2020

Optimal experimental design for prediction based on push-forward probability measures

Incorporating experimental data is essential for increasing the credibility of simulation-aided decision making and design. This paper presents a method which uses a computational model to guide the optimal acquisition of experimental data to produce data-informed predictions of quantities of interest (QoI). Many strategies for optimal experimental design (OED) select data that maximize some utility that measures the reduction in uncertainty of uncertain model parameters, for example the expected information gain between prior and posterior distributions of these parameters. In this paper, we seek to maximize the expected information gained from the pushforward of an initial (prior) density to the push-forward of the updated (posterior) density through the parameter-to-prediction map. The formulation presented is based upon the solution of a specific class of stochastic inverse problems which seeks a probability density that is consistent with the model and the data in the sense that the push-forward of this density through the parameter-to-observable map matches a target density on the observable data. While this stochastic inverse problem forms the mathematical basis for our approach, we develop a one-step algorithm, focused on push-forward probability measures, that leverages inference-for-prediction to bypass constructing the solution to the stochastic inverse problem. A number of numerical results are presented to demonstrate the utility of this optimal experimental design for prediction and facilitate comparison of our approach with traditional OED.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗
DOE OSTI2023

A greedy Galerkin method to efficiently select sensors for linear dynamical systems

A key challenge in inverse problems is the selection of sensors to gather the most effective data. In this paper, we consider the problem of inferring the initial condition to a linear dynamical system and develop an efficient control-theoretical approach for greedily selecting sensors. Our method employs a Galerkin projection to reduce the size of the inverse problem, resulting in a computationally efficient algorithm for sensor selection. As a byproduct of our algorithm, we obtain a preconditioner for the inverse problem that enables the rapid recovery of the initial condition. Here, we analyze the theoretical performance of our greedy sensor selection algorithm as well as the performance of the associated preconditioner. Finally, we verify our theoretical results on various inverse problems involving partial differential equations.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2014

The static response function in Kohn-Sham theory: An appropriate basis for its matrix representation in case of finite AO basis sets

The role of the static Kohn-Sham (KS) response function describing the response of the electron density to a change of the local KS potential is discussed in both the theory of the optimized effective potential (OEP) and the so-called inverse Kohn-Sham problem involving the task to find the local KS potential for a given electron density. In a general discussion of the integral equation to be solved in both cases, it is argued that a unique solution of this equation can be found even in case of finite atomic orbital basis sets. It is shown how a matrix representation of the response function can be obtained if the exchange-correlation potential is expanded in terms of a Schmidt-orthogonalized basis comprising orbitals products of occupied and virtual orbitals. The viability of this approach in both OEP theory and the inverse KS problem is illustrated by numerical examples.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2025

FuSED – Users Manual – (V.5.26)

The Fusion of Simulation, Experiment, and Data (FuSED) team provides a set of tools for solving inverse problems in structural dynamics (InverseSD) and thermal physics (InverseAria), a sensor placement optimization tool via Optimal Experimental Design (OED), and a decision boundary tool using SVMs (TRACE). These methods are used for designing experiments, model calibration, and verification/validation analysis of systems. This document provides a user’s guide.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2021

Analytic continuation of noisy data using Adams Bashforth residual neural network

We propose a data-driven learning framework for the analytic continuation problem in numerical quantum many-body physics. Designing an accurate and efficient framework for the analytic continuation of imaginary time using computational data is a grand challenge that has hindered meaningful links with experimental data. The standard Maximum Entropy (MaxEnt)-based method is limited by the quality of the computational data and the availability of prior information. Also, the MaxEnt is not able to solve the inversion problem under high level of noise in the data. Here we introduce a novel learning model for the analytic continuation problem using a Adams-Bashforth residual neural network (AB-ResNet). Additionally, the advantage of this deep learning network is that it is model independent and, therefore, does not require prior information concerning the quantity of interest given by the spectral function. More importantly, the ResNet-based model achieves higher accuracy than MaxEnt for data with higher level of noise. Finally, numerical examples show that the developed AB-ResNet is able to recover the spectral function with accuracy comparable to MaxEnt where the noise level is relatively small.

97 MATHEMATICS AND COMPUTING↗
NASA NTRSDate not supplied

Aeroacoustic Optimization of Installed Propeller Configurations with Scattering and Shielding Effects

An optimization capability is developed for acoustic scattering and shielding of installed propellers and rotors, based on a spacetime Galerkin time domain boundary element method (TDBEM). The time domain approach is particularly suitable for efficient simulation of transient, rotating, and broadband noise sources such as propellers. The use of algorithmic differentiation allows efficient evaluation of design sensitivities required for gradient-based design optimization with a large number of design variables. We present a validation exercise for the coherent broadband scattering capability against an analytical solution, showing excellent agreement. We then demonstrate the optimization tool on a series of inverse design cases with broadband and rotating sources, as well as an optimization problem for a propeller-wing configuration. The results show good performance for optimization problems with the characteristics of realistic installed propeller configurations.

Maks J Groom↗
NASA NTRSDate not supplied

Aeroacoustic Optimization of Installed Propeller Configurations with Scattering and Shielding Effects

An optimization capability is developed for acoustic scattering and shielding of installed propellers and rotors, based on a spacetime Galerkin time domain boundary element method (TDBEM). The time domain approach is particularly suitable for efficient simulation of transient, rotating, and broadband noise sources such as propellers. The use of algorithmic differentiation allows efficient evaluation of design sensitivities required for gradient-based design optimization with a large number of design variables. We present a validation exercise for the coherent broadband scattering capability against an analytical solution, showing excellent agreement. We then demonstrate the optimization tool on a series of inverse design cases with broadband and rotating sources, as well as an optimization problem for a propeller-wing configuration. The results show good performance for optimization problems with the characteristics of realistic installed propeller configurations.

Maks J Groom↗
NASA NTRS2018

Optimal Control Prediction Method for Control Allocation

This paper proposes a novel prediction method for online optimal control allocation that extends the volume of moments achievable with the Moore-Penrose generalized inverse to the entire Attainable Moment Set. This method formulates the control allocation problem using selected basis vectors and associated gains which reduces the optimization problem dimensions and provides physical insight into the resulting optimal solutions. The proposed algorithm finds the entire family of unique optimal control solutions along the desired moment vector from the origin to the boundary of the Attainable Moment Set. Numerical results for the Moore-Penrose prediction method show that the unique minimal controls obtained yield the desired moment with near machine precision accuracy while maintaining control effectors within specified position limits. This method has been fully validated against the unique solution obtained on the boundary of the Attainable Moment Set using the Durham Direct Allocation method. Minimal control solutions obtained for moments in the interior of the Attainable Moment Set, similarly yield the desired moment to near machine precision while providing control solutions that are smaller (i.e. 2-norm) than solutions found with traditional control allocation algorithms (e.g. interior point methods) applied to the minimal control problem. Numerical simulations using a Matlab® autocoded executable (MEX) for the representative real world problem of 3-moments with 20 individual control effectors and prescribed control position limits show a mean computation speed of approximately 125 Hz which is sufficient to enable real-time flight allocation.

Acheson, Michael J.↗
DOE OSTI2022

Large-Scale Optimization with Linear Equality Constraints Using Reduced Compact Representation

For optimization problems with linear equality constraints, we prove that the (1,1) block of the inverse KKT matrix remains unchanged when projected onto the nullspace of the constraint matrix. In this work, we develop reduced compact representations of the limited-memory inverse BFGS Hessian to compute search directions efficiently when the constraint Jacobian is sparse. Orthogonal projections are implemented by a sparse QR factorization or a preconditioned LSQR iteration. In numerical experiments two proposed trust-region algorithms improve in computation times, often significantly, compared to previous implementations of related algorithms and compared to IPOPT.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2017

A geometric projection method for designing three-dimensional open lattices with inverse homogenization

Topology optimization is a methodology for assigning material or void to each point in a design domain in a way that extremizes some objective function, such as the compliance of a structure under given loads, subject to various imposed constraints, such as an upper bound on the mass of the structure. Geometry projection is a means to parameterize the topology optimization problem, by describing the design in a way that is independent of the mesh used for analysis of the design's performance; it results in many fewer design parameters, necessarily resolves the ill-posed nature of the topology optimization problem, and provides sharp descriptions of the material interfaces. We extend previous geometric projection work to 3 dimensions and design unit cells for lattice materials using inverse homogenization. We perform a sensitivity analysis of the geometric projection and show it has smooth derivatives, making it suitable for use with gradient-based optimization algorithms. The technique is demonstrated by designing unit cells comprised of a single constituent material plus void space to obtain light, stiff materials with cubic and isotropic material symmetry. Here, we also design a single-constituent isotropic material with negative Poisson's ratio and a light, stiff material comprised of 2 constituent solids plus void space.

42 ENGINEERING↗
NASA NTRS1992

An inverse dynamics approach to trajectory optimization for an aerospace plane

An inverse dynamics approach for trajectory optimization is proposed. This technique can be useful in many difficult trajectory optimization and control problems. The application of the approach is exemplified by ascent trajectory optimization for an aerospace plane. Both minimum-fuel and minimax types of performance indices are considered. When rocket augmentation is available for ascent, it is shown that accurate orbital insertion can be achieved through the inverse control of the rocket in the presence of disturbances.

Lu, Ping↗