Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “approximation algorithms”

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,045 records · Page 58

Stochastic Approximation for Multi-period Simulation Optimization with Streaming Input Data

We consider a continuous-valued simulation optimization (SO) problem, where a simulator is built to optimize an expected performance measure of a real-world system while parameters of the simulator are estimated from streaming data collected periodically from the system. At each period, a new batch of data is combined with the cumulative data and the parameters are re-estimated with higher precision. The system requires the decision variable to be selected in all periods. Therefore, it is sensible for the decision-maker to update the decision variable at each period by solving a more precise SO problem with the updated parameter estimate to reduce the performance loss with respect to the target system. We define this decision-making process as the multi-period SO problem and introduce a multi-period stochastic approximation (SA) framework that generates a sequence of solutions. Two algorithms are proposed: Re-start SA (ReSA) reinitializes the stepsize sequence in each period, whereas Warm-start SA (WaSA) carefully tunes the stepsizes, taking both fewer and shorter gradient-descent steps in later periods as parameter estimates become increasingly more precise. We show that under suitable strong convexity and regularity conditions, ReSA and WaSA achieve the best possible convergence rate in expected sub-optimality either when an unbiased or a simultaneous perturbation gradient estimator is employed, while WaSA accrues significantly lower computational cost as the number of periods increases. In addition, we present the regularized ReSA, which obviates the need to know the strong convexity constant and achieves the same convergence rate at the expense of additional computation.

Computer Science↗

Parameter Optimization Toolbox for NS-3 network optimization, NS-3 Parameter Optimization Framework [SWR-18-60]

This simulation-based parameter optimization framework is proposed to tune parameters of different types of communication networks using ns-3 to achieve the optimal network performance. It consists of three main components: an ns-3 packet reporting module; a sampler running simulations with all possible parameter sets for the input parameter variables by using a parallel executor at each generation; and a hybrid optimization algorithm for tuning configurable parameters of hybrid designs and application parameter variables. The proposed hybrid metaheuristic optimization algorithm combines an evolutionary algorithm with a gradient descent function to quickly achieve an approximate globally optimum solution. This software is designed to be used in a multi-core processing Linux environment and run over a long duration of time. The execution time varies depending mainly upon the nature of the ns-3 configuration being simulated. This software includes a custom ns-3 QoS measurement application which must be included with the ns-3 source code during installation of the software.

Hasandka, Adarsh↗

A Provably Accurate Randomized Sampling Algorithm for Logistic Regression

In statistics and machine learning, logistic regression is a widely-used supervised learning technique primarily employed for binary classification tasks. When the number of observations greatly exceeds the number of predictor variables, we present a simple, randomized sampling-based algorithm for logistic regression problem that guarantees high-quality approximations to both the estimated probabilities and the overall discrepancy of the model. Our analysis builds upon two simple structural conditions that boil down to randomized matrix multiplication, a fundamental and well-understood primitive of randomized numerical linear algebra. We analyze the properties of estimated probabilities of logistic regression when leverage scores are used to sample observations, and prove that accurate approximations can be achieved with a sample whose size is much smaller than the total number of observations. To further validate our theoretical findings, we conduct comprehensive empirical evaluations. Overall, our work sheds light on the potential of using randomized sampling approaches to efficiently approximate the estimated probabilities in logistic regression, offering a practical and computationally efficient solution for large-scale datasets.

Chowdhury, Agniva↗

Resonance compensation at the CERN PS booster aided by Bayesian optimization and BOBYQA

The CERN Proton Synchrotron Booster (PSB) operation involves the crossing of multiple resonance lines in the tune diagram. Loss maps from dynamic tune scans are a helpful way to visualize and quantify the strength of such resonances. Sextupole and octupole correctors can be used in order to partially or fully compensate multiple resonance lines, i.e., third and fourth order lines. The following work explores the application of advanced optimization algorithms such as Bayesian Optimization and Bound Optimization By Quadratic Approximation (BOBYQA) in order to compensate these resonance lines with available correctors.

43 PARTICLE ACCELERATORS↗

Beam correction for multi-pass arcs in FFA@CEBAF: status update

This work examines the multi-pass steering of six electron beams in an FFA arc ranging from approximately 10.5 GeV to 22 GeV. Shown here is an algorithm based on singular value decomposition (SVD) to successfully steer all six beams through the arc given precise knowledge of all beam positions at each of one hundred and one diagnostic locations with one hundred individual corrector magnets: that is successive application of SVD to different 100 × 101 response matrices—one for each beam energy. Further, a machine learning scheme is developed which only requires knowledge of the energy-averaged beam position at each location to provide equivalent steering. Extension of this scheme to other beam optics quantities as well as transverse and longitudinal coupling is explored.

Accelerator Physics↗

Miniaturized Air-to-Refrigerant Heat Exchangers

Air-to-refrigerant Heat eXchangers (HX) are an essential component of Heating, Ventilation, Air-Conditioning, and Refrigeration (HVAC&R) systems, serving as the main heat transfer component. The major limiting factor to HX performance is the large airside thermal resistance. Recent literature aims at improving heat transfer performance by utilizing enhancement methods such as fins and small tube diameters; this has lead to almost exhaustive research on the microchannel HX (MCHX). The objective of this project is to develop a miniaturized air-to-refrigerant HX with at least 20% reduction in volume, material volume, and approach temperature compared to current state-of-the-art multiport flat tube designs and also be capable of production within five years. Moreover, the proposed HX’s are expected to have good water drainage and should succeed in both evaporator and condenser applications. The project leveraged Parallel-Parametrized Computational Fluid Dynamics (PPCFD) and Approximation-Assisted Optimization (AAO) techniques to perform multi-scale analysis and shape optimization with the intent of developing novel HX designs whose thermal-hydraulic performance exceeds that of state-of-the-art MCHX. Nine heat exchanger geometries were initially chosen for detailed analysis, selected from 35+ geometries which were identified in previous work at the University of Maryland, College Park. The newly developed optimization framework was exercised for three design optimization problems: (DP I) 1.0kW radiator, (DP II) 10kW radiator and (DP III) 10kW two-phase HX. DP I consisted of the design and optimization of 1.0kW air-to-water HX’s which exceeded the project requirements of 20% volume/material reduction and 20% better performance. Two prototypes for the 1.0kW HX were prototyped, tested and validated using newly-designed airside and refrigerant side test facilities. DP II, a scaled version DP I for 10kW air-to-water HX applications, also yielded optimized HX designs which met project requirements. Attempts to prototype a 10kW have presented unique manufacturing challenges, especially regarding tube blockages and structural stability. DP III comprised optimizing two-phase HX’s for a 3.0Ton capacity in a heat pump / air-conditioning unit for cooling mode application using R410A as the working fluid. The HX’s theoretically address the project requirements. System-level analysis showed the HX’s achieved up to 15% improvement in COP while also reducing overall unit charge by 30-40%. The project methodology was capable of developing HX’s which can outperform current state-of-the-art MCHX by at least 20% reduction in volume, material volume, and approach temperature. Additionally, the capability for optimization using refrigerant charge as an objective function was developed. The five-year manufacturing feasibility of the proposed HX’s was shown to have a good outlook. Successful prototyping through both conventional manufacturing methods and next generation methods such as additive manufacturing was achieved.

32 ENERGY CONSERVATION, CONSUMPTION, AND UTILIZATI↗

Towards TDDFT for Strongly Correlated Materials

We present some details of our recently-proposed Time-Dependent Density-Functional Theory (TDDFT) for strongly-correlated materials in which the exchange-correlation (XC) kernel is derived from the charge susceptibility obtained using Dynamical Mean-Field Theory (the TDDFT + DMFT approach). We proceed with deriving the expression for the XC kernel for the one-band Hubbard model by solving DMFT equations via two approaches, the Hirsch–Fye Quantum Monte Carlo (HF-QMC) and an approximate low-cost perturbation theory approach, and demonstrate that the latter gives results that are comparable to the exact HF-QMC solution. Furthermore, through a variety of applications, we propose a simple analytical formula for the XC kernel. Additionally, we use the exact and approximate kernels to examine the nonhomogeneous ultrafast response of two systems: a one-band Hubbard model and a Mott insulator YTiO3. We show that the frequency dependence of the kernel, i.e., memory effects, is important for dynamics at the femtosecond timescale. We also conclude that strong correlations lead to the presence of beats in the time-dependent electric conductivity in YTiO3, a feature that could be tested experimentally and that could help validate the few approximations used in our formulation. We conclude by proposing an algorithm for the generalization of the theory to non-linear response.

75 CONDENSED MATTER PHYSICS, SUPERCONDUCTIVITY AND↗

First Detection of the Baryon Acoustic Oscillation (BAO) Feature in the 3-Point Correlation Function of DESI DR1 Luminous Red Galaxies

We present the first detection of the 3-Point Correlation Function (3PCF) Baryon Acoustic Oscillation (BAO) signal from the DESI Data Release 1 (DR1) sample of Luminous Red Galaxies (LRGs), which contains over 2.1 million galaxies. Our analysis is based on a tree-level redshift-space bispectrum template, which is then transformed to position space using the Fast Fourier Transform on Logarithmic scales (FFTLog) algorithm. We detect the BAO feature with a significance of approximately $8.1σ$ using the EZmock covariance matrix and $8.5σ$ using the analytical covariance matrix, for the full LRG redshift range ($0.4

Kamalinejad, Farshad [Florida U.] (ORCID:000000017↗

A Low-Rank Multigrid Method for the Stochastic Steady-State Diffusion Problem

We study a multigrid method for solving large linear systems of equations with tensor product structure here. Such systems are obtained from stochastic finite element discretization of stochastic partial differential equations such as the steady-state diffusion problem with random coefficients. When the variance in the problem is not too large, the solution can be well approximated by a low-rank object. In the proposed multigrid algorithm, the matrix iterates are truncated to low rank to reduce memory requirements and computational effort. The technique is proved convergent with an analytic error bound. Numerical experiments show its effectiveness in solving the Galerkin systems compared to the original multigrid solver, especially when the number of degrees of freedom associated with the spatial discretization is large.

97 MATHEMATICS AND COMPUTING↗

Efficiency in nonequilibrium molecular dynamics Monte Carlo simulations

Hybrid algorithms combining nonequilibrium molecular dynamics and Monte Carlo (neMD/MC) offer a powerful avenue for improving the sampling efficiency of computer simulations of complex systems. These neMD/MC algorithms are also increasingly finding use in applications where conventional approaches are impractical, such as constant-pH simulations with explicit solvent. However, selecting an optimal nonequilibrium protocol for maximum efficiency often represents a non-trivial challenge. This work evaluates the efficiency of a broad class of neMD/MC algorithms and protocols within the theoretical framework of linear response theory. The approximations are validated against constant pH-MD simulations and shown to provide accurate predictions of neMD/MC performance. An assessment of a large set of protocols confirms (both theoretically and empirically) that a linear work protocol gives the best neMD/MC performance. Lastly, a well-defined criterion for optimizing the time parameters of the protocol is proposed and demonstrated with an adaptive algorithm that improves the performance on-the-fly with minimal cost.

97 MATHEMATICS AND COMPUTING↗

Adaptive resource allocation for surrogate modeling of systems comprised of multiple disciplines with varying fidelity

We present an adaptive algorithm for constructing surrogate models for integrated systems composed of a set of coupled components. With this goal we introduce ‘coupling’ variables with a priori unknown distributions that allow approximations of each component to be built independently. Once built, the surrogates of the components are combined and used to predict system-level quantities of interest (QoI) at a fraction of the cost of interrogating the full system model. We use a greedy experimental design procedure, based upon a modification of Multi-Index Stochastic Collocation (MISC), to minimize the error of the combined surrogate. This is achieved by refining each component surrogate in accordance with its relative contribution to error in the approximation of the system-level QoI. Our adaptation of MISC is a multi-fidelity procedure that can leverage ensembles of models of varying cost and accuracy, for one or more components, to produce estimates of system-level QoI. Several numerical examples demonstrate the efficacy of the proposed approach on systems involving feed-forward and feedback coupling. For a fixed computational budget, the proposed algorithm is able to produce approximations that are orders of magnitude more accurate than approximations that treat the integrated system as a black-box.

97 MATHEMATICS AND COMPUTING↗

Reconstructing lower hybrid fields from ray tracing data

Ray tracing methods are commonly used to estimate the propagation of RF fields in plasmas. By going to higher order in the approximations used to derive the ray equations, it is possible to also reconstruct an approximate field from a family of rays. However, this field reconstruction is often neglected, primarily because of the difficulty of automatically dealing with focusing and reflections (caustics) in computational algorithms. In this work, we have been examining the feasibility of using tools developed for semi-classical quantum approximations to do RF field reconstructions. Specifically, it is possible to obtain a set of ODE's which approximately describe the dynamics of a wave packet centered on a ray. From this information, an approximate field can be reconstructed. We here report preliminary results for the reconstruction of lower hybrid fields using this technique.

70 PLASMA PHYSICS AND FUSION TECHNOLOGY↗

Multigrid Reduction in Time for Chaotic Dynamical Systems

As CPU clock speeds have stagnated and high performance computers continue to have ever higher core counts, increased parallelism is needed to take advantage of these new architectures. Traditional serial time-marching schemes can be a significant bottleneck, as many types of simulations require large numbers of time-steps which must be computed sequentially. Parallel-in-time schemes, such as the Multigrid Reduction in Time (MGRIT) method, remedy this by parallelizing across time-steps and have shown promising results for parabolic problems. However, chaotic problems have proved more difficult, since chaotic initial value problems (IVPs) are inherently ill-conditioned. MGRIT relies on a hierarchy of successively coarser time-grids to iteratively correct the solution on the finest time-grid, but due to the nature of chaotic systems, small inaccuracies on the coarser levels can be greatly magnified and lead to poor coarse-grid corrections. Here we introduce a modified MGRIT algorithm based on an existing quadratically converging nonlinear extension to the multigrid Full Approximation Scheme (FAS), as well as a novel time-coarsening scheme. Together, these approaches better capture long-term chaotic behavior on coarse-grids and greatly improve convergence of MGRIT for chaotic IVPs. Further, we introduce a novel low-memory variant of the algorithm for solving chaotic PDEs with MGRIT which not only solves the IVP, but also provides estimates for the unstable Lyapunov vectors of the system. Finally, we provide supporting numerical results for the Lorenz system and demonstrate parallel speedup for the chaotic Kuramoto–Sivashinsky PDE over a significantly longer time-domain than in previous works.

97 MATHEMATICS AND COMPUTING↗

Algorithm for Computation of Electromagnetic Fields of An Accelerated Short Bunch Inside a Rectangular Chamber

We discuss the feasibility of an application of an implicit finite-difference approximation to calculate the fields of a relativistic bunch moving with no restriction inside a vacuum chamber. We assume that a bunch trajectory is not straight but is inside a vacuum chamber or its branch. The bunch can be deflected by the fields of bending magnets. The bunch can be short enough to produce coherent synchrotron radiation (CSR). Accelerator physicists believe that electromagnetic phenomena of charged beams are governed by Maxwell's equations together with Newton's equations for particle dynamics. To understand the behavior of the beams and radiated fields we just need to find a solution to these equations for the case, which can fully describe the real accelerator environment. So, at first we make a model, which contains all the necessary components, but at the same time can be easily 'inserts' into the equations. Sometimes, it is possible to find analytical solutions, but usually they are only work for one-dimensional cases and rarer for two-dimension cases. To find a solution in general we may transform the equations into a equivalent finite-difference form and solve them using computers. We can find a lot of finite-difference schemes, which approximate Maxwell's equations since the first one that was published in 1966. Most of them are so called explicit schemes. That means that the value of the field at the new time step is calculated only by the field values at the previous time step. Stability conditions for these schemes do not allow a time step to be greater than or equal to a space (mesh) step. This limitation brings an additional troublesome effect for short wavelengths compared a mesh step. We state that this effect works like a frequency dispersion media, which is 'hidden' in the finite-difference equation.

43 PARTICLE ACCELERATORS↗

Model-based and Model-free Designs for an Extended Continuous-time LQR with Exogenous Inputs

We present an extended linear quadratic regulator (LQR) design for continuous-time linear time-invariant (LTI) systems in the presence of exogenous inputs. We first propose a model-based solution with cost minimization guarantees for states and inputs using dynamic programming (DP). The control law consists of a combination of the optimal state feedback and an additional optimal term dependent on the exogenous inputs. The control gains for the two components are obtained by solving a set of matrix differential equations. We provide these solutions for both finite horizons and steady-state cases. In the second part of the paper, we formulate a reinforcement learning (RL) based algorithm which does not need any model information except the input matrix, and can compute an approximate steady-state LQR gain using measurements of the states, the control inputs, and the exogenous inputs. Both model-based and data-driven optimal control algorithms are tested with a numerical example under different exogenous inputs showcasing the effectiveness of the designs.

Mukherjee, Sayak↗

Performance of biologically inspired algorithms tuned on TiO 2 nanoparticle benchmark system

Biologically inspired optimization algorithms (BIOA), such as particle swarm optimization (PSO) and differential evolution (DE), are often applied to a specific problem with the tacit assumptions that each algorithm will have a unique set of “ideal” tuning parameters that provide “best” performance, and that, once tuned, two different optimization algorithms ought to exhibit distinct performance. This work tests those assumptions by systematically comparing PSO and DE applied to identify stable and metastable configurations of a benchmark system, a titania dimer Ti 2 O 4 , whose energy is described by a modified Matsui-Akaogi pairwise potential. The hypotheses (H) are formally expressed as: (H1) for both PSO and DE there exists a unique, optimal set of tuning parameters that maximize its performance on a given problem; (H2) when running two different BIOAs, one algorithm must demonstrate superior performance over the other. By identifying and studying an approximate Pareto-optimal set of tuning parameters for DE and PSO, H1 is shown to be strictly false for DE, and tentatively false for PSO, while H2 is shown to be false with respect to certain statistics. Here, we further investigate the correlations between key tuning parameters and algorithm performance. Our conclusion may be implemented to further optimize and develop BIOAs applied to materials systems.

36 MATERIALS SCIENCE↗

TU-G-204-09: The Effects of Reduced- Dose Lung Cancer Screening CT On Lung Nodule Detection Using a CAD Algorithm

Purpose: While Lung Cancer Screening CT is being performed at low doses, the purpose of this study was to investigate the effects of further reducing dose on the performance of a CAD nodule-detection algorithm. Methods: We selected 50 cases from our local database of National Lung Screening Trial (NLST) patients for which we had both the image series and the raw CT data from the original scans. All scans were acquired with fixed mAs (25 for standard-sized patients, 40 for large patients) on a 64-slice scanner (Sensation 64, Siemens Healthcare). All images were reconstructed with 1-mm slice thickness, B50 kernel. 10 of the cases had at least one nodule reported on the NLST reader forms. Based on a previously-published technique, we added noise to the raw data to simulate reduced-dose versions of each case at 50% and 25% of the original NLST dose (i.e. approximately 1.0 and 0.5 mGy CTDIvol). For each case at each dose level, the CAD detection algorithm was run and nodules greater than 4 mm in diameter were reported. These CAD results were compared to “truth”, defined as the approximate nodule centroids from the NLST reports. Subject-level mean sensitivities and false-positive rates were calculated for each dose level. Results: The mean sensitivities of the CAD algorithm were 35% at the original dose, 20% at 50% dose, and 42.5% at 25% dose. The false-positive rates, in decreasing-dose order, were 3.7, 2.9, and 10 per case. In certain cases, particularly in larger patients, there were severe photon-starvation artifacts, especially in the apical region due to the high-attenuating shoulders. Conclusion: The detection task was challenging for the CAD algorithm at all dose levels, including the original NLST dose. However, the false-positive rate at 25% dose approximately tripled, suggesting a loss of CAD robustness somewhere between 0.5 and 1.0 mGy. NCI grant U01 CA181156 (Quantitative Imaging Network); Tobacco Related Disease Research Project grant 22RT-0131.

60 APPLIED LIFE SCIENCES↗

Automatic Calibration and Health Monitoring of Infrastructure Sensors

Smart transportation infrastructure relies on networks of heterogeneous sensors - cameras, radars, and lidars - continuously monitoring traffic conditions. However, executing the initial spatial calibration of multiple sensors and the subsequent health monitoring presents significant operational challenges. Environmental factors, mechanical vibrations, and gradual drift cause spatial misalignment, degrading fusion performance and tracking accuracy. Traditional calibration approaches require manual intervention with specialized targets or survey equipment, resulting in service interruptions and high maintenance costs. This work presents an automated framework for initial calibration and continuous health monitoring without human intervention or service disruption. Our approach addresses two critical problems: (1) detecting when sensors become miscalibrated during operation, and (2) automatically re-establishing spatial alignment using only operational traffic data. The health monitoring component analyzes measurement innovations - differences between sensor observations and predicted object states - to detect systematic biases indicative of calibration drift. By computing bias magnitude, directional consistency, and rejection rates, the system identifies miscalibrations as small as 0.5 meters. Unlike traditional methods requiring known calibration targets, our diagnostic operates continuously on live traffic observations, enabling early detection before fusion quality degrades. The automatic recalibration algorithm leverages overlapping sensor fields-of-view and temporal correlation of vehicle observations. Using graph-based optimization, the system automatically discovers which sensor pairs observe common regions, estimates pairwise spatial transformations using RANSAC-based robust estimation, and jointly optimizes all sensor poses through bundle adjustment. The framework handles practical deployment challenges, including different sensor sampling rates (1-10 Hz), varying installation positions, unknown orientations, and limited overlap regions (>10%). When approximate sensor positions are available from installation surveys (+/-1m accuracy), the algorithm additionally estimates sensor orientations, refining both position and rotation to sub-meter and sub-degree accuracy. We validate the framework on multi-hour traffic datasets from six heterogeneous sensors with sampling rates ranging from 1 Hz to 10 Hz. Results demonstrate successful calibration even with sparse overlap (<20%) and automatic detection of miscalibrations exceeding 0.8 meters. This work enables a "deploy-and-forget" sensor infrastructure that maintains calibration autonomously, reducing maintenance costs while improving tracking accuracy. The techniques generalize beyond transportation to any multi-sensor monitoring application requiring robust spatial alignment, including smart cities, industrial monitoring, and surveillance systems.

24 POWER TRANSMISSION AND DISTRIBUTION↗