Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “Linear 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,675 records · Page 93

Model Identification for Optimal Diesel Emissions Control

In this paper we develop a model based con- troller for diesel emission reduction using system identification methods. Specifically, our method minimizes the downstream readings from a production NOx sensor while injecting a minimal amount of urea upstream. Based on the linear quadratic estimator we derive the closed form solution to a cost function that accounts for the case some of the system inputs are not controllable. Our cost function can also be tuned to trade-off between input usage and output optimization. Our approach performs better than a production controller in simulation. Our NOx conversion efficiency was 92.7% while the production controller achieved 92.4%. For NH3 conversion, our efficiency was 98.7% compared to 88.5% for the production controller.

Stevens, Andrew J.↗

Active Power Control for Wind Farms Using Distributed Model Predictive Control and Nearest Neighbor Communication: Preprint

Wind plant control strategies, including axial induction and wake steering control, aim to improve the performance of wind farms, including increasing energy production and decreasing turbine loads. This paper presents a linear model of wake characteristics for use with a distributed model predictive control method for the purpose of optimizing axial induction and yaw misalignment setpoints. In particular, we use an iterative, distributed control method with nearest neighbor communication to coordinate turbine control actions that account for wake interactions between turbines. Simulations of the model and controller are performed on a 2x3 array of turbines using a modified version of the FLOw Redirection and Induction in Steady-state (FLORIS) model to dynamically track the relevant wake parameters. Preliminary results show the controller's ability to follow an arbitrary wind farm power reference signal for the purpose of providing active power control (APC) ancillary services for power grid stability. This efficient distributed control strategy can enable real-time wind farm optimization and control, even for very large scale farms.

17 WIND ENERGY↗

A Unified Tracer Analysis of DESI DR2 Baryon Acoustic Oscillations

We improve upon previous efforts to optimally combine overlapping galaxy samples in the DESI baryon acoustic oscillation analysis. By weighting each galaxy by its linear bias, overlapping galaxies are combined into a single, unified catalog, naturally avoiding double counting of cosmic volume and including all auto- and cross- information at the catalog level. Improvements over the previous effort include the addition of QSO out to $z=1.6$ to account for all overlapping DR2 tracers and redshift-dependent bias treatment to improve reconstruction. We report distance measurements using this unified tracer, and find them to be highly consistent with the baseline DR2 BAO analysis. We also test for tracer-dependent systematics within the DESI data, and find no evidence of tracer-dependent systematics within $0.8

Sanders, N. [Ohio U., Athens] (ORCID:0009000800202↗

A parallel WLS state estimator on shared memory computers

This paper describes our experience with developing a parallel weighted- least-square (WLS) state estimation (SE) program for shared-memory parallel computers. Since the key computational kernel of the WLS algorithm based on the Newton-Raphson approach is a solver of sparse linear equations, a significant part of our effort was focused on selecting, implementing and evaluating this algorithm. An optimized shared memory version of the conjugate gradient (CG) algorithm was found to be competitive to state-of-the-art implementation of LU solvers for the SE problem on the SGI Altix, a shared memory architecture. We also ported the full SE algorithm including CG to the Cray MTA-2 shared memory multithreaded architecture and investigated its performance.

97 MATHEMATICS AND COMPUTING↗

Wind load analysis of a new linear Fresnel receiver assembly design

A linear Fresnel collector includes a low-profile reflector array and a receiver assembly with one or more absorber tubes and an optional secondary reflector. This combined optical system concentrates sunlight and converts it into thermal energy. The design of a receiver assembly is critical to the performance of a linear Fresnel collector. A position deviation of a few centimeters for the receiver assembly can result in notably reduced performance, thus leading to a direct loss in revenue associated with thermal power production. Wind load is one of the most significant environmental factors that can alter the optical - and therefore thermal - performance of a solar power system due to displacements after installation. At the same time, an over-designed receiver assembly may add unnecessary construction cost to a typically high-cost-constrained system. Thus, wind load analysis is particularly important when considering optimal engineering design of a receiver assembly and its supporting structure to cost-effectively mitigate the impacts of wind. In this study, a detailed computational fluid dynamics (CFD) model is adopted to derive the wind load of a commercial linear Fresnel receiver assembly. This wind load is then used as a reference to optimize the detailed engineering design. The CFD model is first carefully developed and benchmarked within a critical regime toward turbulence. The drag force, lift force, and vortex-shedding frequencies are derived at both the operating and survival wind-speed limits for target project deployment locations. The wind load analysis results provide a valuable reference for future engineering design and prototyping.

17 WIND ENERGY↗

Sparse Cholesky factorization for solving nonlinear PDEs via Gaussian processes

In recent years, there has been widespread adoption of machine learning-based approaches to automate the solving of partial differential equations (PDEs). Among these approaches, Gaussian processes (GPs) and kernel methods have garnered considerable interest due to their flexibility, robust theoretical guarantees, and close ties to traditional methods. They can transform the solving of general nonlinear PDEs into solving quadratic optimization problems with nonlinear, PDE-induced constraints. However, the complexity bottleneck lies in computing with dense kernel matrices obtained from pointwise evaluations of the covariance kernel, and its partial derivatives, a result of the PDE constraint and for which fast algorithms are scarce. The primary goal of this paper is to provide a near-linear complexity algorithm for working with such kernel matrices. We present a sparse Cholesky factorization algorithm for these matrices based on the near-sparsity of the Cholesky factor under a novel ordering of pointwise and derivative measurements. The near-sparsity is rigorously justified by directly connecting the factor to GP regression and exponential decay of basis functions in numerical homogenization. We then employ the Vecchia approximation of GPs, which is optimal in the Kullback-Leibler divergence, to compute the approximate factor. This enables us to compute ϵ-approximate inverse Cholesky factors of the kernel matrices with complexity O(N log d (N/ϵ)) in space and O(N log 2d (N/ϵ)) in time. We integrate sparse Cholesky factorizations into optimization algorithms to obtain fast solvers of the nonlinear PDE. We numerically illustrate our algorithm’s near-linear space/time complexity for a broad class of nonlinear PDEs such as the nonlinear elliptic, Burgers, and Monge-Ampère equations. In summary, we provide a fast, scalable, and accurate method for solving general PDEs with GPs and kernel methods.

97 MATHEMATICS AND COMPUTING↗

Optimal PMU Restoration for Power System Observability Recovery After Massive Attacks

Cyber-physically resilient power system operation requires rapid recovery of situational awareness after disastrous scenarios such as massive cyber attacks. In this article, the concept of optimal sequential restoration of Phasor Measurement Units is introduced, aiming at rapid recovery of power system observability in post-attack scenarios. Additionally, the observability recovery problem is formulated as a Mixed Integer Linear Programming problem to maximize the cumulative observability level gained over time during the restoration process. Three alternative objective functions-maximizing the number of observable buses, the number of observable branches, and the total amount of observable power flow-are considered. The effectiveness of the proposed optimal strategy is verified by comparing it with heuristic approaches on the IEEE 57-bus system.

24 POWER TRANSMISSION AND DISTRIBUTION↗

Placement and Sizing of Inverter-Based Renewable Systems in Multi-Phase Distribution Networks

This study develops a tractable formulation for optimal placement and sizing of inverter-based renewable systems in multi-phase distribution networks. The goal of the formulation is to minimize the cost of inverter installation, average power import, and average distributed generation curtailment. Threephase and single-phase inverter models are presented that preserve the underlying mappings between renewable uncertainty to power injection. The uncertainty of distributed generators (DGs) and loads are characterized by a finite set of scenarios. Linear multi-phase power flow approximations are used in conjunction with scenario reduction techniques to arrive at a tractable twostage stochastic formulation for optimal DG placement and sizing. First-stage decisions are locations for DG deployment and capacity sizes, and second-stage decisions include DG real power curtailment, reactive power support, as well as feeder voltage profile. The resulting formulation is a mixed-integer second-order cone program and can be solved efficiently either by existing optimization solvers or by relaxing the binary variables to the [0,1] interval. Simulation studies on standard multi-phase IEEE test feeders promise that optimal stochastic planning of DGs reduces costs during validation, compared to a scheme where uncertainty is only represented by its average value.

24 POWER TRANSMISSION AND DISTRIBUTION↗

Representation Learning via Quantum Neural Tangent Kernels

Variational quantum circuits are used in quantum machine learning and variational quantum simulation tasks. Designing good variational circuits or predicting how well they perform for given learning or optimization tasks is still unclear. Here we discuss these problems, analyzing variational quantum circuits using the theory of neural tangent kernels. We define quantum neural tangent kernels, and derive dynamical equations for their associated loss function in optimization and learning tasks. We analytically solve the dynamics in the frozen limit, or lazy training regime, where variational angles change slowly and a linear perturbation is good enough. We extend the analysis to a dynamical setting, including quadratic corrections in the variational angles. We then consider a hybrid quantum classical architecture and define a large-width limit for hybrid kernels, showing that a hybrid quantum classical neural network can be approximately Gaussian. The results presented here show limits for which analytical understandings of the training dynamics for variational quantum circuits, used for quantum machine learning and optimization problems, are possible. These analytical results are supported by numerical simulations of quantum machine-learning experiments.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Role of the laser pulse-length in producing high-quality electron beams in a homogenous plasma

In laser wakefield acceleration, the pulse-length of the laser is an important parameter that affects the laser evolution and electron beam injection and acceleration in the bubble regime. Here, we use three-dimensional simulations to find, for a given plasma density, the optimal pulse-length that gives the best quality electron beam. For three different pulse lengths, we study the evolution dynamics of the laser spot-size and quality of the injected electron beam. We find that a pulse-length that is less than the theoretical optimum, {tau}{sub L} = {lambda}{sub p}/{radical}2{pi}c, derived from linear theory, gives the best beam quality. Conversely, our simulations suggest that for a given laser system, with a fixed pulse-length, there is an optimal value of the plasma density that will give the best quality accelerated beams in experiments. For an rms pulse-length of 10 fs (around 24 fs FWHM), this corresponds to a plasma density of around 3.4 Multiplication-Sign 10{sup 18}/cm{sup 3}. For these parameters, we obtain, in a homogenous plasma and with a single laser, an electron beam with an energy of around 700 MeV, an energy-spread less than 2%, and rms normalized emittance of a few {pi} mm-mrad.

43 PARTICLE ACCELERATORS↗

Transport spatial model for the definition of green routes for city logistics centers

This paper presents a transport spatial decision support model (TSDSM) for carrying out the optimization of green routes for city logistics centers. The TSDSM model is based on the integration of the multi-criteria method of Weighted Linear Combination (WLC) and the modified Dijkstra algorithm within a geographic information system (GIS). The GIS is used for processing spatial data. The proposed model makes it possible to plan routes for green vehicles and maximize the positive effects on the environment, which can be seen in the reduction of harmful gas emissions and an increase in the air quality in highly populated areas. The scheduling of delivery vehicles is given as a problem of optimization in terms of the parameters of: the environment, health, use of space and logistics operating costs. Each of these input parameters was thoroughly examined and broken down in the GIS into criteria which further describe them. The model presented here takes into account the fact that logistics operators have a limited number of environmentally friendly (green) vehicles available. The TSDSM was tested on a network of roads with 127 links for the delivery of goods from the city logistics center to the user. The model supports any number of available environmentally friendly or environmentally unfriendly vehicles consistent with the size of the network and the transportation requirements. - Highlights: • Model for routing light delivery vehicles in urban areas. • Optimization of green routes for city logistics centers. • The proposed model maximizes the positive effects on the environment. • The model was tested on a real network.

54 ENVIRONMENTAL SCIENCES↗

Detectors for Linear Colliders: Detector design for a Future Electron-Positron Collider (4/4)

In this lecture I will discuss the issues related to the overall design and optimization of a detector for ILC and CLIC energies. I will concentrate on the two main detector concepts which are being developed in the context of the ILC. Here there has been much recent progress in developing realistic detector models and in understanding the physics performance of the overall detector concept. In addition, I will discuss the how the differences in the detector requirements for the ILC and CLIC impact the overall detector design.

72 PHYSICS OF ELEMENTARY PARTICLES AND FIELDS↗

Network coding for improving throughput in WDM optical networks with dedicated protection

Network coding (NC) has been recently emerging as an excellent technique for leveraging network efficiency. In optical networks, NC and protection appear to be a good match and indeed, NC could be effectively exploited for greater protection efficiency thanks to the opportunity of combining signals rather than duplication in the traditional approach. Motivated by this observation, we investigate the application of a simple and practical NC technique based on XOR operation to improve the network throughput in survivable optical networks. To this end, we propose the NC-based protection whose speed recovery is on a par with the conventional 1+1 dedicated protection while the capacity usage could be more efficient, paving the way for improving throughput in constrained capacity conditions. A novel mixed integer linear programming model is developed for survivable optical networks design employing the proposed NC-based protection. The model attempts to optimally determine the demands to serve, the routing for served demands and NC assignment among demands aiming at maximizing the network throughput in the constraint of bandwidth limitation. Extensive numerical evaluations on realistic topologies are provided to highlight the advantages of our NC-based protection proposal compared with the conventional dedicated protection in improving the network throughput. Encouraging results are observed when the new protection proposal based on NC could accommodate up to 30% more traffic than the conventional case.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Data Structures for Extreme Scale Computing

As computing problems of national importance grow, the government meets the increased demand by funding the development of ever larger systems. The overarching goal of the work supported in part by this grant is to increase efficiency of programming and performing computations on these large computing systems. In past work, we have demonstrated that some of these computations once thought to require expensive hardware designs and/or complex, special-purpose programming may be executed efficiently on low-cost commodity cluster computing systems using a general-purpose “latency-tolerant” programming framework. One important developed application of the ideas underlying this framework is graph database technology supporting social network pattern matching used by US intelligence agencies to more quickly identify potential terrorist threats. This database application has been spun out by the Pacific Northwest National Laboratory, a Department of Energy Laboratory, into a commercial start-up, Trovares Inc. We explore an alternative application of the same underlying ideas to a well-studied challenge arising in engineering: solving unstructured sparse linear equations. Solving these equations is key to predicting the behavior of large electronic circuits before they are fabricated. Predicting that behavior ahead of fabrication means that designs can optimized and errors corrected ahead of the expense of manufacture.

42 ENGINEERING↗

An Optimization-based Atomistic-to-Continuum Coupling Method

In this paper, we present a new optimization-based method for atomistic-to-continuum (AtC) coupling. The main idea is to cast the latter as a constrained optimization problem with virtual Dirichlet controls on the interfaces between the atomistic and continuum subdomains. The optimization objective is to minimize the error between the atomistic and continuum solutions on the overlap between the two subdomains, while the atomistic and continuum force balance equations provide the constraints. Separation, rather then blending of the atomistic and continuum problems, and their subsequent use as constraints in the optimization problem distinguishes our approach from the existing AtC formulations. Finally, we present and analyze the method in the context of a one-dimensional chain of atoms modeled using a linearized two-body potential with next-nearest neighbor interactions.

97 MATHEMATICS AND COMPUTING↗

McCormick envelopes in mixed-integer PDE-constrained optimization

McCormick envelopes are a standard tool for deriving convex relaxations of optimization problems that involve polynomial terms. Such McCormick relaxations provide lower bounds, for example, in branch-and-bound procedures for mixed-integer nonlinear programs but have not gained much attention in PDE-constrained optimization so far. This lack of attention may be due to the distributed nature of such problems, which on the one hand leads to infinitely many linear constraints (generally state constraints that may be difficult to handle) in addition to the state equation for a pointwise formulation of the McCormick envelopes and renders bound-tightening procedures that successively improve the resulting convex relaxations computationally intractable. We analyze McCormick envelopes for a model problem class that is governed by a semilinear PDE involving a bilinearity and integrality constraints. We approximate the nonlinearity and in turn the McCormick envelopes by averaging the involved terms over the cells of a partition of the computational domain on which the PDE is defined. This yields convex relaxations that underestimate the original problem up to an a priori error estimate that depends on the mesh size of the discretization. These approximate McCormick relaxations can be improved by means of an optimization-based bound-tightening procedure. We show that their minimizers converge to minimizers to a limit problem with a pointwise formulation of the McCormick envelopes when driving the mesh size to zero. We provide a computational example, for which we certify all of our imposed assumptions. The results point to both the potential of the methodology and the gaps in the research that need to be closed. Our methodology provides a framework first for obtaining pointwise underestimators for nonconvexities and second for approximating them with finitely many linear inequalities in an infinite-dimensional setting.

Approximations and Expansions↗

TU-CD-BRA-05: Atlas Selection for Multi-Atlas-Based Image Segmentation Using Surrogate Modeling

Purpose: The growing size and heterogeneity in training atlas necessitates sophisticated schemes to identify only the most relevant atlases for the specific multi-atlas-based image segmentation problem. This study aims to develop a model to infer the inaccessible oracle geometric relevance metric from surrogate image similarity metrics, and based on such model, provide guidance to atlas selection in multi-atlas-based image segmentation. Methods: We relate the oracle geometric relevance metric in label space to the surrogate metric in image space, by a monotonically non-decreasing function with additive random perturbations. Subsequently, a surrogate’s ability to prognosticate the oracle order for atlas subset selection is quantified probabilistically. Finally, important insights and guidance are provided for the design of fusion set size, balancing the competing demands to include the most relevant atlases and to exclude the most irrelevant ones. A systematic solution is derived based on an optimization framework. Model verification and performance assessment is performed based on clinical prostate MR images. Results: The proposed surrogate model was exemplified by a linear map with normally distributed perturbation, and verified with several commonly-used surrogates, including MSD, NCC and (N)MI. The derived behaviors of different surrogates in atlas selection and their corresponding performance in ultimate label estimate were validated. The performance of NCC and (N)MI was similarly superior to MSD, with a 10% higher atlas selection probability and a segmentation performance increase in DSC by 0.10 with the first and third quartiles of (0.83, 0.89), compared to (0.81, 0.89). The derived optimal fusion set size, valued at 7/8/8/7 for MSD/NCC/MI/NMI, agreed well with the appropriate range [4, 9] from empirical observation. Conclusion: This work has developed an efficacious probabilistic model to characterize the image-based surrogate metric on atlas selection. Analytical insights lead to valid guiding principles on fusion set size design.

22 GENERAL STUDIES OF NUCLEAR REACTORS↗

Efficient Parameterization of Density Functional Tight-Binding for 5 f -Elements: A Th–O Case Study

Density functional tight binding (DFTB) models for f-element species are challenging to parametrize owing to the large number of adjustable parameters. The explicit optimization of the terms entering the semiempirical DFTB Hamiltonian related to f orbitals is crucial to generating a reliable parametrization for f-block elements, because they play import roles in bonding interactions. However, since the number of parameters grows quadratically with the number of orbitals, the computational cost for parameter optimization is much more expensive for the f-elements than for the main group elements. In this work we present a set of efficient approaches for mitigating the hurdle imposed by the large size of the parameter space. A novel group-by-orbital correction functions for two-center bond integrals was developed. With this approach the number of parameters is reduced, and it grows linearly with the number of elements, maintaining the accuracy and the number of parameters, in the case of f elements, by more than 40%. The parameter optimization step was accelerated by means of the mini-batch BFGS method. This method allows parameter optimizations with much larger training sets than other single batch methods. A stochastic optimizer was employed that helped overcome shallow local minima in the objective function. The proposed algorithm was used to parametrize the DFTB Hamiltonian for the Th–O system, which was subsequently applied to the study of ThO 2 nanoparticles. The training set consisted of 6322 unique structures, which is barely feasible with conventional optimization methods. The optimized parameter set, LANL-ThO, displays good agreement with DFT-calculated properties such as energies, forces, and structures for both clusters and bulk ThO 2 . Benefiting from the fewer number of parameters and lower computational costs for objective function evaluations, this new approach shows its potential applications in DFTB parametrization for elements with high angular momentum, which present a challenge to conventional methods.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗