Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “Numerical optimization”

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 1,765 records · Page 98

CFD-Guided Combustion System Optimization of a Gasoline Range Fuel in a Heavy-Duty Compression Ignition Engine Using Automatic Piston Geometry Generation and a Supercomputer

A computational fluid dynamics (CFD) guided combustion system optimization was conducted for a heavy-duty diesel engine running with a gasoline fuel that has a research octane number (RON) of 80. The goal was to optimize the gasoline compression ignition (GCI) combustion recipe (piston bowl geometry, injector spray pattern, in-cylinder swirl motion, and thermal boundary conditions) for improved fuel efficiency while maintaining engine-out NO x within a 1-1.5 g/kW-hr window. The numerical model was developed using the multi-dimensional CFD software CONVERGE. A two-stage design of experiments (DoE) approach was employed with the first stage focusing on the piston bowl shape optimization and the second addressing refinement of the combustion recipe. For optimizing the piston bowl geometry, a software tool, CAESES, was utilized to automatically perturb key bowl design parameters. This led to the generation of 256 combustion chamber designs evaluated at several engine operating conditions. The second DoE campaign was conducted to optimize injector spray patterns, fuel injection strategies and in-cylinder swirl motion for the best performing piston bowl designs from the first DoE campaign. This comprehensive optimization study was performed on a supercomputer, Mira, to accelerate the development of an optimized fuel-efficiency focused design. Compared to the production combustion system in the baseline engine, the new combustion recipe from this study showed significantly improved closed-cycle fuel efficiency across key engine operating points while meeting the engine-out NO x targets. Optimized piston bowl designs and injector spray patterns were predicted to provide enhanced in-cylinder air utilization and more rapid mixing-controlled combustion, thereby leading to a fuel efficiency improvement. In addition, shifting the engine thermal boundary conditions toward leaner operation was also key to the improved fuel efficiency.

33 ADVANCED PROPULSION SYSTEMS↗

WE-G-17A-03: MRIgRT: Quantification of Organ Motion

Purpose: To develop an MRI-based methodology and tools required for the quantification of organ motion on a dedicated MRI-guided radiotherapy system. A three-room facility, consisting of a TrueBeam 6X linac vault, a 1.5T MR suite and a brachytherapy interventional room, is currently under commissioning at our institution. The MR scanner can move and image in either room for diagnostic and treatment guidance purposes. Methods: A multi-imaging modality (MR, kV) phantom, featuring programmable 3D simple and complex motion trajectories, was used for the validation of several image sorting algorithms. The testing was performed on MRI (e.g. TrueFISP, TurboFLASH), 4D CT and 4D CBCT. The image sorting techniques were based on a) direct image pixel manipulation into columns or rows, b) single and aggregated pixel data tracking and c) using computer vision techniques for global pixel analysis. Subsequently, the motion phantom and sorting algorithms were utilized for commissioning of MR fast imaging techniques for 2D-cine and 4D data rendering. MR imaging protocols were optimized (e.g. readout gradient strength vs. SNR) to minimize the presence of susceptibility-induced distortions, which were reported through phantom experiments and numerical simulations. The system-related distortions were also quantified (dedicated field phantom) and treated as systematic shifts where relevant. Results: Image sorting algorithms were validated for specific MR-based applications such as quantification of organ motion, local data sampling, and 4D MRI for pre-RT delivery with accuracy better than the raw image pixel size (e.g. 1 mm). MR fast imaging sequences were commissioning and imaging strategies were developed to mitigate spatial artifacts with minimal penalty on the image spatial and temporal sampling. Workflows (e.g. liver) were optimized to include the new motion quantification tools for RT planning and daily patient setup verification. Conclusion: Comprehensive methods were developed and validated for the quantification of organ motion with applications in MRI-guided RT.

60 APPLIED LIFE SCIENCES↗

High-Order Mesh hr-adaptivity for Surface Fitting to Implicit Geometries

We present an ℎ𝑟-adaptivity framework for morphing a given mesh to fit a target surface prescribed as the zero isocontour of a discrete function. In this framework, high-order meshing is posed as a variational minimization problem that depends on the mesh quality prescribed via the target matrix optimization paradigm (TMOP) and position of a subset of mesh nodes with respect to the target surface. The proposed formulation ensures that the variational problem is converged and mesh quality degradation near the surface is limited, even when the mesh topology is incompatible with the target surface. Additionally, a mesh subset-based approach and ℎ-refinement is introduced to efficiently increase fitting accuracy while reducing the computational cost of the mesh morphing problem. The ℎ𝑟-adaptivity technique extends to different element types in two- and three-dimensions, and can be used in existing finite element and spectral element frameworks to obtain high-order body-fitted meshes. Various numerical experiments demonstrate the robustness and accuracy of the fitting approach for problems of practical interest such as Lagrangian hydrodynamics and topology optimization.

97 MATHEMATICS AND COMPUTING↗

Numerical studies on the performance of a flow distributor in tank

Flow distributors are generally observed in several nuclear power plants. During core make-up tank (CMT) injection into the reactor, the condensation and thermal stratification are observed in the CMT, and rapid condensation disturbs the injection operation. To reduce the condensation phenomena in the tank, CMT was equipped with a flow distributor. The optimal design of the flow distributor is very important to ensure the structural integrity the CMT and its safe operation during certain transient or accident conditions. In the present study, we numerically investigated the performance of a flow distributor in tank with different shape factors such as the total number of holes, pitch-to-hole diameter ratios, diameter of the hole, and the area ratios. These data will contribute to a design of the flow distributor.

21 SPECIFIC NUCLEAR REACTORS AND ASSOCIATED PLANTS↗

Proximal Galerkin: A Structure-Preserving Finite Element Method for Pointwise Bound Constraints

The proximal Galerkin finite element method is a high-order, low iteration complexity, nonlinear numerical method that preserves the geometric and algebraic structure of pointwise bound constraints in infinite-dimensional function spaces. This paper introduces the proximal Galerkin method and applies it to solve free boundary problems, enforce discrete maximum principles, and develop a scalable, mesh-independent algorithm for optimal design with pointwise bound constraints. This paper also introduces the latent variable proximal point (LVPP) algorithm, from which the proximal Galerkin method derives. When analyzing the classical obstacle problem, we discover that the underlying variational inequality can be replaced by a sequence of second-order partial differential equations (PDEs) that are readily discretized and solved with, e.g., the proximal Galerkin method. Throughout this work, we arrive at several contributions that may be of independent interest. These include (1) a semilinear PDE we refer to as the entropic Poisson equation; (2) an algebraic/geometric connection between high-order positivity-preserving discretizations and certain infinite-dimensional Lie groups; and (3) a gradient-based, bound-preserving algorithm for two-field, density-based topology optimization. The complete proximal Galerkin methodology combines ideas from nonlinear programming, functional analysis, tropical algebra, and differential geometry and can potentially lead to new synergies among these areas as well as within variational and numerical analysis. Open-source implementations of our methods accompany this work to facilitate reproduction and broader adoption.

97 MATHEMATICS AND COMPUTING↗

nu-TRLan User Guide Version 1.0: A High-Performance Software Package for Large-Scale Harmitian Eigenvalue Problems

The original software package TRLan, [TRLan User Guide], page 24, implements the thick restart Lanczos method, [Wu and Simon 2001], page 24, for computing eigenvalues {lambda} and their corresponding eigenvectors v of a symmetric matrix A: Av = {lambda}v. Its effectiveness in computing the exterior eigenvalues of a large matrix has been demonstrated, [LBNL-42982], page 24. However, its performance strongly depends on the user-specified dimension of a projection subspace. If the dimension is too small, TRLan suffers from slow convergence. If it is too large, the computational and memory costs become expensive. Therefore, to balance the solution convergence and costs, users must select an appropriate subspace dimension for each eigenvalue problem at hand. To free users from this difficult task, nu-TRLan, [LNBL-1059E], page 23, adjusts the subspace dimension at every restart such that optimal performance in solving the eigenvalue problem is automatically obtained. This document provides a user guide to the nu-TRLan software package. The original TRLan software package was implemented in Fortran 90 to solve symmetric eigenvalue problems using static projection subspace dimensions. nu-TRLan was developed in C and extended to solve Hermitian eigenvalue problems. It can be invoked using either a static or an adaptive subspace dimension. In order to simplify its use for TRLan users, nu-TRLan has interfaces and features similar to those of TRLan: (1) Solver parameters are stored in a single data structure called trl-info, Chapter 4 [trl-info structure], page 7. (2) Most of the numerical computations are performed by BLAS, [BLAS], page 23, and LAPACK, [LAPACK], page 23, subroutines, which allow nu-TRLan to achieve optimized performance across a wide range of platforms. (3) To solve eigenvalue problems on distributed memory systems, the message passing interface (MPI), [MPI forum], page 23, is used. The rest of this document is organized as follows. In Chapter 2 [Installation], page 2, we provide an installation guide of the nu-TRLan software package. In Chapter 3 [Example], page 3, we present a simple nu-TRLan example program. In Chapter 4 [trl-info structure], page 7, and Chapter 5 [trlan subroutine], page 14, we describe the solver parameters and interfaces in detail. In Chapter 6 [Solver parameters], page 21, we discuss the selection of the user-specified parameters. In Chapter 7 [Contact information], page 22, we give the acknowledgements and contact information of the authors. In Chapter 8 [References], page 23, we list reference to related works.

97 MATHEMATICS AND COMPUTING↗

Optimal Transfer Operators in Algebraic Two-Level Methods for Nonsymmetric and Indefinite Problems

Consider an algebraic two-level method applied to the 𝑛-dimensional linear system 𝐴⁢𝒙 = 𝒃 using fine-space preconditioner (i.e., “relaxation” or “smoother”) 𝑀, with 𝑀 ≈ 𝐴, restriction and interpolation 𝑅 and 𝑃, and algebraic coarse-space operator 𝐴 𝑐 : = 𝑅 ∗ ⁢𝐴⁢𝑃. Then, what are the best possible transfer operators 𝑅 and 𝑃 of a given dimension 𝑛 𝑐 < 𝑛? Brannick et al. [12] showed that when 𝐴 and 𝑀 are Hermitian positive definite (HPD), the optimal interpolation is such that its range contains the 𝑛 𝑐 smallest generalized eigenvectors of the matrix pencil (𝐴, 𝑀). Recently, in Ali et al. [5] we generalized this framework to the non-HPD setting, by considering both right (interpolation) and left (restriction) generalized eigenvectors of (𝐴, 𝑀) and defining corresponding nonsymmetric transfer operators {𝑅#, 𝑃#}. Tight convergence bounds for {𝑅#, 𝑃#} are derived in spectral radius, as well as a proof of pseudo-optimality. Note, {𝑅#, 𝑃#} are typically complex valued, which is not practical for real-valued problems. Here, in this work, we build on [5], first characterizing all inner products in which the coarse-space correction defined by {𝑅#, 𝑃#} is orthogonal. We then develop tight two-level convergence bounds in these norms, and prove that the underlying transfer operators {𝑅#, 𝑃#} are genuinely optimal. As a special case, our theory both recovers and extends the HPD results from [12]. Finally, we show how to construct optimal, real-valued transfer operators in the case of that 𝐴 and 𝑀 are real valued, but are not HPD. Numerical examples arising from a discretized advection-reaction equation, wave-equation, and Stokes equations are used to verify and illustrate the theory.

97 MATHEMATICS AND COMPUTING↗

Designing a Framework for Solving Multiobjective Simulation Optimization Problems

Multiobjective simulation optimization (MOSO) problems are optimization problems with multiple conflicting objectives, where evaluation of at least one of the objectives depends on a black-box numerical code or real-world experiment, which we refer to as a simulation. Whereas an extensive body of research is dedicated to developing new algorithms and methods for solving these and related problems, it is challenging and time-consuming to integrate these techniques into real-world production-ready solvers. This is partly because of the diversity and complexity of modern state-of-the-art MOSO algorithms and methods and partly because of the complexity and specificity of many real-world problems and their corresponding computing environments. The complexity of this problem is only compounded when introducing potentially complex and/or domain-specific surrogate-modeling techniques, problem formulations, design spaces, and data acquisition functions. Here, this paper carefully surveys the current state of the art in MOSO algorithms, techniques, and solvers, as well as problem types and computational environments where MOSO is commonly applied. We then present several key challenges in the design of a parallel multiobjective simulation optimization framework (ParMOO) and how they have been addressed. Finally, we provide two case studies demonstrating how customized ParMOO solvers can be quickly built and deployed to solve real-world MOSO problems.

engineering design optimization↗

Numerical solution of the Hartree-Fock equation in molecular geometries

Solutions of the restricted Hartree-Fock equations are obtained for small molecules using a combination of variationally optimized atomic orbitals centered on the nuclei and corrections computed on a Cartesian mesh. The problem of finding the corrections is reduced to the problem of solving the Hartree-Fock equations with inhomogeneous terms. An iterative method is developed in which the equation is treated as an inhomogeneous Helmholtz equation with the potential terms transferred to the inhomogeneous term. Terms in the equation that arise from rapid variation of the orbitals in the neighborhoods of the nuclei are treated analytically. The Helmholtz equation can then be solved using a fast Fourier transform method. Results for a number of small molecules that are accurate at the millihartree level are presented. The method for solving the inhomogeneous Hartree-Fock equation should be applicable to other problems of quantum chemistry.

74 ATOMIC AND MOLECULAR PHYSICS↗

32 species validation of a new Illumina paired-end approach for the development of microsatellites

Development and optimization of novel species-specific microsatellites, or simple sequence repeats (SSRs) remains an important step for studies in ecology, evolution, and behavior. Numerous approaches exist for identifying new SSRs that vary widely in terms of both time and cost investments. A recent approach of using paired-end Illumina sequence data in conjunction with the bioinformatics pipeline, PAL_FINDER, has the potential to substantially reduce the cost and labor investment while also improving efficiency. However, it does not appear that the approach has been widely adopted, perhaps due to concerns over its broad applicability across taxa. Therefore, to validate the utility of the approach we developed SSRs for 32 species representing 30 families, 25 orders, 11 classes, and six phyla and optimized SSRs for 13 of the species. Overall the IPE method worked extremely well and we identified 1000s of SSRs for all species (mean = 128,485), with 17% of loci being potentially amplifiable loci, and 25% of these met our most stringent criteria designed to that avoid SSRs associated with repetitive elements. Approximately 61% of screened primers yielded strong amplification of a single locus.

54 ENVIRONMENTAL SCIENCES↗

Economic Dispatch With Distributed Energy Resources: Co-Optimization of Transmission and Distribution Systems

The increasing penetration of distributed energy resources (DERs) in the distribution networks has turned the conventionally passive load buses into active buses that can provide grid services for the transmission system. To take advantage of the DERs in the distribution networks, this letter formulates a transmission-and-distribution (T&D) systems co-optimization problem that achieves economic dispatch at the transmission level and optimal voltage regulation at the distribution level by leveraging large generators and DERs. A primal-dual gradient algorithm is proposed to solve this optimization problem jointly for T&D systems, and a distributed market-based equivalent of the gradient algorithm is used for practical implementation. Finally, the results are corroborated by numerical examples with the IEEE 39-Bus system connected with 7 different distribution networks.

24 POWER TRANSMISSION AND DISTRIBUTION↗

Online Stochastic Optimization of Networked Distributed Energy Resources

Our work investigates distributed control and incentive mechanisms to coordinate distributed energy resources (DERs) with both continuous and discrete decision variables as well as device dynamics in distribution grids. We formulate a multi-period social welfare maximization problem, and based on its convex relaxation propose a distributed stochastic dual gradient algorithm for managing DERs. Moreover, we extend it to an online realtime setting with time-varying operating conditions, asynchronous updates by devices, and feedback being leveraged to account for nonlinear power flows as well as reduce communication overhead. The resulting algorithm provides a general online stochastic optimization algorithm for coordinating networked DERs with discrete power setpoints and dynamics to meet operational and economic objectives and constraints. We characterize the convergence of the algorithm analytically and evaluate its performance numerically.

24 POWER TRANSMISSION AND DISTRIBUTION↗

Manifold Sampling for Optimizing Nonsmooth Nonconvex Compositions

Here we propose a manifold sampling algorithm for minimizing a nonsmooth composition $f= h\circ F$, where we assume $h$ is nonsmooth and may be inexpensively computed in closed form and $F$ is smooth but its Jacobian may not be available. We additionally assume that the composition $h\circ F$ defines a continuous selection. Manifold sampling algorithms can be classified as model-based derivative-free methods, in that models of $F$ are combined with particularly sampled information about $h$ to yield local models for use within a trust-region framework. We demonstrate that cluster points of the sequence of iterates generated by the manifold sampling algorithm are Clarke stationary. We consider the tractability of three particular subproblems generated by the manifold sampling algorithm and the extent to which inexact solutions to these subproblems may be tolerated. Numerical results demonstrate that manifold sampling as a derivative-free algorithm is competitive with state-of-the-art algorithms for nonsmooth optimization that utilize first-order information about $f$.

97 MATHEMATICS AND COMPUTING↗

Residuals-based distributionally robust optimization with covariate information

We consider data-driven approaches that integrate a machine learning prediction model within distributionally robust optimization (DRO) given limited joint observations of uncertain parameters and covariates. Our framework is flexible in the sense that it can accommodate a variety of regression setups and DRO ambiguity sets. We investigate asymptotic and finite sample properties of solutions obtained using Wasserstein, sample robust optimization, and phi-divergence-based ambiguity sets within our DRO formulations, and explore cross-validation approaches for sizing these ambiguity sets. Through numerical experiments, we validate our theoretical results, study the effectiveness of our approaches for sizing ambiguity sets, and illustrate the benefits of our DRO formulations in the limited data regime even when the prediction model is misspecified.

97 MATHEMATICS AND COMPUTING↗

Load Forecasting Based Distribution System Network Reconfiguration -- A Distributed Data-Driven Approach

In this paper, a short-term load forecasting approach based network reconfiguration is proposed in a parallel manner. Specifically, a support vector regression (SVR) based short-term load forecasting approach is designed to provide an accurate load prediction and benefit the network reconfiguration. Because of the nonconvexity of the three-phase balanced optimal power flow, a second-order cone program (SOCP) based approach is used to relax the optimal power flow problem. Then, the alternating direction method of multipliers (ADMM) is used to compute the optimal power flow in distributed manner. Considering the limited number of the switches and the increasing computation capability, the proposed network reconfiguration is solved in a parallel way. The numerical results demonstrate the feasible and effectiveness of the proposed approach.

24 POWER TRANSMISSION AND DISTRIBUTION↗

Three-dimensional photogrammetric measurement of magnetic field lines in the WEGA stellarator

The magnetic confinement of plasmas in fusion experiments can significantly degrade due to perturbations of the magnetic field. A precise analysis of the magnetic field in a stellarator-type experiment utilizes electrons as test particles following the magnetic field line. The usual fluorescent detector for this electron beam limits the provided information to two-dimensional cut views at certain toroidal positions. However, the technique described in this article allows measuring the three-dimensional structure of the magnetic field by means of close-range photogrammetry. After testing and optimizing the main diagnostic components, measurements of the magnetic field lines were accomplished with a spatial resolution of 5 mm. The results agree with numeric calculations, qualifying this technique as an additional tool to investigate magnetic field configurations in a stellarator. For a possible future application, ways are indicated on how to reduce experimental error sources.

70 PLASMA PHYSICS AND FUSION TECHNOLOGY↗

Layer-Parallel Training of Deep Residual Neural Networks

Residual neural networks (ResNets) are a promising class of deep neural networks that have shown excellent performance for a number of learning tasks, e.g., image classification and recognition. Mathematically, ResNet architectures can be interpreted as forward Euler discretizations of a nonlinear initial value problem whose time-dependent control variables represent the weights of the neural network. Hence, training a ResNet can be cast as an optimal control problem of the associated dynamical system. For similar time-dependent optimal control problems arising in engineering applications, parallel-in-time methods have shown notable improvements in scalability. This paper demonstrates the use of those techniques for efficient and effective training of ResNets. The proposed algorithms replace the classical (sequential) forward and backward propagation through the network layers with a parallel nonlinear multigrid iteration applied to the layer domain. This adds a new dimension of parallelism across layers that is attractive when training very deep networks. From this basic idea, we derive multiple layer-parallel methods. The most efficient version employs a simultaneous optimization approach where updates to the network parameters are based on inexact gradient information in order to speed up the training process. Finally, using numerical examples from supervised classification, we demonstrate that the new approach achieves a training performance similar to that of traditional methods, but enables layer-parallelism and thus provides speedup over layer-serial methods through greater concurrency.

97 MATHEMATICS AND COMPUTING↗

The arbitrary‐order virtual element method for linear elastodynamics models: convergence, stability and dispersion‐dissipation analysis

Abstract We design the conforming virtual element method for the numerical approximation of the two‐dimensional elastodynamics problem. We prove stability and convergence of the semidiscrete approximation and derive optimal error estimates under h ‐ and p ‐refinement in both the energy and the L 2 norms. The performance of the proposed virtual element method is assessed on a set of different computational meshes, including nonconvex cells up to order four in the h ‐refinement setting. Exponential convergence is also experimentally observed under p ‐refinement. Finally, we present a dispersion‐dissipation analysis for both the semidiscrete and fully discrete schemes, showing that polygonal meshes behave as classical simplicial/quadrilateral grids in terms of dispersion‐dissipation properties.

Antonietti, Paola F.↗